Reduction languages for reduction machines

Proceedings - International Symposium on Computer Architecture

Volumn , Issue , 1975, Pages 133-140

  Berkling, K J ^a  

^a Gesellschaft fuer Mathematik und Datenverarbeitung ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMS; CALCULATIONS; DIFFERENTIATION (CALCULUS); SYNTACTICS; TREES (MATHEMATICS);

BINDING PARAMETER; CONTROL STRUCTURE; HIGHER-LEVEL PROGRAMMING LANGUAGES; INFORMATION STRUCTURES; INTERMEDIATE REPRESENTATIONS; MACHINE LANGUAGES; PROTECTION SYSTEMS; RECURSIVE STRUCTURE;

COMPUTER ARCHITECTURE;

EID: 85041939306     PISSN: 10636897     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/642089.642112     Document Type: Conference Paper

References (10)

1. J. McCarthy et al. LISP 1.5 Programming Manual, Cambridge, Mass.: MIT Press, 1964.
2. C.N. Mooers, L.P. Deutsch TEAC, A Text Handling Language. Proc. ACM 20th Nat'l Conf. (1965) 229
3. C. Strachey A General Purpose Macro Generator. The Computer Journal 8 (1965), 3
4. J. Backus "Reduction Languages and Variable-free Programming", San Jose, California, IBM Research Report RJ 1010, April 7, 1972.
5. J. Backus "Programming Language Semantics and Closed Applicative Languages", San Jose, California, IBM Research Report RJ 1245, July 5, 1973.
6. D.E. Knuth "The Art of Computer Programming, Fundamental Algorithsms", Vol. 1, Reading, Mass.: Addisom-Wesley, 1968, pp. 318-319.
7. A. Church "The calculi of lambda-conversion", . Annals of Math. studies, No. 6, Princeton Dniv. Press, 1941.
8. K.J. Berkling "A Method to Rename Variables Dsing an Unbinding Operator", (to be published)
9. P.J. Lanain "The mechanical evaluation of expressions" The Computer Journal, Vol. 6, No.4 (January 1964), pp. 30S-320.
10. K.J. Berkling "A Computing Machine Based on Tree Structures" IEEE Transactions on Computers, Vol. C-20, No. 4 (April 1971), pp. 404-418.