An Approach to Theorem Proving on the Basis of a Typed Lambda-Calculus
نویسنده
چکیده
The Nether lands.
منابع مشابه
Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading
The introduction of sorts in rst-order automatic theorem proving has been accompanied by a considerable gain in computational eeciency via reduced search spaces. This suggests that sort information can be employed in higher-order theorem proving with similar results. This paper develops an order-sorted higher-order calculus suitable for automatic theorem proving applications | by extending the ...
متن کاملA Logic Programming Approach to Implementing Higher-Order Term Rewriting
Term rewriting has proven to be an important technique in theorem proving. In this paper, we illustrate that rewrite systems and strategies for higher-order term rewriting, which includes the usual notion of rst-order rewriting, can be naturally speciied and implemented in a higher-order logic programming language. We adopt a notion of higher-order rewrite system which uses the simply typed-cal...
متن کاملInhabitation in Simply-Typed Lambda-Calculus through a Lambda-Calculus for Proof Search
A new, comprehensive approach to inhabitation problems in simply-typed lambda-calculus is shown, dealing with both decision and counting problems. This approach works by exploiting a representation of the search space generated by a given inhabitation problem, which is in terms of a lambda-calculus for proof search that the authors developed recently. The representation may be seen as extending...
متن کاملProving Properties of Typed Lambda-Terms Using Realizability, Covers, and Sheaves (Preliminary Version)
We present a general method for proving properties of typed λ-terms. This method is obtained by introducing a semantic notion of realizability which uses the notion of a cover algebra (as in abstract sheaf theory). For this, we introduce a new class of semantic structures equipped with preorders, called pre-applicative structures. These structures need not be extensional. In this framework, a g...
متن کاملA Colored Version of the λ-Calculus
Rippling is a technique developed for inductive theorem proving which uses syntactic differences of terms to guide the proof search. Annotations (like colors) to terms are used to maintain this information. This technique has several advantages, e.g. it is highly goal oriented and involves little search. In this paper we give a general formalisation of coloring terms in a higher-order setting. ...
متن کامل