24 search results - page 2 / 5 » An Abstract Decision Procedure for a Theory of Inductive Dat... |
CTRS
1990
13 years 11 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
FROCOS
2005
Springer
14 years 29 days ago
2005
Springer
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
ASIAN
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...