Affiliation:
1. University of Oregon, USA
2. Microsoft Research, UK
Abstract
The λ-calculus is popular as an intermediate language for practical compilers. But in the world of logic it has a lesser-known twin, born at the same time, called the
sequent calculus
. Perhaps that would make for a good intermediate language, too? To explore this question we designed Sequent Core, a practically-oriented core calculus based on the sequent calculus, and used it to re-implement a substantial chunk of the Glasgow Haskell Compiler.
Funder
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lambda the Ultimate SSA: Optimizing Functional Programs in SSA;2022 IEEE/ACM International Symposium on Code Generation and Optimization (CGO);2022-04-02
2. A Formal Equational Theory for Call-By-Push-Value;Interactive Theorem Proving;2018
3. A tutorial on computational classical logic and the sequent calculus;Journal of Functional Programming;2018
4. Compiling without continuations;Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation;2017-06-14
5. A Classical Sequent Calculus with Dependent Types;Programming Languages and Systems;2017