Using Signatures in Type Theory to Represent Situations

  title={Using Signatures in Type Theory to Represent Situations},
  author={Stergios Chatzikyriakidis and Zhaohui Luo},
  booktitle={JSAI-isAI Workshops},
Signatures have been introduced to represent situations in formal semantics based on modern type theories. In this paper, we study the notion of signature in more details, presenting it formally and discussing its use in representations of situations. In particular, the new forms of signature entries, the subtyping entries and the manifest entries, are formally presented and studied. Besides being signature entries, these two forms of entries may be introduced to form contextual entries as well… 
Subtyping in signatures
A new way of adding coercive subtyping to type theory, specifically by annotating certain functions in assumptions, is introduced, arguing that this is more handy to represent practical cases.
Proof Assistants for Natural Language Semantics
This paper shows how to use Coq, a prominent type theory based proof assistant, to encode type theoretical semantics of various NL phenomena, and shows that Coq is a powerful engine for checking the formal validity of these accounts as well as a powerful reasoner about the implemented semantics.
Adjectival and Adverbial Modification: The View from Modern Type Theories
It is argued that MTTs can be used as an adequate language for interpreting NL semantics and not only expressive enough to deal with a range of modification phenomena, but well-suited to perform reasoning tasks that can be easily implemented given their proof-theoretic nature.
Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016)
Two Papers on FC Disjunction in State-Based Semantics and the Foundations of State-based Semantics show that the relationship between FC disjunction and semantics and state-based semantics is driven by different underlying mechanisms.
Type Theories and Lexical Networks: using Serious Games as the basis for Multi-Sorted Typed Systems
This paper shows how a rich lexico-semantic network, JeuxDeMots, can help in grounding the authors' semantic ontologies as well as different sorts of information in doing formal semantics using rich or modern type theories (type theories within the tradition of Martin Lof).
Natural Language Reasoning using Coq: Interaction and Automation
Dans cet article, nous présentons une utilisation des assistants des preuves pour traiter l’inférence en Language Naturel (NLI), d’utiliser les theories des types modernes comme langue dans laquelle traduire la sémantique du langage naturel.


Formalizing Context in Intuitionistic Type Theory
The article discusses formal aspects of the notion of context as needed in AI applications. We advocate the use of Martin-Lof's intuitionistic type theory to formalize and implement contexts. Through
Formal Semantics in Modern Type Theories: Is It Model-Theoretic, Proof-Theoretic, or Both?
It is argued that, for NLs, the divide between model-theoretic semantics and proof-the theoretical semantics has not been well-understood, and that MTTs arguably have unique advantages when employed for formal semantics.
Formal semantics in modern type theories with coercive subtyping
The theory of coercive subtyping adequately extends the modern type theories and plays a very useful role in making type theories more expressive for formal semantics, and provides a powerful formal framework to model interesting linguistic phenomena such as copredication.
Type-theoretical semantics with coercive subtyping
In the formal semantics based on modern type theories, common nouns are interpreted as types, rather than as functional subsets of entities as in Montague grammar. This brings about important
Manifest Fields and Module Mechanisms in Intensional Type Theory
It is shown that, for both Σ -types and dependent record types, the with -clause for expressing manifest fields can be introduced by means of the intensional manifest fields, providing not only a higher-order module mechanism with ML-style sharing, but a powerful modelling mechanism in formalisation and verification of OO-style program modules.
Adverbs in a Modern Type Theory
This paper is the first attempt to deal with aspects of the semantics of adverbs within a modern type theoretical setting and shows that the inferences associated with veridical adverbs can be dealt with via typing alone, i.e. without the aid of meaning postulates.
Coercive subtyping: Theory and implementation
The Proper Treatment of Quantification in Ordinary English
The aim of this paper is to present in a rigorous way the syntax and semantics of a certain fragment of a certain dialect of English. For expository purposes the fragment has been made as simple and
Type-Theoretical Grammar
1. Preliminary remarks 2. Gradual introduction to type theory 3. Logical operators in English 4. Anaphoric expressions 5. Temporal reference 6. Text and discourse 7. Context and possible worlds 8.
Formalization ov Coercions in Lexical Semantics
This work proposes a framework that is robust enough and precise enough to permit an investigation of the typology of coercions with respect to their behavior on discourse continuations, especially cross-linguistically.