The following pages link to Binders unbound (Q5176984):
Displaying 7 items.
- Unbound (Q34404) (← links)
- Visual Theorem Proving with the Incredible Proof Machine (Q2829254) (← links)
- A unified treatment of syntax with binders (Q3165528) (← links)
- αCheck: A mechanized metatheory model checker (Q4593089) (← links)
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
- POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924) (← links)
- Romeo: A system for more flexible binding-safe programming (Q5371971) (← links)
