Previous | 
Home
Section: New Software and Platforms
Abella
Functional Description
Abella is an interactive theorem prover for reasoning about computations given as relational specifications. Abella is particuarly well suited for reasoning about binding constructs.
Overall Objectives
Research Program
Application Domains
New Results
- Linear rewriting systems for Boolean logic
- Non-crossing Tree Realizations of Ordered Degree Sequences
- Focusing for Nested Sequents
- Combining inference systems: a generalization of Nelson-Oppen and MCSAT
- Linear lambda terms as invariants of rooted trivalent maps
- A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
- Towards a link between CPS and focusing
- Proof Checking and Logic Programming
- Proof Certificates for First-Order Equational Logic
- Extended Pattern Unification
- Focused proofs for modal logics
- Preserving differential privacy under finite-precision semantics
- Certification of Prefixed Tableau Proofs for Modal Logic
- Towards a Substitution Tree Based Index for Higher-order Resolution Theorem Provers
- Open Call-by-Value
- A Reasonable Abstract Machine for the Strong -Calculus
- Space-efficient Acyclicity Constraints
- Exp-log normal form of types and the axioms for -equality of the -calculus with sums
- Invertible-rule-free sequent calculi and an intuitionistic arithmetical hierarchy
Partnerships and Cooperations
Bibliography
Overall Objectives
Research Program
Application Domains
New Results
- Linear rewriting systems for Boolean logic
- Non-crossing Tree Realizations of Ordered Degree Sequences
- Focusing for Nested Sequents
- Combining inference systems: a generalization of Nelson-Oppen and MCSAT
- Linear lambda terms as invariants of rooted trivalent maps
- A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
- Towards a link between CPS and focusing
- Proof Checking and Logic Programming
- Proof Certificates for First-Order Equational Logic
- Extended Pattern Unification
- Focused proofs for modal logics
- Preserving differential privacy under finite-precision semantics
- Certification of Prefixed Tableau Proofs for Modal Logic
- Towards a Substitution Tree Based Index for Higher-order Resolution Theorem Provers
- Open Call-by-Value
- A Reasonable Abstract Machine for the Strong -Calculus
- Space-efficient Acyclicity Constraints
- Exp-log normal form of types and the axioms for -equality of the -calculus with sums
- Invertible-rule-free sequent calculi and an intuitionistic arithmetical hierarchy
Partnerships and Cooperations
Bibliography