The Clausal Theory of Types

  title={The Clausal Theory of Types},
  author={D. A. Wolfram},
Logic programming was based on first-order logic. Higher-order logics can also lead to theories of theorem-proving. This book introduces just such a theory, based on a lambda-calculus formulation of a clausal logic with equality, known as the Clausal Theory of Types. By restricting this logic to Horn clauses, a concise form of logic programming that incorporates functional programming is achieved. The book begins by reviewing the fundamental Skolem-Herbrand-Godel Theorem and resolution, which… 
A mechanization of sorted higher-order logic based on the resolution principle
This thesis develops a sorted higher-order logic SUM HOL suitable for automatic theorem proving applications, and develops two notions of set-theoretic semantics for SUM HOL, which generalize general SUM-models further to SUM-model structures, which allow full extensionality to fail.
Equality and extensionality in automated higher order theorem proving
The three new calculi ER, ERUE, EP and ERUE which improve the mechanisation of defined and primitvie equality in classical type theory and these calculi reach Henkin completeness without requiring additional extensionality axioms are introduced.
Functional Logic Programming with Distributed Constraint Solving
This thesis proposes various lazy narrowing calculi that can serve as operational semantics of a higher-order functional logic programming language and their distributed implementation on a network of computers and proves that they satisfy essential properties, such as being sound and complete, if the functional logic programs satisfies certain restrictions.
Equivalence of Reductions in Higher-Order Rewriting
The main result of this dissertation is that for local, orthogonal HRSs the three notions of equivalence coincide, and the proof that H RSs enjoy finite family developments, meaning that in infinite reductions, there is no bound on the number of steps which were involved in creating a given symbol.
Termination Proofs for Higher-order Rewrite Systems
This paper deals with termination proofs for Higher-Order Rewrite Systems (HRSs), introduced in [12], which combines the computational aspects of term rewriting and simply typed lambda calculus and produces a proof technique similar to the proof technique for the termination of a well-founded monotone algebra.
An Adaptation of Paramodulation and Rue-resolution to Higher-order Logic
This techreport presents two approaches to primitive equality treatment in higher-order (HO) automated theorem proving: a calculus EP adapting traditional rst-order (FO) paramodulation RW69] , and a
Rewriting Calculus with(out) Types
Extensional Higher-Order Paramodulation and RUE-Resolution
Two approaches to primitive equality treatment in higher-order (HO) automated theorem proving are presented: a calculus EP adapting traditional first-orders paramodulation, and a calculus ERUE adapting FO RUE-Resolution to classical type theory, i.e., HO logic based on Church's simply typed λ-calculus.
Higher-Order Computational Logic
  • J. Lloyd
  • Computer Science
    Computational Logic: Logic Programming and Beyond
  • 2002
A suitable polymorphically-typed, higher-order logic is introduced and its syntax and proof theory briefly described, and a metric space of closed terms suitable for knowledge representation purposes is presented.
Expressing combinatory reduction systems derivations in the rewriting calculus
This paper shows that the Combinatory Reduction Systems derivations can be expressed in terms of rewriting calculus derivations, and presents an original matching algorithm for CRS terms that uses a simple term translation and the classical matching of lambda terms.


Rewriting, and Equational Unification: the Higher-Order Cases
A general definition of term rewriting in the simply typed λ-calculus is given, and this provides a basis for generalizing the first- and restricted higher-order results for these concepts, and equational unification and their properties.
Semigroups, antiautomorphisms, and involutions: a computer solution to an open problem. I
An antiautomorphism H of a semigroup S is a 1-1 mapping of S onto itself such that H(xy) = H(y)H(x) for all x,y in S. An antiautomorphism H is an involution if H/sup 2/(x) = x for all x in S. In this
Forward Checking and Intelligent Backtracking