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
141 The system F of variable types: Fifteen years later – J-Y Girard - 1986
26 An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus – F Honsell, S Ronchi Della Rocca - 1992
5 Countable non-determinism and uncountable limits – P Di Gianantonio, F Honsell, S Liani, G D Plotkin - 1994
11 On a question of H – G D Plotkin - 1996
10 On n-permutable congruences – J Hagemann, A Mitschke - 1973
155 The Lambda Calculus: its Syntax and Semantics. North-Holland, Amsterdam, revised edition – H P Barendregt - 1984
48 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
215 Intensional interpretation of functionals of finite type – W W Tait - 1967
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
17 Type inference, abstract interpretation and strictness analysis – M Coppo, A Ferrari - 1993
36 Principal type schemes for the strict type assignment system – Steffen Van Bakel - 1993
59 Principal type schemes for an extended type theory – Ronchi della Rocca, S, B Venneri - 1984
260 Domains for denotational semantics – D S SCOTT - 1982
123 Lambda-calcul, types et modèles – J L Krivine - 1990
231 Domain Theory in Logical Form – Samson Abramsky - 1991