syntaxAlchemist/ladder-calculus
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fix naming of rules in expr_lc

Browse source
This commit is contained in:
Michael Sippel 2024-09-22 13:36:20 +02:00
parent a5d8cb979b
commit 4fde2442f1
1 changed files with 8 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
coq/terms/debruijn.v
View file

@ -280,8 +280,12 @@ Inductive expr_lc : expr_DeBruijn -> Prop :=
(type_lc σ) ->
(forall x, (x `notin` L) -> expr_lc (expr_open (ex_fvar x) e1)) ->
expr_lc (ex_abs σ e1)
| Tlc_App : forall e1 e2, expr_lc e1 -> expr_lc e2 -> expr_lc (ex_app e1 e2)
| Tlc_Let : forall e1 e2, expr_lc e1 -> expr_lc e2 -> expr_lc (ex_let e1 e2)
| Tlc_Ascend : forall τ e, type_lc τ -> expr_lc e -> expr_lc (ex_ascend τ e)
| Tlc_Descend : forall τ e, type_lc τ -> expr_lc e -> expr_lc (ex_descend τ e)
| Elc_Morph : forall σ e1 L,
(type_lc σ) ->
(forall x, (x `notin` L) -> expr_lc (expr_open (ex_fvar x) e1)) ->
expr_lc (ex_morph σ e1)
| Elc_App : forall e1 e2, expr_lc e1 -> expr_lc e2 -> expr_lc (ex_app e1 e2)
| Elc_Let : forall e1 e2, expr_lc e1 -> expr_lc e2 -> expr_lc (ex_let e1 e2)
| Elc_Ascend : forall τ e, type_lc τ -> expr_lc e -> expr_lc (ex_ascend τ e)
| Elc_Descend : forall τ e, type_lc τ -> expr_lc e -> expr_lc (ex_descend τ e)
.