Incremental rebinding with name polymorphism

DOI10.1016/J.ENTCS.2016.03.003MaRDI QIDQ737082zbMATH OpenOpenAlexWikidataFDO

Authors Davide Ancona, Paola Giannini, Elena Zucca

Publication date 5 August 2016

Full work available at URL https://doi.org/10.1016/j.entcs.2016.03.003

zbMATH Keywords

incremental rebindingmetaprogrammingname polymorphismopen code

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Recommendations

• Type safe incremental rebinding
• Constrained polymorphic types for a calculus with name variables
• Trustworthy Global Computing
• Extending the lambda-calculus with unbind and rebind
• A lambda-calculus for dynamic binding

Cites work

• scientific article; zbMATH DE number 43417 (Why is no real title available?)
• scientific article; zbMATH DE number 1122094 (Why is no real title available?)
• 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 \(\lambda\)
• Extending the lambda-calculus with unbind and rebind
• FreshML: programming with binders made simple
• Generative Unbinding of Names
• Intersection types for unbind and rebind
• MetaML and multi-stage programming with explicit annotations
• Reconciling positional and nominal binding

Cited in

(2)

• Constrained polymorphic types for a calculus with name variables
• Type safe incremental rebinding

Describes a project that uses

Uses Software

• FreshML
• JavaScript

This page was built for publication: Incremental rebinding with name polymorphism

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