Constrained polymorphic types for a calculus with name variables

DOI10.4230/LIPICS.TYPES.2015.4MaRDI QIDQ4580225zbMATH OpenFDO

Authors Davide Ancona, Paola Giannini, Elena Zucca

Publication date 13 August 2018

zbMATH Keywords

incremental rebindingmetaprogrammingname polymorphismopen code

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Incremental rebinding with name polymorphism
• Type safe incremental rebinding
• Reconciling positional and nominal binding
• A lambda-calculus for dynamic binding
• Extending the lambda-calculus with unbind and rebind

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
• Incremental rebinding with name polymorphism
• MetaML and multi-stage programming with explicit annotations
• Reconciling positional and nominal binding
• Type safe incremental rebinding

Cited in

(4)

• Incremental rebinding with name polymorphism
• Reconciling positional and nominal binding
• Type safe incremental rebinding
• An approach to completing variable names for implicitly typed functional languages

Describes a project that uses

Uses Software

• FreshML
• JavaScript

This page was built for publication: Constrained polymorphic types for a calculus with name variables

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