Generative Unbinding of Names

DOI10.2168/LMCS-4(1:4)2008MaRDI QIDQ3518270zbMATH OpenOpenAlexFDO

Authors Andrew M. Pitts, Mark R. Shinwell

Publication date 7 August 2008

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-4(1:4)2008

zbMATH Keywords

FreshML

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• Generative unbinding of names
• FreshML: programming with binders made simple
• scientific article; zbMATH DE number 1612495
• Binders unbound
• Nominal unification

Cited in

(7)

• Constrained polymorphic types for a calculus with name variables
• FreshML: programming with binders made simple
• Incremental rebinding with name polymorphism
• Hard life with weak binders
• Encoding abstract syntax without fresh names
• Generative unbinding of names
• Abstract representation of binders in OCaml using the Bindlib library

This page was built for publication: Generative Unbinding of Names

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