Design of the Programming Language Forsythe (1996)

by John C. Reynolds
Citations:109 - 0 self

Documents Related by Co-Citation

172 Refinement types for ML – Tim Freeman - 1994
54 Functional characters of solvable terms. Zeitschrift für Mathematische Logik und 81 der Mathematik – M Coppo, M Dezani-Ciancaglini, B Venneri - 1981
66 Programming with Intersection Types and Bounded Polymorphism – Benjamin C. Pierce - 1991
25 The coherence of languages with intersection types – John C Reynolds - 1991
484 A semantics of multiple inheritance – Luca Cardelli - 1988
754 On understanding types, data abstraction, and polymorphism – Luca Cardelli, Peter Wegner - 1985
187 Soft typing with conditional types – Er Aiken - 1994
36 Intersection Types and Bounded Polymorphism – Benjamin C. Pierce - 1996
160 The essence of Algol – J Reynolds - 1981
192 Soft Typing – Robert Cartwright, Mike Fagan - 1991
50 Programming With Intersection Types, Union Types, and Polymorphism – Benjamin C. Pierce - 1991
116 Inheritance As Implicit Coercion – Val Breazu-tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov - 1991
141 Operations on records – Luca Cardelli, John C. Mitchell - 1991
200 Type systems – Luca Cardelli, Jim Donahue, Mick Jordan, Bill Kalsow, Greg Nelson - 1997
102 Polymorphic type inference and containment – John C Mitchell - 1988
114 Type Inference for Record Concatenation and Multiple Inheritance – Mitchell Wand - 1989
216 A filter lambda model and the completeness of type assignment. J.Symbolic Logic, 48:931--940 – H Barendregt, M Coppo, M Dezani-Ciancaglini - 1983
58 Principal type schemes for an extended type theory – Ronchi della Rocca, S, B Venneri - 1984
20 union and intersection types for program extraction – Singleton