Meta-programming with names and necessity

DOI10.1145/581478.581498MaRDI QIDQ2949207zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Directly reflective meta-programming
• Typed syntactic meta-programming
• Closed types for a safe imperative MetaML
• Program Logics for Homogeneous Meta-programming
• scientific article; zbMATH DE number 4133469

Cited in

(15)

• On the dynamic extent of delimited continuations
• Type-specialized staged programming with process separation
• scientific article; zbMATH DE number 1612495 (Why is no real title available?)
• Programming languages for interactive computing
• scientific article; zbMATH DE number 4133469 (Why is no real title available?)
• Run-time manipulation of programs in a statically-typed language
• Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
• Program logics for homogeneous generative run-time meta-programming
• Typed syntactic meta-programming
• Meta-programming through typeful code representation
• Mtac: a monad for typed tactic programming in Coq
• Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism
• Meta-programming through typeful code representation
• Unified sequent calculi and natural deduction systems for until-free linear-time temporal logics
• Directly reflective meta-programming

This page was built for publication: Meta-programming with names and necessity

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