Meta-programming with names and necessity

DOI10.1145/581478.581498zbMath1322.68045OpenAlexW2041562780MaRDI QIDQ2949207

Aleksandar Nanevski

Publication date: 7 October 2015

Published in: Proceedings of the seventh ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/581478.581498

zbMATH Keywords

higher-order abstract syntaxmodal lambda-calculus

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Functional programming and lambda calculus (68N18)

Related Items

Directly reflective meta-programming ⋮ Type-specialized staged programming with process separation ⋮ Mtac: A monad for typed tactic programming in Coq ⋮ Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism ⋮ Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages ⋮ On the dynamic extent of delimited continuations ⋮ Programming Languages For Interactive Computing