A syntactic theory of dynamic binding

DOI10.1023/A:1010087314987zbMATH Open0934.68038DBLPjournals/lisp/Moreau98OpenAlexW1542431166WikidataQ57664108 ScholiaQ57664108MaRDI QIDQ1290313FDOQ1290313

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

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\)

zbMATH Keywords

dynamic bindingfunctional language

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cited In (12)

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