You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+3-2Lines changed: 3 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,8 +1,8 @@
1
1
# Isabelle proving project - Semantics of functional programming languages
2
2
3
-
In this project I want to start with a simply typed lambda calculus, prove type soundness and then extend it step by step until I am at the [latest version of System F](https://repository.brynmawr.edu/cgi/viewcontent.cgi?article=1014&context=compsci_pubs) used in GHC.
I am using [ott](https://github.com/ott-lang/ott) to generate Isabelle code for the definitions of the systems
5
+
In this project I want to start with a simply typed lambda calculus, prove type soundness and then extend it step by step until I am at the [latest version of System F](https://repository.brynmawr.edu/cgi/viewcontent.cgi?article=1014&context=compsci_pubs) used in GHC.
6
6
7
7
## Roadmap
8
8
@@ -14,6 +14,7 @@ I am using [ott](https://github.com/ott-lang/ott) to generate Isabelle code for
14
14
-[x] Extend definition
15
15
-[x] Prove Progress
16
16
-[x] Prove Preservation
17
+
-[x] Use the Nominal2 framework to reason about alpha-equated terms
0 commit comments