NEXT ·  UP ·  PREVIOUS ·  CONTENTS ·  INDEX

References

Ada93
Stephen Adams.
Functional Pearls: Efficient sets--a balancing act.
Journal of Functional Programming, 3(4):553-561, October 1993.

AG96
K. Arnold and J. Gosling.
The Java Programming Language.
Addison-Wesley, 1996.

Bar96
J. Barnes.
Programming in Ada 95.
Addison-Wesley, 1996.

Ber91
Dave Berry.
The Edinburgh SML Library.
Technical Report ECS-LFCS-91-148, Laboratory for Foundations of Computer Science, University of Edinburgh, April 1991.

Car96
Luca Cardelli.
Type systems,
Chapter in CRC Handbook of Computer Science and Engineering,
1996.

GGM91
Carl A. Gunter, Elsa L. Gunter, and David B. MacQueen.
An abstract interpretation for ML equality kinds.
In T. Ito and A. R. Meyer, editors, Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science, pages 112-130. Springer-Verlag, September 1991.

Har89
Robert Harper.
Introduction to Standard ML.
Technical Report ECS-LFCS-86-14, Laboratory for Foundations of Computer Science, University of Edinburgh, January 1989.
Revised edition.

Hen93
Fritz Henglein.
Type inference with polymorphic recursion.
ACM Transactions on Programming Languages and Systems, 15(2):253-289, 1993.

Hin69
J.R. Hindley.
The principal type-scheme of an object in combinatory logic.
Trans. Amer. Math. Soc, 146:29-60, 1969.

Hug89
John Hughes.
Why functional programming matters.
The Computer Journal, 32(2):98-107, April 1989.

Jon92
Richard Jones.
Tail recursion without space leaks.
Journal of Functional Programming, 2(1):73-79, January 1992.

Kah96
Stefan Kahrs.
Limits of ML-definability.
In Proceedings of Eighth International Symposium on Programming Languages, Implementations, Logics, and Programs, September 1996.

Knu89
Donald Knuth.
The errors of TEX.
Software--Practice and Experience, 19:607-685, 1989.

KTU94
A. J. Kfoury, J. Tiuryn, and P. Urzyczyn.
An Analysis of ML Typability.
J. Assoc. Comput. Machinery, 41(2):368-398, March 1994.

MCP93
Colin Myers, Chris Clack, and Ellen Poon.
Programming with Standard ML.
Prentice-Hall, 1993.

Mil78
Robin Milner.
A theory of type polymorphism in programming languages.
Journal of Computer and System Science, 17(3):348-375, 1978.

MNV73
Zohar Manna, Stephen Ness, and Jean Vuillemin.
Inductive methods for proving properties of programs.
Communications of the ACM, 16(8):491-502, August 1973.

MTHM96
Robin Milner, Mads Tofte, Robert Harper, and David MacQueen.
The Definition of Standard ML: Revised 1997.
The MIT Press, 1997.

Pau96
Larry Paulson.
ML for the Working Programmer.
Cambridge University Press, second edition, 1996.

PJL92
Simon L. Peyton-Jones and David Lester.
Implementing Functional Languages: A Tutorial.
International Series in Computer Science. Prentice-Hall, 1992.

Rea89
Chris Reade.
Elements of Functional Programming.
Addison-Wesley, 1989.

Sok91
S. Sokolowski.
Applicative High-Order Programming: The Standard ML Perspective.
Chapman and Hall, 1991.

Tof88
Mads Tofte.
Operational Semantics and Polymorphic Type Inference.
PhD thesis, University of Edinburgh, 1988.
Also published as Technical Report CST-52-88, Department of Computer Science.

Tof89
Mads Tofte.
Four lectures on Standard ML.
Technical Report ECS-LFCS-89-73, Laboratory for Foundations of Computer Science, University of Edinburgh, 1989.

Tof90
Mads Tofte.
Type inference for polymorphic references.
Information and Computation, 89:1-34, 1990.

Tur82
D. A. Turner.
Recursion equations as a programming language.
In J. Darlington, P. Henderson, and D.A. Turner, editors, Functional Programming and its Applications. Cambridge University Press, 1982.

Ull97
J. D. Ullman.
Elements of ML Programming (ML 97 edition).
Prentice-Hall, 1998.

WH86
Jim Welsh and Atholl Hay.
A model implementation of standard Pascal.
International Series in Computer Science. Prentice-Hall, 1986.

Wri95
Andrew K. Wright.
Simple imperative polymorphism.
Lisp and Symbolic Computation, 8(4):343-356, December 1995.

NEXT ·  UP ·  PREVIOUS ·  CONTENTS ·  INDEX