A categorial type logic

In logical categorial grammar [23,11] syntactic structures are categorial proofs and semantic structures are intuitionistic proofs, and the syntax-semantics interface comprises a homomorphism from syntactic proofs to semantic proofs. Thereby, logical categorial grammar embodies in a pure logical for...

ver descrição completa

Detalhes bibliográficos
Autor: Morrill, Glyn|||0000-0002-5528-4384
Formato: artículo
Fecha de publicación:2014
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/28269
Acesso em linha:https://hdl.handle.net/2117/28269
https://dx.doi.org/10.1007/978-3-642-54789-8_18
Access Level:acceso abierto
Palavra-chave:Computational linguistics
Programming languages (Electronic computers) -- Semantics
Lingüística computacional
Llenguatges de programació -- Semàntica
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
Descrição
Resumo:In logical categorial grammar [23,11] syntactic structures are categorial proofs and semantic structures are intuitionistic proofs, and the syntax-semantics interface comprises a homomorphism from syntactic proofs to semantic proofs. Thereby, logical categorial grammar embodies in a pure logical form the principles of compositionality, lex-icalism, and parsing as deduction. Interest has focused on multimodal versions but the advent of the (dis)placement calculus of Morrill, Valentín and Fadda [21] suggests that the role of structural rules can be reduced, and this facilitates computational implementation. In this paper we specify a comprehensive formalism of (dis) placement logic for the parser/theorem prover CatLog integrating categorial logic connectives proposed to date and illustrate with a cover grammar of the Montague fragment.