Theoretical Computer Science
Type-theoretical grammar
Handbook of formal languages, vol. 3
Type-logical semantics
Generation as Deduction on Labelled Proof Nets
LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Linear Higher-Order Matching Is NP-Complete
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Tree Adjoining Grammars in a fragment of the Lambek calculus
Computational Linguistics
Generation, Lambek calculus, Montague's semantics and semantic proof nets
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms
Journal of Logic, Language and Information
Abstract Families of Abstract Categorial Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Recognizability in the Simply Typed Lambda-Calculus
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
On the Syntax-Semantics Interface: From Convergent Grammar to Abstract Categorial Grammar
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Converting Grammatical Framework to Regulus
SLP '07 Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing
Dependency constraints for lexical disambiguation
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars
Journal of Logic, Language and Information
New Directions in Type-Theoretic Grammars
Journal of Logic, Language and Information
On the Membership Problem for Non-Linear Abstract Categorial Grammars
Journal of Logic, Language and Information
PGF: A Portable Run-time Format for Type-theoretical Grammars
Journal of Logic, Language and Information
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
Journal of Logic, Language and Information
On two extensions of abstract categorial grammars
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Generating quantifiers and negation to explain homework testing
IUNLPBEA '10 Proceedings of the NAACL HLT 2010 Fifth Workshop on Innovative Use of NLP for Building Educational Applications
A note on the complexity of abstract categorial grammars
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Covert movement in logical grammar
Logic and grammar
Minimalist grammars in the light of logic
Logic and grammar
Game semantics and uniqueness of type inhabitance in the simply-typed λ-calculus
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Encoding phases using commutativity and non-commutativity in a logical framework
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Are (linguists') propositions (topos) propositions?
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Event in compositional dynamic semantics
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Distributional learning of abstract categorial grammars
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
A datalog recognizer for almost affine λ-CFGs
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Event semantics and abstract categorial grammar
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Higher-order matching in the linear lambda calculus in the absence of constants is NP-complete
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
The complexity and generative capacity of lexicalized abstract categorial grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Syntactic descriptions: a type system for solving matching equations in the linear λ-calculus
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
SDRT and continuation semantics
JSAI-isAI'10 Proceedings of the 2010 international conference on New Frontiers in Artificial Intelligence
Fundamenta Informaticae - Logic, Language, Information and Computation
Implicit arguments: event modification or option type categories?
AC'11 Proceedings of the 18th Amsterdam colloquim conference on Logic, Language and Meaning
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Gapping as like-category coordination
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Hyperintensional dynamic semantics: analyzing definiteness with enriched contexts
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Distinguishing phenogrammar from tectogrammar simplifies the analysis of interrogatives
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Controlling extraction in abstract categorial grammars
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
A Higher-Order Theory of Presupposition
Studia Logica
Second position clitics and monadic second-order transduction
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
The IO and OI hierarchies revisited
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Displacement logic for anaphora
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We introduce a new categorial formalism based on intuitionistic linear logic. This formalism, which derives from current type-logical grammars, is abstract in the sense that both syntax and semantics are handled by the same set of primitives. As a consequence, the formalism is reversible and provides different computational paradigms that may be freely composed together.