| Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996. |
....equal, we can hope to discover this without reducing both to normal form. These problems were side stepped in the original paper on the LF logical framework [HHP93] by restricting attention to # conversion for definitional equality. This is su#cient if we also restrict attention to # long forms [FM90, Cer96]. This restriction is somewhat unsatisfactory, especially in linear variants of LF [CP98] More recently, # expansion has been studied in its own right, using modification of standard techniques from rewriting theory to overcome the lack of strong normalization when expansion is not restricted ....
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
....to richer theories such as those including unit types or subtyping. These problems were sidestepped in the original paper on the LF logical framework [HHP93] by restricting attention to fi conversion for definitional equality, which is sufficient if we also restrict attention to j long forms [FM90, Cer96]. This restriction is somewhat unsatisfactory, especially in linear variants of LF [CP98] More recently, j expansion has been studied in its own right, using modification of standard techniques from rewriting theory to overcome the lack of strong normalization when expansion is not restricted ....
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universit `a di Torino, February 1996.
....scale to richer theories such as those including unit types or subtyping. These problems were side stepped in the original paper on the LF logical framework [HHP93] by restricting attention to fi conversion for definitional equality. This is sufficient if we also restrict attention to j long forms [FM90, Cer96]. This restriction is somewhat unsatisfactory, especially in linear variants of LF [CP98] More recently, j expansion has been studied in its own right, using modification of standard techniques from rewriting theory to overcome the lack of strong normalization when expansion is not restricted ....
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universit`a di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universit`a di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universit`a di Torino, February 1996.
No context found.
I. Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universit`a di Torino, Feb. 1996. 11
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universit`a di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universit`a di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universit`a di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
....are valid, and a type A well formed in 1 , the set of objects of type A in 1 ; 2 is the same as the set of objects of type A in 1 alone. The LLF framework was motivated as the largest fragment of intuitionistic linear logic having a proof term assignment without commuting conversions [Cer96]. The equational theory that would be associated with commuting conversions was seen as intractable. Pfenning and Davies note that the commuting conversions of Moggi s monadic metalanguage [Mog89, Mog91] can be eliminated by creating a new typing judgment associated with a new class of object, the ....
....this method fails when a unit type is present as in LLF because it may be necessary to apply extensionality even when neither of the terms being compared is a manifest unit introduction. Cervesato s presentation of LLF avoids the conversion problem by restricting the syntax to long terms [Cer96]. The equality of the framework is still de ned in terms of reduction. This is possible because the reducts of long terms are long. Goguen proposes an elegant theory based on a typed notion of reduction [Gog94, Gog99] An operational semantics based on this typed reduction is then shown ....
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
....logic and computation in a natural and concise manner. It also poses a host of new questions. Operational Semantics of CLF. One of the practically important features of the linear logical framework is its operational interpretation as a logic programming language using goal directed proof search [HM94,Cer96]. We conjecture that CLF supports a conservative extension of this operational semantics. We have already constructed a representation of Mini ML with concurrency and parallelism anticipating such an interpretation [CPWW02] Properties of Computations. Concurrent computations in an object ....
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
.... closer to an efficient implementation) corresponds, via a natural extension of the Curry Howard isomorphism, to the ( fragment of intuitionistic linear logic, which constitutes the propositional core of the logic programming language Lolli [HM94] and of the linear logical framework LLF [Cer96, CP96]. is also the simply typed variant of the term language of LLF. Its theoretical relevance derives from the fact that it is the biggest linear calculus that admits unique long normal forms. shares similarities with the calculus proposed in [Bar96] and with the term language of the ....
....of applications. Linear terms provide a statically checkable notation for natural deductions [IP98] or sequent derivations [CP96] in substructural logics. In the realm of programming languages, linear terms naturally model computations in imperative languages [CP96] or sequences of moves in games [Cer96]. When we want to specify, manipulate, or reason about such objects (which is common in logic and the theory of programming languages) then internal linearity constraints are critical in practice (see, for example, the first formalizations of cut elimination in linear logic and type preservation ....
[Article contains additional citation context not shown here]
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
....are valid, and a type A well formed in # 1 , the set of objects of type A in # 1 , # 2 is the same as the set of objects of type A in # 1 alone. The LLF framework was motivated as the largest fragment of intuitionistic linear logic having a proof term assignment without commuting conversions [Cer96]. The equational theory that would be associated with commuting conversions was seen as intractable. Pfenning and Davies note that the commuting conversions of Moggi s monadic metalanguage [Mog89, Mog91] can be eliminated by creating a new typing judgment associated with a new class of object, the ....
....this method fails when a unit type is present as in LLF because it may be necessary to apply extensionality even when neither of the terms being compared is a manifest unit introduction. Cervesato s presentation of LLF avoids the # conversion problem by restricting the syntax to # long terms [Cer96]. The equality of the framework is still defined in terms of # reduction. This is possible because the # reducts of # long terms are # long. Goguen proposes an elegant theory based on a typed notion of reduction [Gog94, Gog99] An operational semantics based on this typed reduction is then shown ....
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
....logic and computation in a natural and concise manner. It also poses a host of new questions. Operational Semantics of CLF. One of the practically important features of the linear logical framework is its operational interpretation as a logic programming language using goal directed proof search [HM94,Cer96]. We conjecture that CLF supports a conservative extension of this operational semantics. We have already constructed a representation of Mini ML with concurrency and parallelism anticipating such an interpretation [CPWW02] Properties of Computations. Concurrent computations in an object ....
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
....syntax, and parametric and hypothetical judgments through dependently typed functions. In previous work, I. Cervesato and the second author have investigated a conservative extension of LF which allows the natural representation of systems with state via linear functions and additive pairs [CP98, Cer96]. In this paper we explore a further conservative extension with an intrinsic notion of order. The impetus for the development of such a framework came from the observation of certain analogies between ordering properties of CPS terms [DP95, DDP99] and substitution properties of linear calculi. ....
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universit`a di Torino, February 1996.
.... to an efficient implementation) corresponds, via a natural extension of the Curry Howard isomorphism, to the ( fragment of intuitionistic linear logic, which constitutes the propositional core of the logic programming language Lolli [HM94] and of the linear logical framework LLF [Cer96, CP96]. is also the simply typed variant of the term language of LLF. Its theoretical relevance derives from the fact that it is the biggest linear calculus that admits unique long normal forms. shares similarities with the calculus proposed in [Bar96] and with the term language of ....
....of applications. Linear terms provide a statically checkable notation for natural deductions [IP98] or sequent derivations [CP96] in substructural logics. In the realm of programming languages, linear terms naturally model computations in imperative languages [CP96] or sequences of moves in games [Cer96]. When we want to specify, manipulate, or reason about such objects (which is common in logic and the theory of programming languages) then internal linearity constraints are critical in practice (see, for example, the first formalizations of cut elimination in linear logic and type preservation ....
[Article contains additional citation context not shown here]
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universita di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universit`a di Torino, February 1996.
No context found.
Iliano Cervesato. A Linear Logical Framework. PhD thesis, Dipartimento di Informatica, Universit`a di Torino, February 1996.
First 50 documents
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