Pages that link to "Item:Q2392484"
From MaRDI portal
The following pages link to A two-level logic approach to reasoning about computations (Q2392484):
Displayed 21 items.
- The next 700 challenge problems for reasoning with higher-order abstract syntax representations. II: A survey (Q287277) (← links)
- Proving concurrent constraint programming correct, revisited (Q530860) (← links)
- Formalized meta-theory of sequent calculi for substructural logics (Q1744443) (← links)
- Cut elimination for a logic with induction and co-induction (Q1948276) (← links)
- Subformula linking for intuitionistic logic with application to type theory (Q2055855) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- A proof theory for model checking (Q2331070) (← links)
- Term-generic logic (Q2339466) (← links)
- Formalized meta-theory of sequent calculi for linear logics (Q2424887) (← links)
- Proof checking and logic programming (Q2628296) (← links)
- Programs Using Syntax with First-Class Binders (Q2988654) (← links)
- LINCX: A Linear Logical Framework with First-Class Contexts (Q2988658) (← links)
- αCheck: A mechanized metatheory model checker (Q4593089) (← links)
- Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions (Q4691183) (← links)
- Proof Pearl: Abella Formalization of λ-Calculus Cube Property (Q4916060) (← links)
- (Q5111317) (← links)
- Divergence and unique solution of equations (Q5111619) (← links)
- (Q5155663) (← links)
- Proof Checking and Logic Programming (Q5743582) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- Towards substructural property-based testing (Q6102253) (← links)