Type checking with open type functions
We report on an extension of Haskell with open type-level functions and equality constraints
that unifies earlier work on GADTs, functional dependencies, and associated types. The …
that unifies earlier work on GADTs, functional dependencies, and associated types. The …
OutsideIn (X) Modular type inference with local assumptions
Advanced type system features, such as GADTs, type classes and type families, have
proven to be invaluable language extensions for ensuring data invariants and program …
proven to be invaluable language extensions for ensuring data invariants and program …
Incremental closure of free variable tableaux
M Giese - International Joint Conference on Automated …, 2001 - Springer
This paper presents a technique for automated theorem proving with free variable tableaux
that does not require backtracking. Most existing automated proof procedures using free …
that does not require backtracking. Most existing automated proof procedures using free …
FDPLL—a first-order Davis-Putnam-Logeman-Loveland procedure
P Baumgartner - Automated Deduction-CADE-17: 17th International …, 2000 - Springer
FDPLL is a directly lifted version of the well-known Davis-Putnam-Logeman-Loveland
(DPLL) procedure. While DPLL is based on a splitting rule for case analysis wrt. ground and …
(DPLL) procedure. While DPLL is based on a splitting rule for case analysis wrt. ground and …
The undecidability of simultaneous rigid E-unification
A Degtyarev, A Voronkov - Theoretical Computer Science, 1996 - Elsevier
Simultaneous rigid E-unification was introduced in 1987 by Gallier, Raatz and Snyder. It is
used in the area of automated reasoning with equality in extension procedures, like the …
used in the area of automated reasoning with equality in extension procedures, like the …
What you always wanted to know about rigid E-unification
A Degtyarev, A Voronkov - Journal of Automated Reasoning, 1998 - Springer
This paper solves an open problem posed by a number of researchers: the construction of a
complete calculus for matrix-based methods with rigid E-unification. The use of rigid E …
complete calculus for matrix-based methods with rigid E-unification. The use of rigid E …
The tableau-based theorem prover 3 T A P Version 4.0
Overview 3774/9 is a tableau-based theorem prover for many-valued first-order logics with
sorts (in the two-valued version with equality); it is implemented in Prolog. This paper gives …
sorts (in the two-valued version with equality); it is implemented in Prolog. This paper gives …
Simultaneous rigid E-unification is undecidable
A Degtyarev, A Voronkov - International Workshop on Computer Science …, 1995 - Springer
Simultaneous rigid E-unification was introduced in 1987 by Gallier, Raatz and Snyder. It is
used in the area of automated reasoning with equality in extension procedures, like the …
used in the area of automated reasoning with equality in extension procedures, like the …
Integrating automated and interactive theorem proving
Automated and interactive theorem proving are the two main directions in the field of
deduction. Most chapters of this book belong to either the one or the other, whether focusing …
deduction. Most chapters of this book belong to either the one or the other, whether focusing …
Equality elimination for the tableau method
A Degtyarev, A Voronkov - … Symposium on Design and Implementation of …, 1996 - Springer
We apply the equality elimination method to semantic tableaux with equality. The resulting
logical system is a combination of a goal-directed tableau calculus with a basic …
logical system is a combination of a goal-directed tableau calculus with a basic …