Cited in
(29)- Extracting proofs from tabled proof search
- Reasoning in Abella about structural operational semantics specifications
- Static analysis, abstract interpretation and verification in (constraint logic) programming
- A characterisation of open bisimilarity using an intuitionistic modal logic
- Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus
- Mechanized metatheory revisited
- Proof checking and logic programming
- Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax
- Nominal abstraction
- Formalizing operational semantic specifications in logic
- A case study in programming coinductive proofs: Howe's method
- HYBRID
- Abella
- Tac
- PoplMark
- Akiss
- SPEC
- Teyjus
- mini-ML
- Lolli
- Cut elimination for a logic with induction and co-induction
- A proof theory for model checking: an extended abstract
- αCheck: A mechanized metatheory model checker
- A two-level logic approach to reasoning about computations
- The undecidability of proof search when equality is a logical connective
- A proof theory for model checking
- Case analysis of higher-order data
- On the expressivity of minimal generic quantification
- SPEC: an equivalence checker for security protocols
This page was built for software: Bedwyr
