Natural language inference in Coq

DOI10.1007/s10849-014-9208-xzbMath1305.68193OpenAlexW2022452161MaRDI QIDQ2258817

Stergios Chatzikyriakidis, Zhaohui Luo

Publication date: 27 February 2015

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-014-9208-x

zbMATH Keywords

formal semanticstype theorycoercive subtypingCoqFraCas test suitenatural language inference

Mathematics Subject Classification ID

Related Items (4)

Propositional forms of judgemental interpretations ⋮ Natural language semantics and computability ⋮ Proof Assistants for Natural Language Semantics ⋮ Adjectival and adverbial modification: the view from modern type theories

Uses Software

• Coq
• Plastic
• GF
• FraCaS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coercive subtyping: theory and implementation
• Whence long-distance indefinite readings? Solving Chierchia's puzzle with dependent types
• Automation for Dependently Typed Functional Programming
• Contextual Analysis of Word Meanings in Type-Theoretical Semantics
• Coercive subtyping
• Common Nouns as Types
• Dot-types and Their Implementation
• Adverbs in a Modern Type Theory
• A formulation of the simple theory of types
• An implementation of LF with coercive subtyping and universes

This page was built for publication: Natural language inference in Coq