Programming with binders and indexed data-types

DOI10.1145/2103656.2103705zbMath1321.68141OpenAlexW4238735203MaRDI QIDQ2942890

Brigitte Pientka, Andrew Cave

Publication date: 11 September 2015

Published in: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2103656.2103705

zbMATH Keywords

dependent typeshigher-order abstract syntaxrecursive typeslogical frameworks

Mathematics Subject Classification ID

Related Items (9)

The next 700 challenge problems for reasoning with higher-order abstract syntax representations. II: A survey ⋮ Inductive Beluga: Programming Proofs ⋮ Unnamed Item ⋮ POPLMark reloaded: Mechanizing proofs by logical relations ⋮ Mtac: A monad for typed tactic programming in Coq ⋮ Programs Using Syntax with First-Class Binders ⋮ LINCX: A Linear Logical Framework with First-Class Contexts ⋮ Harpoon: mechanizing metatheory interactively ⋮ A case study in programming coinductive proofs: Howe’s method

Uses Software

• Coq
• ML
• VeriML

This page was built for publication: Programming with binders and indexed data-types