Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition

Studia Logica 87 (2-3):199-224 (2007)
  Copy   BIBTEX

Abstract

The paper presents a way to transform pregroup grammars into contextfree grammars using functional composition. The same technique can also be used for the proof-nets of multiplicative cyclic linear logic and for Lambek calculus allowing empty premises

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,636

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
28 (#804,720)

6 months
4 (#1,260,583)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Type Logics and Pregroups.Wojciech Buszkowski - 2007 - Studia Logica 87 (2-3):145-169.

Add more citations

References found in this work

The Mathematics of Sentence Structure.Joachim Lambek - 1958 - Journal of Symbolic Logic 65 (3):154-170.
Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.
Quantales and (noncommutative) linear logic.David N. Yetter - 1990 - Journal of Symbolic Logic 55 (1):41-64.
The structure of multiplicatives.Vincent Danos & Laurent Regnier - 1989 - Archive for Mathematical Logic 28 (3):181-203.

View all 6 references / Add more references