Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
M
mpri2.4public
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
Registry
Registry
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Commits
Issue Boards
Open sidebar
POTTIER Francois
mpri2.4public
Commits
3e3eabe5
Commit
3e3eabe5
authored
Sep 26, 2017
by
POTTIER Francois
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Added Even.v.
parent
99035100
Hide whitespace changes
Inline
Sidebyside
Showing
2 changed files
with
102 additions
and
3 deletions
+102
3
README.md
README.md
+4
3
Even.v
coq/Even.v
+98
0
No files found.
README.md
View file @
3e3eabe5
...
...
@@ 69,11 +69,12 @@ We also show the limits of dependentlytyped functional programming.
Syntax and operational semantics, on paper and on a machine
(
[
slides 01a
](
slides/fpottier01a.pdf
)
)
(
[
slides 01b
](
slides/fpottier01b.pdf
)
)
(
[
Coq demo
](
coq/DemoSyntaxReduction.v
)
)
(
[
OCaml solution to NewtonRaphson exercise
](
ocaml/NewtonRaphson.ml
)
).
(
[
OCaml solution to NewtonRaphson exercise
](
ocaml/NewtonRaphson.ml
)
)
(
[
Even.v
](
coq/Even.v
)
).
*
(29/09/2017)
From a smallstep semantics down to an efficient interpreter,
in several stages.
in several stages
(
[
Coq demo
](
coq/DemoSyntaxReduction.v
)
).
*
(06/10/2017) Compiling away firstclass functions: closure conversion, defunctionalization.
*
(13/10/2017) Compiling away the call stack: the CPS transformation.
*
(20/10/2017) Equational reasoning and program optimizations.
...
...
coq/Even.v
0 → 100644
View file @
3e3eabe5
(
*
22
/
09
/
2017.
Someone
asked
during
the
course
whether
[
~
(
even
1
)]
can
be
proved
,
and
if
so
,
how
.
Here
are
several
solutions
,
courtesy
of
Pierre

Evariste
Dagand
.
*
)
Inductive
even
:
nat
>
Prop
:=

even_O
:
even
0

even_SS
:
forall
n
,
even
n
>
even
(
S
(
S
n
))
.
(
*
1.
The
shortest
proof
uses
the
tactic
[
inversion
]
to
deconstruct
the
hypothesis
[
even
1
]
,
that
is
,
to
perform
case
analysis
.
The
tactic
automatically
finds
that
this
case
is
impossible
,
so
the
proof
is
finished
.
*
)
Lemma
even1_v1
:
even
1
>
False
.
Proof
.
inversion
1.
(
*
In
case
you
wish
the
see
the
proof
term
:
*
)
(
*
Show
Proof
.
*
)
Qed
.
(
*
For
most
practical
purposes
,
the
above
proof
*
script
*
is
good
enough
,
and
is
most
concise
.
However
,
those
who
wish
to
understand
what
they
are
doing
may
prefer
to
write
a
proof
*
term
*
by
hand
,
in
the
Calculus
of
Inductive
Constructions
,
instead
of
letting
[
inversion
]
construct
a
(
possibly
needlessly
complicated
)
proof
term
.
*
)
(
*
2.
Generalizing
with
equality
.
*
)
Lemma
even1_v2
'
:
forall
n
,
even
n
>
n
=
1
>
False
.
Proof
.
exact
(
fun
n
t
=>
match
t
with

even_O
=>
fun
(
q
:
0
=
1
)
=>
match
q
with
(
*
IMPOSSIBLE
*
)
end

even_SS
n
_
=>
fun
(
q
:
S
(
S
n
)
=
1
)
=>
match
q
with
(
*
IMPOSSIBLE
*
)
end
end
)
.
Qed
.
Lemma
even1_v2
:
even
1
>
False
.
Proof
.
eauto
using
even1_v2
'
.
Qed
.
(
*
3.
Type

theoretically
,
through
a
large
elimination
.
*
)
Lemma
even1_v3
'
:
forall
n
,
even
n
>
match
n
with

0
=>
True

1
=>
False

S
(
S
_
)
=>
True
end
.
Proof
.
exact
(
fun
n
t
=>
match
t
with

even_O
=>
I

even_SS
_
_
=>
I
end
)
.
Qed
.
Lemma
even1_v3
:
even
1
>
False
.
Proof
.
apply
even1_v3
'
.
Qed
.
(
*
3
'
.
Same
technique
,
using
a
clever
[
match
...
in
...
return
]
.
*
)
Lemma
even1_v4
'
:
even
1
>
False
.
Proof
.
exact
(
fun
t
=>
match
t
in
even
n
return
(
match
n
with

0
=>
True

1
=>
False

S
(
S
_
)
=>
True
end
(
*
BUG
:
we
need
the
following
(
pointless
)
type
annotation
*
)
:
Prop
)
with

even_O
=>
I

even_SS
_
_
=>
I
end
)
.
Qed
.
Write
Preview
Markdown
is supported
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