A syntactic theory of dynamic binding

DOI10.1023/A:1010087314987zbMath0934.68038OpenAlexW1542431166WikidataQ57664108 ScholiaQ57664108MaRDI QIDQ1290313

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

functional languagedynamic binding

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (11)

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

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