|
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
|
Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
|
 |
3
|
|
| |
4
|
|
| |
5
|
Boyer, R. S., and J. S. Moore, (1973), Proving Theorems About Lisp Programs, Proceedings o.f the int'l Joint Conference on Artificial Intelligence, Stanford, S.R.I., pp. 486-493.
|
| |
6
|
Burstali, R. M., (August 1974), Program proving as hand simulation with a little induction, Information Processing 197, North-Holland Publishing Company, Amsterdam, pp. 308-312.
|
| |
7
|
|
 |
8
|
|
| |
9
|
Curry, H. B., (1958), Combinatory Logic, v. 1, North Holland.
|
| |
10
|
Deutsch, L. P., (1973), An Interactive Program Verifier, Stanford University Ph.D. Thesis and Xerox PARC technical report, CSL-73-1, Palo Alto, CA.
|
| |
11
|
Douglas, D. C., B. Kahle, A. VasLlevsky, (1988), The Architecture o.f the CM-2 Data Processor, Technical Report HA88-1, Thinking Machines Corporation, Cambridge, MA.
|
| |
12
|
Gifford, D. K., P. Jouvelot, J. M. Lucassen, and M. A. Sheldon, (September 1987), FX-87 Reference Manual, MIT/LCS Technical Report 407, MIT Laboratory for Computer Science, Cambridge, MA.
|
| |
13
|
|
| |
14
|
Hinley, J. R., (1969), The principal type scheme of an object in combinatory logic, Transactions of the American Ma~h Society, v. 146, pp. 29-60.
|
 |
15
|
|
| |
16
|
King, J. C., (1969), A program ver,ificr, Ph.D. Thesis, Carnegie-Mellon University, Pittsburg, PA.
|
| |
17
|
Manna, Z. (1969), The correctness of programs, Journal of Computer and System Sciences, v. 3, no. 2, pp. 119-127.
|
 |
18
|
|
| |
19
|
McCarthy, J. and J. A. Painter, (1967), Correctness of a Compiler for Arithmetic Expressions, Proceedings of a Symposium in Applied Mathematics, 19, Mathematical Aspects of Computer Science, American Mathematical Society, Providence, RI, pp. 33-41.
|
| |
20
|
|
| |
21
|
Milner, R., (1978), A theory of type polymorphism in prograrmning, Journal of Computer and System Sciences, v. 17, pp. 348-375.
|
| |
22
|
Milner, R. and R. Weyhrauch, (1972), Proving Compiler Correctness in a Mechanized Logic, Machine Intelligence 7, (Meltzer, B. and D. Mitchie, ads.), Edinburgh University Press, pp. 51-64.
|
| |
23
|
|
 |
24
|
|
| |
25
|
Schonfinkel, M., (1924), Urber die Sausteine der mathematischen Logik, Mathematische A nnalen 92, pp. 305-316.
|
| |
26
|
|
| |
27
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|