Equational theory for ThunkLang
- Dominant language
- Standard ML
- Stars
- 44
- Forks
- 5
- PR merge metrics
- No merged PRs in 30d
Description
PureLang's equational theory simplifies some of its compiler proofs considerably. We should introduce a theory for ThunkLang, to simplify verification of its future passes. ThunkLang is call-by-value, so (untyped) step-indexed logical relations would appear to be a good fit. We would need only soundness of contextual equivalence (not completeness like PureLang).
Contributor guide
No contributing guide indexed for this repository
Research direction
No files, tests, or entry points are named. Start by locating PureLang’s existing equational theory and the ThunkLang compiler-verification work, then assess the proposed untyped step-indexed logical-relations approach; done means introducing the theory with soundness of contextual equivalence established.
Written by the indexing model from the issue text.
Assessment
- Domain
- compilers
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100