Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
Joshua Yanovski
iriscoq
Commits
859794e3
Commit
859794e3
authored
Jul 18, 2016
by
Robbert Krebbers
Browse files
Remove old comment.
parent
85621934
Changes
1
Hide whitespace changes
Inline
Sidebyside
heap_lang/lang.v
View file @
859794e3
...
...
@@ 34,13 +34,6 @@ Qed.
Inductive
expr
:=
(
*
Base
lambda
calculus
*
)
(
*
Var
is
the
only
place
where
the
terms
contain
a
proof
.
The
fact
that
they
contain
a
proof
at
all
is
suboptimal
,
since
this
means
two
seeminlgy
convertible
terms
could
differ
in
their
proofs
.
However
,
this
also
has
some
advantages
:
*
We
can
make
the
[
X
]
an
index
,
so
we
can
do
non

dependent
match
.
*
In
expr_weaken
,
we
can
push
the
proof
all
the
way
into
Var
,
making
sure
that
proofs
never
block
computation
.
*
)

Var
(
x
:
string
)

Rec
(
f
x
:
binder
)
(
e
:
expr
)

App
(
e1
e2
:
expr
)
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment