Quasi-interpretation Synthesis by Decomposition

DOI10.1007/978-3-540-75292-9_28zbMath1147.68431OpenAlexW1501777548MaRDI QIDQ3525100

Romain Péchoux, Guillaume Bonfante, Jean-Yves Marion

Publication date: 17 September 2008

Published in: Theoretical Aspects of Computing – ICTAC 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75292-9_28

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items

A combination framework for complexity, Higher-order interpretations and program complexity, On quasi-interpretations, blind abstractions and implicit complexity, Automated Implicit Computational Complexity Analysis (System Description)