The sequent calculus is a proof system which was designed as a more symmetric alternative to natural deduction. The {λ}{μ}{μ}-calculus is a term assignment system for the sequent calculus and a great foundation for compiler intermediate languages due to its first-class representation of evaluation contexts. Unfortunately, only experts of the sequent calculus can appreciate its beauty. To remedy this, we present the first introduction to the {λ}{μ}{μ}-calculus which is not directed at type theorists or logicians but at compiler hackers and programming-language enthusiasts. We do this by writing a compiler from a small but interesting surface language to the {λ}{μ}{μ}-calculus as a compiler intermediate language.
No takes yet. Share an insight, caveat, or question.
Binder et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: