Citations of:
Lambda Grammars and the SyntaxSemantics Interface
In Robert Van Rooij & Martin Stokhof (eds.), Proceedings of the Thirteenth Amsterdam Colloquium. Amsterdam: ILLC. pp. 150155 (2001)
Add citations
You must login to add citations.


Portable Grammar Format (PGF) is a core language for typetheoretical grammars. It is the target language to which grammars written in the highlevel formalism Grammatical Framework (GF) are compiled. Lowlevel and simple, PGF is easy to reason about, so that its languagetheoretic properties can be established. It is also easy to write interpreters that perform parsing and generation with PGF grammars, and compilers converting PGF to other formats. This paper gives a concise description of PGF, covering syntax, semantics, and parser (...) 

The paper develops Lambda Grammars, a form of categorial grammar that, unlike other categorial formalisms, is nondirectional. Linguistic signs are represented as sequences of lambda terms and are combined with the help of linear combinators. 

This paper solves a natural but still open question: can abstract categorial grammars (ACGs) respresent usual categorial grammars? Despite their name and their claim to be a unifying framework, up to now there was no faithful representation of usual categorial grammars in ACGs. This paper shows that NonAssociative Lambek grammars as well as their derivations can be defined using ACGs of order two. To conclude, the outcome of such a representation are discussed. 

The aim of this paper is to define a λcalculus typed in aMixed (commutative and noncommutative) Intuitionistic Linear Logic. The terms of such a calculus are the labelling of proofs of a linear intuitionistic mixed natural deduction NILL, which is based on the noncommutative linear multiplicative sequent calculus MNL [RuetAbrusci 99]. This linear λcalculus involves three linear arrows: two directional arrows and a nondirectional one (the usual linear arrow). Moreover, the terms are provided with seriesparallel orders on free variables. We (...) 

Back in the 1980’s, the class of mildly contextsensitive formalisms was introduced so as to capture the syntax of natural languages. While the languages generated by such formalisms are constrained by the constantgrowth property, the most wellknown and used ones—like treeadjoining grammars or multiple contextfree grammars—generate languages which verify the stronger property of being semilinear. In, the operation of IOsubstitution was created so as to exhibit mildlycontext sensitive classes of languages which are not semilinear. In the present article, we extend (...) 

