Principal type schemes for functional programs with overloading and subtyping
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Principal types and unification for simple intersection type systems
Information and Computation
Type Reconstruction with Recursive Types and Atomic Subtyping
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Principle based semantics for HPSG
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
| Hi-index | 0.00 |
We describe a type reconstruction algorithm for a fragment of natural language. It is based on Hindley's algorithm for simple types, but extends it with subtyping and overloading. We extend one of Montague's fragments of English by plural noun phrases which may have several types and by overloaded verbs to allow for distributed and non-distributed readings of noun phrases and verb arguments. We demonstrate how type reconstruction can select suitable meanings of subject noun phrases depending on the meaning of verb phrases. Thus, type reconstruction enables us to handle some violations of Frege's compositionality principle.