Typed Tagless Final Interpreters

DOI10.1007/978-3-642-32202-0_3zbMATH Open1375.68039OpenAlexW1489879801MaRDI QIDQ4649380FDOQ4649380

Authors: 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

Recommendations

• Tagless staged interpreters for typed languages
• Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
• Tag-free combinators for binding-time polymorphic program generation
• Typed syntactic meta-programming
• scientific article; zbMATH DE number 1114328
• Domain-free pure type systems
• scientific article; zbMATH DE number 1696604

Mathematics Subject Classification ID

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

Cited In (9)

• FFT program generation for ring LWE-based cryptography
• Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library
• Session types without sophistry. System description
• Generating C. System description
• Tagless staged interpreters for typed languages
• Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
• Typed self-interpretation by pattern matching
• Deep embedding with class
• Typing with Leftovers - A mechanization of Intuitionistic Multiplicative-Additive Linear Logic

This page was built for publication: Typed Tagless Final Interpreters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649380)