-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
added abstract to readme. corrected url in paper.
- Loading branch information
1 parent
f19bfb6
commit 82558bb
Showing
2 changed files
with
20 additions
and
3 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,4 +1,21 @@ | ||
lfinlf | ||
====== | ||
This repository comprises the public LFinLF development, including | ||
soundness and completeness of translation to canonical forms, family-level | ||
lambdas, and constants. | ||
|
||
The paper draft documenting the proof structure is lfinlf.pdf. | ||
|
||
All code by Chris Martens, 2008 - present. | ||
|
||
Paper abstract: | ||
|
||
We present a mechanized proof of the metatheory of LF, i.e. the decidability of | ||
typechecking and the existence and uniqueness of canonical forms. We use a | ||
syntactic approach in which we define a translation from LF to its canonical | ||
forms presentation (in which only beta-short, eta-long terms are well-formed) | ||
and prove soundness and completeness of the translation, establishing that | ||
definitional equivalence in LF corresponds to syntactic equivalence in | ||
canonical forms. Much recent work is based on the system of canonical | ||
forms and hereditary substitution presented herein; our proof also serves | ||
to reconcile that presentation with the traditional version based on | ||
definitional equivalence. | ||
|
||
Mechanized metatheory of LF in Twelf. |
Binary file not shown.