|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
 |
3
|
|
| |
4
|
Brown, F. M., A deductive System for Elementary Arithmetic. AISB Summer Conference, Edinburgh, 1976.
|
| |
5
|
de Bruijn, N. G., AUTOMATH, a language for mathematics, T.H.- Report 68-WSK-05, Dept. of Mathematics, Technological University, Eindhoven, Netherlands 1968.
|
| |
6
|
Burstall, R. M. & Popplestone, R., POP2 reference manual, in Machine Intelligence 2, eds. E. Dale & D. Michie, American Elsevier, New York, 1968, 205-246.
|
| |
7
|
|
 |
8
|
|
| |
9
|
Gordon, M., Milner, R. & Wadsworth, C. Edinburgh LCF, Department of Computer Science Internal Report CSR-11-77, University of Edinburgh, 1977.
|
| |
10
|
|
| |
11
|
Hayes, P. J., The language GOLUX. University of Essex, 1974.
|
 |
12
|
|
| |
13
|
Hewitt, C., PLANNER: a language for manipulating models and proving theorems in a robot, AI Memo 168, Project MAC, M.I.T., 1970.
|
 |
14
|
|
 |
15
|
|
 |
16
|
|
 |
17
|
|
| |
18
|
|
| |
19
|
Milner, R., Program semantics and mechanised proof, Proc. 2nd Advanced Course in Foundations of Computer Science, Mathematical Centre, Amsterdam, 1976.
|
| |
20
|
Milner, R., LCF: a methodology for performing rigorous proofs about programs, Proc. 1st IBM Symposium on Mathematical Foundations of Computer Science, Amagi, Japan, 1976.
|
| |
21
|
Milner, R., A Theory of Type Polymorphism in Programming, Department of Computer Science Internal Report CSR-9-77, University of Edinburgh, 1977.
|
| |
22
|
Milner, R., Morris, F. L. & Newey, M., A logic for computable functions with reflexive and polymorphic types, Proc. Conf. on Proving and Improving Programs, Arc-et-Senans, 1975.
|
| |
23
|
Milner, R. & Weyhrauch, R., Proving compiler correctness in a mechanised logic, in Machine Intelligence 7, ed. D. Michie, Edinburgh University Press, 1972.
|
| |
24
|
|
| |
25
|
Reboh, R., Sacerdoti, E., A Preliminary QLISP Manual, Technical note 81, Artificial Intelligence Centre, SRI., Mento Park, California 1973.
|
 |
26
|
|
 |
27
|
|
| |
28
|
Scott, D. S. & Strachey, C., Toward a Mathematical Semantics for Computer Languages, Proceedings of the Symposium on Computers and Automata, Microwave Research Institute Symposia Series, Vol.21, Polytechnic Institute of Brooklyn, 1972.
|
| |
29
|
|
| |
30
|
Tennent, R. D., PASQUAL: a proposed generalisation of PASCAL, Tech. Report 75-32, Queens University, Kingston, Ontario, 1975.
|
| |
31
|
Topor, R. Interactive Program Verification using Virtual Programs, Ph.D. Thesis, Edinburgh, 1975.
|
| |
32
|
Waldinger, R. J. & Levitt, C., Reasoning about Programs, Artificial Intelligence, Vol.5 No.3.
|
| |
33
|
|
| |
34
|
Weyhrauch, R. & Milner, R., Program semantics and correctness in a mechanised logic, Proc. USA - Japan Computer Conference, Tokyo, 1972.
|
| |
35
|
Wulf, R. A., London, R. L. & Shaw, M., Abstraction and verification in ALPHARD: introduction to language and methodology, Carnegie-Mellon University, 1976.
|
| |
36
|
Zilles, S., Algebraic specification of data types, Computation Structures Group Memo 119, M.I.T., 1974.
|
CITED BY 18
|
|
|
|
|
|
|
|
|
|
|
|
|
|
R. M. Burstall , D. B. MacQueen , D. T. Sannella, HOPE: An experimental applicative language, Proceedings of the 1980 ACM conference on LISP and functional programming, p.136-143, August 25-27, 1980, Stanford University, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Paul Hudak , Simon Peyton Jones , Philip Wadler , Brian Boutel , Jon Fairbairn , Joseph Fasel , María M. Guzmán , Kevin Hammond , John Hughes , Thomas Johnsson , Dick Kieburtz , Rishiyur Nikhil , Will Partain , John Peterson, Report on the programming language Haskell: a non-strict, purely functional language version 1.2, ACM SIGPLAN Notices, v.27 n.5, p.1-164, May 1992
|
|
|
|
|
|
|
|
|
|
|