Publication:4843182
From MaRDI portal
zbMath0855.68073MaRDI QIDQ4843182
Publication date: 10 August 1995
type theory; parsing; natural languages; temporal reference; anaphoric expression; sugaring; English structures
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68T50: Natural language processing
Related Items
Algorithmic Theories of Problems. A Constructive and a Non-Constructive Approach, Type theoretic semantics for SemNet, Context-relative syntactic categories and the formalization of mathematical text, Situations as Strings, Translating between Language and Logic: What Is Easy and What Is Difficult, Machine Translation and Type Theory, Interpreting descriptions in intensional type theory, A type reduction from proof-conditional to dynamic semantics, Propositional forms of judgemental interpretations, Syntactic categories in the language of mathematics, Type theory and the informal language of mathematics, ``Inference versus consequence revisited: inference, consequence, conditional, implication, Intuitionistic completeness of first-order logic, Assertion and grounding: a theory of assertion for constructive type theory, Figures of dialogue: a view from ludics, A modal type theory for formalizing trusted communications, Constructive belief reports, Constructing situations and time, Adjectival and adverbial modification: the view from modern type theories, A constructive type-theoretical formalism for the interpretation of subatomically sensitive natural language constructions, On fuzzy type theory, Situations in LTL as strings, Inaccessibility in constructive set theory and type theory, A constructive approach to state description semantics, A more general general proof theory, Reprint of: ``A more general general proof theory, Identity and sortals (and Caesar), The axioms of constructive geometry, The hole argument, take \(n\), A computational treatment of anaphora and its algorithmic implementation, Expressing `the structure of' in homotopy type theory, Meaning and computing: two approaches to computable propositions, Natural language inference in Coq, Inverse linking, possessive weak definites and Haddock descriptions: a unified dependent type account, Variable handling and compositionality: comparing DRT and DTS, The assertion-candidate and the meaning of mood, On descriptional propositions in Ibn Sīnā: elements for a logical analysis, Implementing Variable Vectors in a CCG Parser, Proof Assistants for Natural Language Semantics, Type Reconstruction for $$\lambda $$-DRT Applied to Pronoun Resolution, The Axiom of Choice as Interaction Brief Remarks on the Principle of Dependent Choices in a Dialogical Setting, Ludics and Its Applications to Natural Language Semantics
