Conjunctional type assignment in programming languages

Authors:
R. Ghosh-Roy;Frank Jensen
Affiliations:
Institute of Electronic Systems, Department of Mathematics and Computer Science, Aalborg University Centre, Strandvejen 19, DK-9000 Aalborg, Denmark;Institute of Electronic Systems, Department of Mathematics and Computer Science, Aalborg University Centre, Strandvejen 19, DK-9000 Aalborg, Denmark
Venue:
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Year:
1988

Citing 3
Cited 0

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Polymorphic type inference

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An Extended Polymorphic Type System for Applicative Languages

MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this work is to widen ML-type polymorphism to a more comprehensive form. Polymorphic type systems as proposed by Milner and implemented in the programming language Standard ML offer rich types, unobtrusive compile time type checking, and type safety in functional languages. However, straightforward application of such a type system to languages can inhibit seriously the characteristic polymorphic nature of an argument occurring twice or more in a function definition. We describe the problems and present a formal type discipline for polymorphic expressions in the context of a simple programming language, and a compile time type-checking algorithm R which enforces the discipline. The algorithm, which is sound and (we believe) complete, introduces a new operator 2229 for handling conjunction types. We also suggest an idea about a unification algorithm for handling type expressions with or without 2229-operators [gho87b].