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
- Functional programming with -tree syntax
- Proof theory for model checking
- From syntactic proofs to combinatorial proofs
- Proof nets for first-order additive linear logic
- On the Decision Problem for MELL
- OCaml metatheory
- Merlin: understanding a language server
- Language interoperability: ML and a Linear language
- First-class simultaneous substitutions in the two-level logic approach
- Hybrid Linear Logic, revisited
- Proof Nets and the Linear Substitution Calculus
- Tight Typings and Split Bounds
- Types of Fireballs
- Decision procedures for intuitionistic propositional logic
- Admissible Tools in the Kitchen of Intuitionistic Logic
Partnerships and Cooperations
Bibliography
Overall Objectives
Research Program
Application Domains
New Results
- Functional programming with -tree syntax
- Proof theory for model checking
- From syntactic proofs to combinatorial proofs
- Proof nets for first-order additive linear logic
- On the Decision Problem for MELL
- OCaml metatheory
- Merlin: understanding a language server
- Language interoperability: ML and a Linear language
- First-class simultaneous substitutions in the two-level logic approach
- Hybrid Linear Logic, revisited
- Proof Nets and the Linear Substitution Calculus
- Tight Typings and Split Bounds
- Types of Fireballs
- Decision procedures for intuitionistic propositional logic
- Admissible Tools in the Kitchen of Intuitionistic Logic
Partnerships and Cooperations
Bibliography