Sciweavers

54 search results - page 1 / 11
» Topological Completeness for Higher-Order Logic
Sort
View
JSYML
2000
45views more  JSYML 2000»
13 years 8 months ago
Topological Completeness for Higher-Order Logic
Steven Awodey, Carsten Butz
FLOPS
1999
Springer
14 years 25 days ago
Typed Higher-Order Narrowing without Higher-Order Strategies
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...
Sergio Antoy, Andrew P. Tolmach
PLILP
1995
Springer
14 years 2 days ago
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
Koichi Nakahara, Aart Middeldorp, Tetsuo Ida
CADE
1998
Springer
14 years 18 days ago
Extensional Higher-Order Resolution
Abstract. In this paper we present an extensional higher-order resolution calculus that is complete relative to Henkin model semantics. The treatment of the extensionality principl...
Christoph Benzmüller, Michael Kohlhase
TPHOL
1995
IEEE
14 years 2 days ago
HOLCF: Higher Order Logic of Computable Functions
This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which o e...
Franz Regensburger