Combining deep and shallow embedding of domain-specific languages
From MaRDI portal
Publication:1749137
DOI10.1016/j.cl.2015.07.003zbMath1387.68057OpenAlexW1191640401MaRDI QIDQ1749137
Emil Axelsson, Josef Svenningsson
Publication date: 15 May 2018
Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cl.2015.07.003
Uses Software
Cites Work
- Unnamed Item
- The Girard-Reynolds isomorphism
- Folding domain-specific languages
- Data types à la carte
- Asymptotic Improvement of Computations over Free Monads
- Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
- Compiling embedded languages
- Regular, shape-polymorphic, parallel arrays in Haskell
- Parametric higher-order abstract syntax for mechanized semantics
- Optimising purely functional GPU programs
- Using circular programs for higher-order syntax
- The constrained-monad problem
- Simple and compositional reification of monadic embedded languages
This page was built for publication: Combining deep and shallow embedding of domain-specific languages