Results 11  20
of
62
Lambda calculus and intuitionistic linear logic
 Invited talk at the Logic Colloquium’94 (ClermontFerrand
, 1994
"... The CurryHoward isomorphism 1 is the basis of typed functional programming. By means of this isomorphism, the intuitionistic proof of a formula can be seen as a functional program, whose type is the formula itself. In this way, the computation process has its logic realization in the proof normaliz ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
(Show Context)
The CurryHoward isomorphism 1 is the basis of typed functional programming. By means of this isomorphism, the intuitionistic proof of a formula can be seen as a functional program, whose type is the formula itself. In this way, the computation process has its logic realization in the proof normalization procedure. Both the implicative fragment of the intuitionistic
Discontinuity and the Lambek Calculus
, 1994
"... This paper is concerned with the treatment of discontinuous constituency within Categorial Grammar ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
This paper is concerned with the treatment of discontinuous constituency within Categorial Grammar
The Girard Translation Extended with Recursion
 In Proceedings of Computer Science Logic
, 1995
"... This paper extends CurryHoward interpretations of Intuitionistic Logic (IL) and Intuitionistic Linear Logic (ILL) with rules for recursion. The resulting term languages, the rec calculus and the linear rec calculus respectively, are given sound categorical interpretations. The embedding of ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
This paper extends CurryHoward interpretations of Intuitionistic Logic (IL) and Intuitionistic Linear Logic (ILL) with rules for recursion. The resulting term languages, the rec calculus and the linear rec calculus respectively, are given sound categorical interpretations. The embedding of proofs of IL into proofs of ILL given by the Girard Translation is extended with the rules for recursion, such that an embedding of terms of the rec calculus into terms of the linear rec calculus is induced via the extended CurryHoward isomorphisms. This embedding is shown to be sound with respect to the categorical interpretations. Full version of paper to appear in Proceedings of CSL '94, LNCS 933, 1995. y Basic Research in Computer Science, Centre of the Danish National Research Foundation. Contents 1 Introduction 4 2 The Categorical Picture 6 2.1 Previous Work and Related Results : : : : : : : : : : : : : : : : : : : : : : 6 2.2 How to deal with parameters : : : : : : : ...
Fock Space: A Model of Linear Exponential Types
, 1994
"... It has been observed by several people that, in certain contexts, the free symmetric algebra construction can provide a model of the linear modality ! . This construction arose independently in quantum physics, where it is considered as a canonical model of quantum field theory. In this context, the ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
It has been observed by several people that, in certain contexts, the free symmetric algebra construction can provide a model of the linear modality ! . This construction arose independently in quantum physics, where it is considered as a canonical model of quantum field theory. In this context, the construction is known as (bosonic) Fock space. Fock space is used to analyze such quantum phenomena as the annihilation and creation of particles. There is a strong intuitive connection to the principle of renewable resource, which is the philosophical interpretation of the linear modalities. In this paper, we examine Fock space in several categories of vector spaces. We first consider vector spaces, where the Fock construction induces a model of the\Omega ; &; ! fragment in the category of symmetric algebras. When considering Banach spaces, the Fock construction provides a model of a weakening cotriple in the sense of Jacobs. While the models so obtained model a smaller fragment, it is cl...
A New Framework for Declarative Programming
, 2001
"... We propose a new indexedcategory syntax and semantics of Weak Hereditarily Harrop logic programming with constraints, based on resolution over taucategories:finite product categories with canonical structure. ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We propose a new indexedcategory syntax and semantics of Weak Hereditarily Harrop logic programming with constraints, based on resolution over taucategories:finite product categories with canonical structure.
Explicit Substitution Internal Languages for Autonomous and *Autonomous Categories
 In Proc. Category Theory and Computer Science (CTCS'99), Electron
, 1999
"... We introduce a family of explicit substitution type theories as internal languages for autonomous (or symmetric monoidal closed) and autonomous categories, in the same sense that the simplytyped calculus with surjective pairing is the internal language for cartesian closed categories. We show tha ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
(Show Context)
We introduce a family of explicit substitution type theories as internal languages for autonomous (or symmetric monoidal closed) and autonomous categories, in the same sense that the simplytyped calculus with surjective pairing is the internal language for cartesian closed categories. We show that the eight equality and three commutation congruence axioms of the autonomous type theory characterise autonomous categories exactly. The associated rewrite systems are all strongly normalising; modulo a simple notion of congruence, they are also confluent. As a corollary, we solve a Coherence Problem a la Lambek [12]: the equality of maps in any autonomous category freely generated from a discrete graph is decidable. 1 Introduction In this paper we introduce a family of type theories which can be regarded as internal languages for autonomous (or symmetric monoidal closed) and autonomous categories, in the same sense that the standard simplytyped calculus with surjective pairing is...
Memoisation for Glue Language Deduction and Categorial Parsing
, 1998
"... The multiplicative fragment of linear logic has found a number of applications in computational linguistics: in the "glue language" approach to LFG semantics, and in the formulation and parsing of various categorial grammars. These applications call for efficient deduction methods. Althoug ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
The multiplicative fragment of linear logic has found a number of applications in computational linguistics: in the "glue language" approach to LFG semantics, and in the formulation and parsing of various categorial grammars. These applications call for efficient deduction methods. Although a number of deduction methods for multiplicative linear logic are known, none of them are tabular meth ods, which bring a substantial efficiency gain by avoiding redundant computation (c.f. chart methods in CFG parsing): this paper presents such a method, and discusses its use in relation to the above applications.
Categories for Computation in Context and Unified Logic: The "Intuitionist" Case
, 1997
"... In this paper we introduce the notion of contextual categories. These provide a categorical semantics for the modelling of computation in context, based on the idea of separating logical sequents into two zones, one representing the context over which the computation is occurring, the other the comp ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
In this paper we introduce the notion of contextual categories. These provide a categorical semantics for the modelling of computation in context, based on the idea of separating logical sequents into two zones, one representing the context over which the computation is occurring, the other the computation itself. The separation into zones is achieved via a bifunctor equipped with a tensorial strength. We show that a category with such a functor can be viewed as having an action on itself. With this interpretation, we obtain a fibration in which the base category consists of contexts, and the reindexing functors are used to change the context. We further observe that this structure also provides a framework for developing categorical semantics for Girard's Unified Logic, a key feature of which is to separate logical sequents into two zones, one in which formulas behave classically and one in which they behave linearly. This separation is analogous to the context/computation separation ...
! and ?  Storage as tensorial strength
, 1996
"... this paper were produced with the help of the diagram macros of F. Borceux. Blute, Cockett, & Seely 2 ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
this paper were produced with the help of the diagram macros of F. Borceux. Blute, Cockett, & Seely 2