Sciweavers

4573 search results - page 193 / 915
» Automated Reasoning
Sort
View
TPHOL
1996
IEEE
15 years 10 months ago
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
Bernhard Reus
ICLP
1993
Springer
15 years 10 months ago
APPLAUSE: Applications Using the ElipSys Parallel CLP System
Liang-Liang Li, Mike Reeve, Kees Schuerman, Andr&e...
LICS
1992
IEEE
15 years 10 months ago
Origins of the Calculus of Binary Relations
The calculus of binary relations was introduced by De Morgan in 1860, and was subsequently greatly developed by Peirce and Schr
Vaughan R. Pratt
CSL
1990
Springer
15 years 10 months ago
On the Reduction Theory for Average Case Complexity
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.
Andreas Blass, Yuri Gurevich
ELP
1989
15 years 10 months ago
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
BSTRACTION, FUNCTION VARIABLES, AND SIMPLE UNIFICATION: Abstract Draft, 20 September 1989 Dale Miller Department of Computer and Information Science University of Pennsylvania Phil...
Dale Miller