The following pages link to Nominal abstraction (Q617715):
Displaying 11 items.
- The next 700 challenge problems for reasoning with higher-order abstract syntax representations. II: A survey (Q287277) (← links)
- Formalized meta-theory of sequent calculi for substructural logics (Q1744443) (← links)
- Cut elimination for a logic with induction and co-induction (Q1948276) (← links)
- The undecidability of proof search when equality is a logical connective (Q2134939) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- A two-level logic approach to reasoning about computations (Q2392484) (← links)
- Formalized meta-theory of sequent calculi for linear logics (Q2424887) (← links)
- Proof Pearl: Abella Formalization of λ-Calculus Cube Property (Q4916060) (← links)
- (Q5089025) (← links)
- Constructing weak simulations from linear implications for processes with private names (Q5236556) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
