Type safe incremental rebinding

DOI10.1017/S0960129515000109MaRDI QIDQ2971056zbMATH OpenFDO

Authors Davide Ancona, Paola Giannini, Elena Zucca

Publication date 4 April 2017

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Incremental rebinding with name polymorphism
• Extending the lambda-calculus with unbind and rebind
• Constrained polymorphic types for a calculus with name variables
• Trustworthy Global Computing
• Intersection types for unbind and rebind

Cites work

• A calculus of module systems
• A lambda-calculus for dynamic binding
• A syntactic theory of dynamic binding
• Dynamic rebinding for marshalling and update, with destruct-time
• Extending the lambda-calculus with unbind and rebind
• Featherweight Jigsaw. Replacing inheritance by composition in Java-like languages
• MetaML and multi-stage programming with explicit annotations
• Staged computation with names and necessity

Cited in

(10)

• Type-directed bounding of collections in reactive programs
• Safe \& efficient gradual typing for TypeScript
• Extending the lambda-calculus with unbind and rebind
• Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
• Constrained polymorphic types for a calculus with name variables
• Intersection types for unbind and rebind
• Reconciling positional and nominal binding
• Dynamic rebinding for marshalling and update, with destruct-time
• Trustworthy Global Computing
• Incremental rebinding with name polymorphism

This page was built for publication: Type safe incremental rebinding

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