Results 1 
3 of
3
The Categorial FineStructure of Natural Language
, 2003
"... Categorial grammar analyzes linguistic syntax and semantics in terms of type theory and lambda calculus. A major attraction of this approach is its unifying power, as its basic function/argument structures occur across the foundations of mathematics, language and computation. This paper considers, i ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Categorial grammar analyzes linguistic syntax and semantics in terms of type theory and lambda calculus. A major attraction of this approach is its unifying power, as its basic function/argument structures occur across the foundations of mathematics, language and computation. This paper considers, in a light examplebased manner, where this elegant logical paradigm stands when confronted with the wear and tear of reality. Starting from a brief history of the Lambek tradition since the 1980s, we discuss three main issues: (a) the fit of the lambda calculus engine to characteristic semantic structures in natural language, (b) the coexistence of the original typetheoretic and more recent modal interpretations of categorial logics, and (c) the place of categorial grammars in the complex total architecture of natural language, which involves  amongst others  mixtures of interpretation and inference.
Posetvalued sets or How to build models for Linear Logics
 THEORETICAL COMPUTER SCIENCE
, 2001
"... We describe a method for constructing models of linear logic based on the category of sets and relations. The resulting categories are generally not degenerate, in particular the are not compact closed nor do they have biproducts. The construction is simple, relying on the structure of a poset to av ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We describe a method for constructing models of linear logic based on the category of sets and relations. The resulting categories are generally not degenerate, in particular the are not compact closed nor do they have biproducts. The construction is simple, relying on the structure of a poset to avoid degeneracy. A number of wellknown models, for example coherence spaces and hypercoherences, are instances of this method.
Dialectica and Chu Constructions: Cousins?
 In this Volume
, 2006
"... This note investigates two generic constructions used to produce categorical models of linear logic, the Chu construction and the Dialectica construction, in parallel. The constructions have the same objects, but are rather di#erent in other ways. We discuss similarities and di#erences and prove ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This note investigates two generic constructions used to produce categorical models of linear logic, the Chu construction and the Dialectica construction, in parallel. The constructions have the same objects, but are rather di#erent in other ways. We discuss similarities and di#erences and prove that the dialectica construction can be done over a symmetric monoidal closed basis. We also point out several interesting open problems concerning the Dialectica construction.