Incremental rebinding with name polymorphism

DOI10.1016/J.ENTCS.2016.03.003zbMATH Open1345.68092OpenAlexW2337724494WikidataQ113317702 ScholiaQ113317702MaRDI QIDQ737082FDOQ737082

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A calculus of module systems
• MetaML and multi-stage programming with explicit annotations
• FreshML: programming with binders made simple
• A lambda-calculus for dynamic binding
• A syntactic theory of dynamic binding
• Extending the lambda-calculus with unbind and rebind
• Generative Unbinding of Names
• Intersection types for unbind and rebind
• Reconciling positional and nominal binding
• Dynamic rebinding for marshalling and update, with destruct-time \(\lambda\)

Cited In (2)

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

Uses Software

• JavaScript
• Freshml

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)