Pages that link to "Item:Q850496"
From MaRDI portal
The following pages link to Verifying termination and reduction properties about higher-order logic programs (Q850496):
Displaying 7 items.
- The next 700 challenge problems for reasoning with higher-order abstract syntax representations. II: A survey (Q287277) (← links)
- Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax (Q438569) (← links)
- Programming Inductive Proofs (Q3058448) (← links)
- αCheck: A mechanized metatheory model checker (Q4593089) (← links)
- POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description) (Q5747747) (← links)
