A syntactic theory of dynamic binding

DOI10.1023/A:1010087314987MaRDI QIDQ1290313zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Luc Moreau

Publication date 13 April 2000

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1010087314987

zbMATH Keywords

dynamic bindingfunctional language

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• A lambda-calculus for dynamic binding
• Delimited dynamic binding
• Static semantics, types, and binding time analysis
• Dynamic rebinding for marshalling and update, with destruct-time \(\lambda\)

Cited in

(12)

• A calculus of open modules: call-by-need strategy and confluence
• Extending the lambda-calculus with unbind and rebind
• No value restriction is needed for algebraic effects and handlers
• Incremental rebinding with name polymorphism
• A syntactic correspondence between context-sensitive calculi and abstract machines
• A type-theoretic foundation of delimited continuations
• Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
• Shifting the stage. Staging with delimited control
• Type safe incremental rebinding
• Delimited dynamic binding
• Constrained polymorphic types for a calculus with name variables
• Delimited control and computational effects

This page was built for publication: A syntactic theory of dynamic binding

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