Binders unbound
From MaRDI portal
Publication:5176984
DOI10.1145/2034773.2034818zbMath1323.68177OpenAlexW4212957569MaRDI QIDQ5176984
Stephanie Weirich, T. Sheard, Brent A. Yorgey
Publication date: 5 March 2015
Published in: Proceedings of the 16th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2034773.2034818
Related Items (7)
A unified treatment of syntax with binders ⋮ αCheck: A mechanized metatheory model checker ⋮ POPLMark reloaded: Mechanizing proofs by logical relations ⋮ Romeo: A system for more flexible binding-safe programming ⋮ Unbound ⋮ Visual Theorem Proving with the Incredible Proof Machine ⋮ A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
Uses Software
This page was built for publication: Binders unbound
