4573 search results - page 412 / 915 » Automated Reasoning |
206
Voted
FLOPS
1999
Springer
15 years 11 months ago
1999
Springer
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
193
click to vote
FLOPS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
208
click to vote
FLOPS
1999
Springer
15 years 11 months ago
1999
Springer
We present a simple generic framework to solve constraints on any domain (finite or infinite) which has a lattice structure. The approach is based on the use of a single constrai...
164
Voted
TPHOL
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...
171
Voted
TPHOL
1999
IEEE
15 years 11 months ago
1999
IEEE
Abstract. Isabelle/HOL has recently acquired new versions of definitional packages for inductive datatypes and primitive recursive functions. In contrast to its predecessors and mo...