A Semantics for Static Type Inference (1993)

by Gordon Plotkin
Venue:Information and Computation
Citations:9 - 0 self

Documents Related by Co-Citation

15 Filter models with polymorphic types – B Jacobs, I Margaria, M Zacchi - 1992
129 The system F of variable types, fifteen years later – J Y Girard - 1986
25 An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus – S Ronchi Della Rocca F Honsell - 1992
10 On a question of H – G D Plotkin - 1996
5 Countable non-determinism and uncountable limits – P Di Gianantonio, F Honsell, S Liani, G D Plotkin - 1994
8 On n-permutable congruences – J Hagemann, A Mitschke - 1973
137 The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition – H P Barendregt - 1984
44 A Syntactic Characterization of the Equality in some Models for the Lambda Calculus – Martin Hyland - 1976
21 Relating theories of the -calculus – D S Scott - 1980
3 K obˇsčeǐ teorii algebraičeskih sistem – A I Mal’cev - 1954
191 Intensional interpretations of functionals of finite type – W W Tait - 1967
16 Type Inference, Abstract Interpretation and Strictness Analysis", Theor – A Ferrari M Coppo - 1993
7 The Lazy -Calculus : an Investigation into the Foundations of Functional Programming – C-H L Ong - 1988
34 Principal type schemes and -calculus semantics – M Coppo, M Dezani-Ciancaglini, B Venneri - 1980
55 Principal type schemes for an extended type theory – S Ronchi Della Rocca, B Venneri - 1984
52 Intersection Type Assignment Systems – Steffen Van Bakel - 1995
200 A filter lambda model and the completeness of type assignment – H Barendregt, M Coppo, M Dezani-Ciancaglini - 1983
92 Complete restrictions of the intersection type discipline – Steffen Van Bakel - 1992
32 Principal type schemes for the strict type assignment system – Steffen Van Bakel - 1993