DagSemProc.10351.6.pdf
- Filesize: 0.49 MB
- 10 pages
The purpose of this note is to illustrate the use of step-indexing combined with biorthogonality to construct syntactical logical relations. It walks through the details of a syntactically simple, yet non-trivial example: a proof of the "CIU Theorem'' for contextual equivalence in the untyped call-by-value $lambda$-calculus with recursively defined functions.
Feedback for Dagstuhl Publishing