Certifying Supercompilation for Martin-Löf’s Type Theory

DOI10.1007/978-3-662-46823-4_16zbMath1434.68096OpenAlexW824467797MaRDI QIDQ3455070

Ilya Klyuchnikov, S. A. Romanenko

Publication date: 3 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46823-4_16

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18)

Cites Work

• Higher-level supercompilation as a metasystem transition
• Verification as a parameterized testing (experiments with the SCP4 supercompiler)
• A Tutorial Implementation of a Dependently Typed Lambda Calculus
• The concept of a supercompiler
• A positive supercompiler
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Certifying Supercompilation for Martin-Löf’s Type Theory