A lambda-calculus for dynamic binding
From MaRDI portal
Publication:1127514
DOI10.1016/S0304-3975(97)00150-3zbMath0895.68015MaRDI QIDQ1127514
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (8)
Labelled reductions, runtime errors, and operational subsumption ⋮ Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction ⋮ Type safe incremental rebinding ⋮ Extending the lambda-calculus with unbind and rebind ⋮ A typed context calculus ⋮ Incremental rebinding with name polymorphism ⋮ Unnamed Item ⋮ The lambda-context calculus (extended version)
Cites Work
- A theory of binding structures and applications to rewriting
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Type inference for record concatenation and multiple inheritance
- A modest model of records, inheritance, and bounded quantification
- A semantics of multiple inheritance
- Inheritance as implicit coercion
- Full abstraction in the lazy lambda calculus
- Enriching the lambda calculus with contexts
- Parallel reductions in \(\lambda\)-calculus
- A typed context calculus
- Unnamed Item
- Unnamed Item
This page was built for publication: A lambda-calculus for dynamic binding
