On the type structure of standard ML
- 1 April 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 15 (2), 211-252
- https://doi.org/10.1145/169701.169696
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- A category-theoretic account of program modulesMathematical Structures in Computer Science, 1991
- Abstract types have existential typeACM Transactions on Programming Languages and Systems, 1988
- Polymorphic type inference and containmentInformation and Computation, 1988
- A semantics of multiple inheritanceInformation and Computation, 1988
- The calculus of constructionsInformation and Computation, 1988
- Categorical semantics for higher order polymorphic lambda calculusThe Journal of Symbolic Logic, 1987
- An ideal model for recursive polymorphic typesInformation and Control, 1986
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- Locally cartesian closed categories and type theoryMathematical Proceedings of the Cambridge Philosophical Society, 1984
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975