Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a conference presentation that introduces a novel intermediate representation based on classical sequent calculus and demonstrates its direct compilation to conventional hardware. Learn how researchers from the University of Tübingen address the fundamental challenge of creating compiler intermediate representations that balance high-level abstraction for easy surface language translation with low-level practicality for efficient code generation. Discover how classical sequent calculus, renowned in logic and proof theory for its symmetric treatment of data and control flow, serves as a natural foundation for this intermediate representation. Examine the formal description and implementation details of this approach, including how the logical system's meta-theoretical properties enable valuable code optimizations. Review preliminary performance evaluations that validate the viability of compiling classical sequent calculus directly to stock hardware, bridging the gap between theoretical foundations in logic and practical compiler implementation. Access supplementary materials including reproducible artifacts and research data that support the findings presented in this OOPSLA 2025 research contribution.
