Can programming be liberated from the von Neumann style?
Tóm tắt
Từ khóa
Tài liệu tham khảo
Berkling , K.J. Reduction languages for reduction machines. Interner Bericht ISF-76-8, Gesellschaft f'dr Mathematik und Datenverarbeitung MBH , Bonn , Sept. 1976 . Berkling, K.J. Reduction languages for reduction machines. Interner Bericht ISF-76-8, Gesellschaft f'dr Mathematik und Datenverarbeitung MBH, Bonn, Sept. 1976.
Burge , W.H. Recursive Programming Techniques . Addison- Wesley, Reading , Mass ., 1975 . Burge, W.H. Recursive Programming Techniques. Addison- Wesley, Reading, Mass., 1975.
Church , A. The Calculi of Lambda-Conversion . Princeton U. Press , Princeton, N.J. , 1941 . Church, A. The Calculi of Lambda-Conversion. Princeton U. Press, Princeton, N.J., 1941.
Curry , H.B. , and Feys , R . Combinatory Logic, Vol. 1 . North- Holland Pub. Co. , Amsterdam , 1958 . Curry, H.B., and Feys, R. Combinatory Logic, Vol. 1. North- Holland Pub. Co., Amsterdam, 1958.
Dennis , J.B. First version of a data flow procedure language. Tech. Mem. No. 61 , Lab. for Comptr. Sci., M.I.T. , Cambridge , Mass ., May 1973 . Dennis, J.B. First version of a data flow procedure language. Tech. Mem. No. 61, Lab. for Comptr. Sci., M.I.T., Cambridge, Mass., May 1973.
Dijkstra E.W. 4 Discipline of Programming. Prentice-Hall Englewood Cliffs N.J. 1976. Dijkstra E.W. 4 Discipline of Programming. Prentice-Hall Englewood Cliffs N.J. 1976.
Friedman , D.P. , and Wise , D.S . CONS should not evaluate its arguments . In Automata, Languages and Programming, S. Michaelson and R. Milner, Eds., Edinburgh U. Press , Edinburgh , 1976 , pp. 257 - 284 . Friedman, D.P., and Wise, D.S. CONS should not evaluate its arguments. In Automata, Languages and Programming, S. Michaelson and R. Milner, Eds., Edinburgh U. Press, Edinburgh, 1976, pp. 257-284.
Kosinski , P. A data flow programming language. Rep. RC 4264 , IBM T.J. Watson Research Ctr. , Yorktown Heights , N.Y. , March 1973 . Kosinski, P. A data flow programming language. Rep. RC 4264, IBM T.J. Watson Research Ctr., Yorktown Heights, N.Y., March 1973.
Mag~ G.A. A network of microprocessors to execute reduction languages. To appear in Int. J. Comptr. and Inform. Sci. Mag~ G.A. A network of microprocessors to execute reduction languages. To appear in Int. J. Comptr. and Inform. Sci.
Me Jones , P. A Church-Rosser property of closed applicative languages. Rep. RJ 1589, IBM Res. Lab., San Jose , Calif. , May 1975 . Me Jones, P. A Church-Rosser property of closed applicative languages. Rep. RJ 1589, IBM Res. Lab., San Jose, Calif., May 1975.
Reynolds , J.C. Notes on a lattice-theoretic approach to the theory of computation. Dept. Syst. and Inform. Sci ., Syracuse U. , Syracuse , N.Y. , 1972 . Reynolds, J.C. Notes on a lattice-theoretic approach to the theory of computation. Dept. Syst. and Inform. Sci., Syracuse U., Syracuse, N.Y., 1972.
Scott , D. Outline of a mathematical theory of computation . Proc. 4th Princeton Conf. on Inform. Sci. and Syst. , 1970 . Scott, D. Outline of a mathematical theory of computation. Proc. 4th Princeton Conf. on Inform. Sci. and Syst., 1970.
Scott , D. Lattice-theoretic models for various type-free calculi . Proc. Fourth Int. Congress for Logic, Methodology, and the Philosophy of Science , Bucharest , 1972 . Scott, D. Lattice-theoretic models for various type-free calculi. Proc. Fourth Int. Congress for Logic, Methodology, and the Philosophy of Science, Bucharest, 1972.
Scott , D. , and Strachey , C . Towards a mathematical semantics for computer languages . Proc. Symp. on Comptrs. and Automata, Polytechnic Inst. of Brooklyn , 1971 . Scott, D., and Strachey, C. Towards a mathematical semantics for computer languages. Proc. Symp. on Comptrs. and Automata, Polytechnic Inst. of Brooklyn, 1971.