Pages that link to "Item:Q5195258"
From MaRDI portal
The following pages link to Abella: A System for Reasoning about Relational Specifications (Q5195258):
Displayed 24 items.
- Abella (Q21444) (← links)
- Formalized meta-theory of sequent calculi for substructural logics (Q1744443) (← links)
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- \(\mathrm{HO}\pi\) in Coq (Q2031410) (← links)
- On the effectiveness of higher-order logic programming in language-oriented programming (Q2039939) (← links)
- Subformula linking for intuitionistic logic with application to type theory (Q2055855) (← links)
- Rensets and renaming-based recursion for syntax with bindings (Q2104549) (← links)
- Functions-as-constructors higher-order unification: extended pattern unification (Q2134936) (← links)
- The undecidability of proof search when equality is a logical connective (Q2134939) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Formalized meta-theory of sequent calculi for linear logics (Q2424887) (← links)
- Proof checking and logic programming (Q2628296) (← links)
- Constraint handling rules with binders, patterns and generic quantification (Q4592722) (← links)
- Proof-relevant π-calculus: a constructive account of concurrency and causality (Q4691184) (← links)
- (Q5111317) (← links)
- Divergence and unique solution of equations (Q5111619) (← links)
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem (Q5204803) (← links)
- Implementing type theory in higher order constraint logic programming (Q5236551) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus (Q6041667) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- Towards substructural property-based testing (Q6102253) (← links)
- Rensets and renaming-based recursion for syntax with bindings extended version (Q6111524) (← links)
- A strong call-by-need calculus (Q6135746) (← links)