Type inference with constrained types (1997)

by Martin Odersky , Martin Sulzmann , Martin Wehr
Venue:Fourth International Workshop on Foundations of Object-Oriented Programming (FOOL)
Citations:46 - 5 self

Documents Related by Co-Citation

214 Type Inclusion Constraints and Type Inference – Alexander Aiken, Edward L. Wimmers - 1993
67 Simplifying Subtyping Constraints – Francois Pottier - 1996
132 Qualified types: Theory and practice – M P Jones - 1992
61 Subtyping Constrained Types – Valery Trifonov, Scott Smith - 1996
50 Proofs about a Folklore Let-Polymorphic Type Inference Algorithm – Oukseh Lee, Kwangkeun Yi - 1998
172 Refinement types for ML – Tim Freeman - 1994
945 A machine-oriented logic based on the resolution principle – J A Robinson - 1965
357 Principal type-schemes for functional programs. Pages 207–212 of – Luis Damas, Robin Milner - 1982
538 A Syntactic Approach to Type Soundness – Andrew K. Wright, Matthias Felleisen - 1992
77 A simple algorithm and proof for type inference – M Wand - 1987
702 Types and programming languages – Benjamin C Pierce - 2002
83 Type Inference for Recursively Constrained Types and its Application to OOP – Jonathan Eifrig, Scott Smith, Valery Trifonov - 1995
939 A theory of type polymorphism in programming – Robin Milner - 1978
234 Principal type schemes for functional programs – R Milner - 1982
99 Cylindric algebras – L Henkin, J Monk, A Tarski - 1971
111 Componential set-based analysis – Cormac Flanagan, Matthias Felleisen - 1997
15 Polymorphic unification and ML typing – Paris C Kanellakis, John C Mitchell - 1989
49 Deciding ML typability is complete for deterministic exponential time – Harry G Mairson - 1990
141 The principal type-scheme of an object in combinatory logic – R Hindley - 1969