Pages that link to "Item:Q1687535"
From MaRDI portal
The following pages link to Foundational (co)datatypes and (co)recursion for higher-order logic (Q1687535):
Displaying 9 items.
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm (Q1984794) (← links)
- Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← links)
- Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving (Q2986838) (← links)
- Mechanizing coinduction and corecursion in higher-order logic (Q4340418) (← links)
- (Q4499300) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- (Q5875411) (← links)
- Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5919011) (← links)