Theoretical Computer Science
On the &pgr;-calculus and linear logic
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Type-logical semantics
Games Semantics for Full Propositional Linear Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Normal form theorem proving for the Lambek Calculus
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
The combinatory morphemic lexicon
Computational Linguistics
Incremental processing and acceptability
Computational Linguistics
Hi-index | 0.00 |
Interaction of lexical and derivational semantics ---for example substitution and lambda conversion--- is typically a part of the on-line interpretation process. Proof-nets are to categorial grammar what phrase markers are to phrase structure grammar: unique graphical structures underlying equivalence classes of sequential syntactic derivations; but the role of proof-nets is deeper since they integrate also semantics. In this paper we show how interaction of lexical and derivational semantics at the lexico-syntactic interface can be precomputed as a process of off-line lexical compilation comprising Cut elimination in partial proof-nets.