An Algebraic Characterization of Typability in ML with Subtyping

Authors:
Marcin Benke
Affiliations:
-
Venue:
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Year:
1999

Citing 15
Cited 0

Type inference with subtypes

Proceedings of the Second European Symposium on Programming
Polymorphic type inference and containment

Logical foundations of functional programming
The undecidability of the semi-unification problem

Information and Computation
An analysis of ML typability

Journal of the ACM (JACM)
Lower bounds on type inference with subtypes

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principal type schemes for functional programs with overloading and subtyping

TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
What are principal typings and what are they good for?

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Putting type annotations to work

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A simple applicative language: mini-ML

LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient Type Reconstruction in the Presence of Inheritance

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Polymorphic Subtype Inference: Closing the Theory-Practice Gap

TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
ML Typability is DEXTIME-Complete

CAAP '90 Proceedings of the 15th Colloquium on Trees in Algebra and Programming
The Subtyping Problem for Second-Order Types is Undecidable

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Coercion and type inference

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We research the problem of typability in the functional language ML extended with both atomic and polymorphic subtyping. The paper analyses the interaction between polymorphism and subtyping and gives an algebraic characterization of the typability problem.