Typed Tagless Final Interpreters
From MaRDI portal
Publication:4649380
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
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)