Constrained polymorphic types for a calculus with name variables

DOI10.4230/LIPICS.TYPES.2015.4zbMATH Open1433.68085MaRDI QIDQ4580225FDOQ4580225

Authors: Davide Ancona, Paola Giannini, Elena Zucca 

Publication date: 13 August 2018

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

zbMATH Keywords

incremental rebindingmetaprogrammingname polymorphismopen code

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

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
• Reconciling positional and nominal binding
• Dynamic rebinding for marshalling and update, with destruct-time \(\lambda\)
• Incremental rebinding with name polymorphism
• 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

Uses Software

• JavaScript
• Freshml

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)