Type Inference with Recursive Type Equations

Authors:
Mario Coppo
Affiliations:
-
Venue:
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Year:
2001

Citing 7
Cited 1

Type inference with recursive types: syntax and semantics

Information and Computation
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Recursive subtyping revealed: (functional pearl)

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
The Definition of Standard ML

The Definition of Standard ML
Coinductive Axiomatization of Recursive Type Equality and Subtyping

TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Lambda Calculus with Constrained Types (Extended Abstract)

Proceedings of the Conference on Logic of Programs
Some philosophical issues concerning theories of combinators

Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory

Efficient Type Matching

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses decidability and existence of principal types in type assignment systems for λ-terms in which types are considered modulo an equivalence relation induced by a set of type equations. There are two interesting ways of defining such equivalence, an initial and a final one. A suitable transformation will allow to treat both in an uniform way.