Hugo Herbelin. A -calculus structure isomorphic to Genzten-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, Eighth Workshop --- CSL'94, pages 61-- 75, Kazimierz, Poland, 1995. Springer Verlag LNCS 933. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Linear Spine Calculus - Cervesato, Pfenning (2003) (1 citation) (Correct)
....as in the first order case (i.e. as a head together with a list of arguments) but permits abstraction would significantly improve the efficiency of higher order unification algorithms. This approach, known as the Bohm tree representation, has been studied extensively for different purposes [Bar80, Her95, DP98, DP99, Sch99, San00, DU01]. However, the complex equational theory that characterizes a calculus leads to difficulties in procedures such as unification and normalization. In particular, conversion rules can yield instances of a same function symbol applied to a different number of arguments. This might even lead to ....
.... spine calculus also arise as a term assignment language for uniform proofs, which form the basis for abstract logic programming languages and is based on a much richer set of connectives [MNPS91] A thorough investigation of a related calculus on the fragment has been conducted by Herbelin [Her95]. Schwichtenberg [Sch99] Dyckhoff and colleagues [DP98, DP99, DU01] and Esprito Santo [San00] study a version of the intuitionistic spine representation and ordinary calculi in a single system which incorporates commutative conversions, instead of the wholesale translation investigated here ....
[Article contains additional citation context not shown here]
Hugo Herbelin. A -calculus structure isomorphic to Genzten-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, Eighth Workshop --- CSL'94, pages 61-- 75, Kazimierz, Poland, 1995. Springer Verlag LNCS 933.
A Linear Spine Calculus - Cervesato, Pfenning (2003) (1 citation) (Correct)
....as in the first order case (i.e. as a head together with a list of arguments) but permits abstraction would significantly improve the efficiency of higher order unification algorithms. This approach, known as the Bohm tree representation, has been studied extensively for different purposes [Bar80, Her95, DP98, DP99, Sch99, San00, DU01]. However, the complex equational theory that characterizes a calculus leads to difficulties in procedures such as unification and normalization. In particular, conversion rules can yield instances of a same function symbol applied to a different number of arguments. This might even lead to ....
.... spine calculus also arise as a term assignment language for uniform proofs, which form the basis for abstract logic programming languages and is based on a much richer set of connectives [MNPS91] A thorough investigation of a related calculus on the fragment has been conducted by Herbelin [Her95]. Schwichtenberg [Sch99] Dyckhoff and colleagues [DP98, DP99, DU01] and Esprito Santo [San00] 1 study a version of the intuitionistic spine representation and ordinary calculi in a single system which incorporates commutative conversions, instead of the wholesale translation investigated ....
[Article contains additional citation context not shown here]
Hugo Herbelin. A -calculus structure isomorphic to Genzten-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, Eighth Workshop --- CSL'94, pages 61-- 75, Kazimierz, Poland, 1995. Springer Verlag LNCS 933.
Linear Higher-Order Pre-Unification - Iliano Cervesato, Frank Pfenning (1997) (2 citations) (Correct)
..... Application and ; have opposite associativity so that M 1 is the innermost subterm of M while U 1 is outermost in the spine of U . This approach was suggested by an empirical study of higher order logic programs based on terms [MP92] and is reminiscent of the notion of abstract Bohm trees [Her95a, Her95b]; its practical merits in our setting are currently assessed in an experimental implementation. The following grammar describes the syntax of S Gammaffi : we write constructors as in Gammaffi , but use new symbols to distinguish a spine operator from the corresponding term ....
....spine is a base type. This has the desirable effect of permitting only j long terms to be derivable in this calculus [CP97] allowing arbitrary types on the right hand side of the spine typing judgment corresponds to dropping this property, as we will see in Section 2.5. Abstract Bohm trees [Bar80, Her95a] are obtained in this manner. The mutual definition of the two typing judgments of S Gammaffi is given in Figure 2. The opposite associativity that characterizes the spine calculus with respect to the more traditional formulation is reflected in the manner types are managed in the lower part ....
Hugo Herbelin. A -calculus structure isomorphic to Genzten-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, Eighth Workshop --- CSL'94, pages 61--75, Kazimierz, Poland, 1995. Springer Verlag LNCS 933.
A Linear Spine Calculus - Iliano Cervesato, Frank Pfenning (1997) (1 citation) (Correct)
....as in the first order case (i.e. as a head together with a list of arguments) but permits abstraction would improve significantly the efficiency of higher order unification algorithms. This approach, known as the Bohm tree representation, has been studied extensively for different purposes [Bar80, Her95]. However, the complex equational theory that characterizes a calculus leads to difficulties in procedures such as unification and normalization. In particular, j conversion rules can yield instances of a same function symbol applied to a different number of arguments. This might even lead to ....
.... spine calculus also arise as a term assignment language for uniform proofs, which form the basis for abstract logic programming languages and is based on a much richer set of connectives [MNPS91] A thorough investigation of a related calculus on the fragment has been conducted by Herbelin [Her95]. Schwichtenberg [Sch97] studies a version of the intuitionistic spine representation and ordinary calculi in a single system which incorporates permutative conversions, instead of the wholesale translation investigated here (which is closer to an efficient implementation) Gammaffi ....
[Article contains additional citation context not shown here]
Hugo Herbelin. A -calculus structure isomorphic to Genzten-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, Eighth Workshop --- CSL'94, pages 61--75, Kazimierz, Poland, 1995. Springer Verlag LNCS 933.
A Linear Spine Calculus - Cervesato, Pfenning (2001) (1 citation) (Correct)
No context found.
Hugo Herbelin. A -calculus structure isomorphic to Genzten-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, Eighth Workshop --- CSL'94, pages 61-- 75, Kazimierz, Poland, 1995. Springer Verlag LNCS 933.
A Linear Spine Calculus - Iliano Cervesato Advanced (Correct)
No context found.
Hugo Herbelin. A -calculus structure isomorphic to Genzten-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, Eighth Workshop --- CSL'94, pages 61-- 75, Kazimierz, Poland, 1995. Springer Verlag LNCS 933.
A Linear Spine Calculus - Iliano Cervesato Advanced (2003) (1 citation) (Correct)
No context found.
Hugo Herbelin. A #-calculus structure isomorphic to Genzten-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, Eighth Workshop --- CSL'94, pages 61-- 75, Kazimierz, Poland, 1995. Springer Verlag LNCS 933.
Linear Higher-Order Pre-Unification - Iliano Cervesato And (1997) (2 citations) (Correct)
No context found.
Hugo Herbelin. A -calculus structure isomorphic to Genzten-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, Eighth Workshop --- CSL'94, pages 61--75, Kazimierz, Poland, 1995. Springer Verlag LNCS 933.
A Linear Spine Calculus - Iliano Cervesato And (2003) (1 citation) (Correct)
No context found.
Hugo Herbelin. A -calculus structure isomorphic to Genzten-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, Eighth Workshop --- CSL'94, pages 61--75, Kazimierz, Poland, 1995. Springer Verlag LNCS 933.
A Linear Spine Calculus - Cervesato, Pfenning (2003) (1 citation) (Correct)
No context found.
Hugo Herbelin. A #-calculus structure isomorphic to Genzten-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, Eighth Workshop --- CSL'94, pages 61-- 75, Kazimierz, Poland, 1995. Springer Verlag LNCS 933.
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