G'erard Huet. A unification algorithm for typed -calculus. Theoretical Computer Science, 1:27--57, 1975. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
The Reflection Theorem: A Study in Meta-Theoretic Reasoning - Paulson (Correct)
....of the reflection theorem with the [intro] attribute flags them as introduction rules, suitable for backward chaining. The many # bound variables in these rules pose no problems for fast : it searches for proofs using Isabelle s inbuilt inference mechanisms, which employ higher order unification [6]. Here the reflection theorem is applied to #(x) # #y #z (z y) I have explicitly written the relavitized formulas, namely # , though this can be automated using ML if necessary. We have no idea what the reflecting class will be, but we can write it as the variable Cl and let ....
G. P. Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--57, 1975.
A Decision Algorithm for Stratified Context Unification - Schmidt-Schauß (2001) (Correct)
....as well as of satisfiability of one step rewrite constraints. 1 Introduction Context unification is a variant of second order unification and also a generalization of string unification. There are unification procedures for the more general problem of higher order unification (see e.g. [Pie73,Hue75,SG89,Pre95]) It is well known that higher order unification and second order unification are undecidable [Gol81,Far91,LV00] String unification was shown to be decidable by Makanin [Mak77] Recent upper complexity estimations are that it is in EXPSPACE [Gut98] in NEXPTIME [Pla99a] and even in PSPACE ....
Gerard Huet. A unification algorithm for typed -calculus. Theoretical Computer Science, 1:27--57, 1975.
A Formulation of the Simple Theory of Types (for Isabelle) - Paulson (1989) (Correct)
....in lcf is a function from the premises to the conclusion, while in Isabelle it is an axiom in the meta logic stating that the premises imply the conclusion. Since Isabelle axioms are essentially Horn clauses, the proof techniques draw ideas from prolog. Huet s higher order unification procedure [18] takes account of #, #, and # conversions during unification. Higher order unification can return multiple or infinitely many results. While the general problem is undecidable, the procedure works well in Isabelle. 3 A brief history of type theory Bertrand Russell invented the theory of types to ....
G. P. Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--57, 1975.
A Coverage Checking Algorithm for LF - Schürmann, Pfenning (2003) (5 citations) (Correct)
....coverage algorithm) and also so that the operational semantics is well defined (for the execution of a functional or logic program) we require the patterns to be strict. Strictness for a pattern # i A i : type requires that each variable in # i must occur in A at least once in a rigid position [10, 15]. Definition 3 (Strictness) We say that u has a strict occurrence in U if u U as defined by the rules depicted in Figure 4. A pattern # i A i : type is strict if # i ; u A i for each variable u in # i . Informally, an occurrence of u is strict if it is not below another variable in # ....
....a complete set. # The splitting operation discussed in the remainder of this section generates a non redundant complete set of substitutions. Its definition is inspired by a similar operation in ALF [2] which in turn has its root in the basic steps of Huet s algorithm for higher order unification [10]. First, among all coverage goals that are not immediately covered, splitting selects coverage goal # A : type and a declaration u:A j from its context # that is below referred to as splitting variable. A j may be a function type, therefore, without loss of generality, it is of the following ....
G. Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--57, 1975.
Linear Higher-Order Pre-Unification - Iliano Cervesato And (Correct)
No context found.
G'erard Huet. A unification algorithm for typed -calculus. Theoretical Computer Science, 1:27--57, 1975.
Linear Higher-Order Pre-Unification - Cervesato, Pfenning (1997) (2 citations) (Correct)
No context found.
G. Huet. A unification algorithm for typed -calculus. Theoretical Computer Science, 1:27--57, 1975.
Dynamic Lambda Calculus - Michael Kohlhase Susanna (Correct)
No context found.
G'erard P. Huet. An unification algorithm for typed -calculus. Theoretical Computer Science, 1:27--57, 1975.
Unification and Anti-Unification in the Calculus of.. - Frank Pfenning School (1991) (31 citations) (Correct)
No context found.
G'erard Huet. A unification algorithm for typed -calculus. Theoretical Computer Science, 1:27-- 57, 1975.
Linear Higher-Order Pre-Unification - Iliano Cervesato And (1997) (2 citations) (Correct)
No context found.
G'erard Huet. A unification algorithm for typed -calculus. Theoretical Computer Science, 1:27--57, 1975.
A Modal Foundation for Meta-Variables - Aleksandar Nanevski Brigitte (2003) (1 citation) (Correct)
No context found.
Gerard Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--57, 1975.
The Complexity of Equivariant Unification - Cheney (Correct)
No context found.
Gerard Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--67, 1975.
Relating Nominal and Higher-Order Pattern Unification - Cheney (Correct)
No context found.
Gerard Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--67, 1975.
Nominal Logic Programming - Cheney (2004) (Correct)
No context found.
Gerard Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--67, 1975.
A Proof Search Specification of the π-Calculus - Tiu, Miller (2004) (Correct)
No context found.
G. Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--57, 1975.
Tool Support for Logics of Programs - Paulson (2002) (Correct)
No context found.
G. P. Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--57, 1975.
Higher-Order Horn Clauses - Gopalan Nadathur Duke (1990) (35 citations) (Correct)
No context found.
Huet, G. P. A unification algorithm for typed #-calculus. Theoretical Computer Science 1 (1975) 27 -- 57.
A Modal Foundation for Meta-Variables - Nanevski, Pientka, Pfenning (2003) (1 citation) (Correct)
No context found.
Gerard Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--57, 1975.
The Complexity of Equivariant Unification - Cheney (Correct)
No context found.
Gerard Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--67, 1975.
Reasoning About Logic Programs Using Definitions And Induction - Wajs (2002) (2 citations) (Correct)
No context found.
G'erard Huet. A unification algorithm for typed -calculus. Theoretical Computer Science, 1:27--57, 1975.
Encoding Generic Judgments - Dale Miller Computer (2001) (3 citations) (Correct)
No context found.
G'erard Huet. A unification algorithm for typed -calculus. Theoretical Computer Science, 1:27--57, 1975.
Unknown - (Correct)
No context found.
G'erard Huet. A unification algorithm for typed -calculus. Theoretical Computer Science, 1:27--57, 1975.
A Proof Search Specification of the π-Calculus - Tiu, Miller (Correct)
No context found.
G. Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--57, 1975.
Cooperative Constraint Functional Logic Programming - Mircea Marin Tetsuo (2000) (Correct)
No context found.
G. Huet. A Unification Algorithm for Typed -Calculus. Theoretical Computer Science, 1:27--57, 1975.
A Proof Search Specification of the π-Calculus - Tiu, Miller (2004) (Correct)
No context found.
G. Huet. A unification algorithm for typed #-calculus. Theoretical Computer Science, 1:27--57, 1975.
Decidability of Bounded Second Order Unification - Schmidt-Schauß (Correct)
No context found.
Gerard Huet. A unification algorithm for typed -calculus. Theoretical Computer Science, 1:27--57, 1975.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC