Refinement types for ML

Refinement types for ML (1994)

by Tim Freeman

Venue:
Citations:	151 - 11 self

@MISC{Freeman94refinementtypes,
    author = {Tim Freeman},
    title = {Refinement types for ML},
    year = {1994}
}

2172	The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
996	The Lambda Calculus, Its Syntax and Semantics - Barendregt - 1984
634	A framework for defining logics - Harper, Honsell, et al. - 1993
289	Subtyping recursive types - Amadio, Cardelli - 1993
251	A type-theoretic approach to higher-order modules - Harper, Lillibridge - 1994
221	Principal type schemes for functional programs - Damas, Milner - 1982
136	de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem - G - 1972
90	A simple applicative language: Mini-ml - Clément, Despeyroux, et al. - 1986
73	Basic polymorphic typechecking - Cardelli - 1987
63	Some properties of conversion - Church, Rosser
54	A regular type language for logic programs - Dart, Zobel - 1992
34	Principal type schemes and -calculus semantics - Coppo, Dezani-Ciancaglini, et al. - 1980
33	Polymorphic subtype inference: Closing the theory-practice gap - Fuh, Mishra - 1989
27	A complete type inference algorithm for simple intersection types - Coppo, Giannini - 1992
25	Deriving Algorithms from Type Inference Systems: Application to Strictness Analysis - Hankin, M'etayer - 1994
2	Finding fixed points in non-trivial domains: Proofs of pending analysys and related argorithms - Dix - 1988