Dot-types and their implementation

Authors:
Tao Xue;Zhaohui Luo
Affiliations:
Department of Computer Science, Royal Holloway, University of London, UK;Department of Computer Science, Royal Holloway, University of London, UK
Venue:
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Year:
2012

Citing 9
Cited 1

The calculus of constructions

Information and Computation - Semantics of Data Types
Programming in Martin-Lo¨f's type theory: an introduction

Programming in Martin-Lo¨f's type theory: an introduction
Computation and reasoning: a type theory for computer science

Computation and reasoning: a type theory for computer science
Type-theoretical grammar

Type-theoretical grammar
An Implementation of LF with Coercive Subtyping & Universes

Journal of Automated Reasoning
A Type Driven Theory of Predication with Complex Types

Fundamenta Informaticae - Logic for Pragmatics
Transitivity in coercive subtyping

Information and Computation
Copredication, quantification and frames

LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Contextual analysis of word meanings in type-theoretical semantics

LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics

Coercive subtyping: Theory and implementation

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dot-types, as proposed by Pustejovsky and studied by many others, are special data types useful in formal semantics to describe interesting linguistic phenomena such as copredication. In this paper, we present an implementation of dot-types in the proof assistant Plastic base on their formalization in modern type theories.