Typed Tagless Final Interpreters

DOI10.1007/978-3-642-32202-0_3zbMath1375.68039OpenAlexW1489879801MaRDI QIDQ4649380

Oleg Kiselyov

Publication date: 21 November 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-32202-0_3

Mathematics Subject Classification ID

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

Related Items (6)

FFT program generation for ring LWE-based cryptography ⋮ Generating C. System description ⋮ Deep embedding with class ⋮ Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library ⋮ Typing with Leftovers - A mechanization of Intuitionistic Multiplicative-Additive Linear Logic ⋮ Session types without sophistry. System description

This page was built for publication: Typed Tagless Final Interpreters