Staged computation with names and necessity

DOI10.1017/S095679680500568XMaRDI QIDQ5708289zbMATH OpenFDO

Authors Aleksandar Nanevski, Frank Pfenning

Publication date 28 November 2005

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S095679680500568X

zbMATH Keywords

staging

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• A modal analysis of staged computation
• Staged computation with staged lexical scope
• Type-specialized staged programming with process separation
• Automatically splitting a two-stage lambda calculus
• On Cross-Stage Persistence in Multi-Stage Programming

Cited in

(12)

• Incorporating quotation and evaluation into Church's type theory
• Type-specialized staged programming with process separation
• Automatically splitting a two-stage lambda calculus
• Staged computation with staged lexical scope
• Type safe incremental rebinding
• A modal analysis of staged computation
• Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
• A Logical Foundation for Environment Classifiers
• Contextual modal type theory with polymorphic contexts
• A dependently typed multi-stage calculus
• Constructive linear-time temporal logic: proof systems and Kripke semantics
• Directly reflective meta-programming

This page was built for publication: Staged computation with names and necessity

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