{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:04:46Z","timestamp":1726412686508},"publisher-location":"Berlin\/Heidelberg","reference-count":35,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010027X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022495","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T00:49:12Z","timestamp":1132706952000},"page":"58-74","source":"Crossref","is-referenced-by-count":0,"title":["Some theoretical aspects of applicative multiprocessing"],"prefix":"10.1007","author":[{"given":"Robert M.","family":"Keller","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"4_CR1","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/359636.359715","volume":"20","author":"E.A. Ashcroft","year":"1977","unstructured":"E.A. Ashcroft and W.W. Wadge. Lucid, a nonprocedural language with iteration. CACM, 20, 7, 519\u2013526 (July 1977).","journal-title":"CACM"},{"key":"4_CR2","first-page":"485","volume":"38","author":"R.M. Balzer","year":"1971","unstructured":"R.M. Balzer. Ports \u2014 A method for dynamic interprogram communication and job control. AFIPS Proc. 38, 485\u2013489 (Spring 1971).","journal-title":"AFIPS Proc."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"R.H. Campbell and A.N. Habermann. The specification of process synchronization by path expressions in Gelenbe and Kaiser (eds.) Operating Systems, Springer Lecture Notes in Computer Science, 16, 89\u2013102 (1974).","DOI":"10.1007\/BFb0029355"},{"key":"4_CR4","unstructured":"A. Church. The calculi of lambda-conversion. Princeton University Press (1941)."},{"issue":"11","key":"4_CR5","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1145\/359642.359655","volume":"21","author":"E.W. Dijkstra","year":"1978","unstructured":"E.W. Dijkstra, et al. On-the-fly garbage collection: An exercise in cooperation. CACM, 21, 11, 966\u2013975 (Nov. 1978).","journal-title":"CACM"},{"key":"4_CR6","unstructured":"J. W. Forrester. World dynamics. Wright-Allen Press (1973)."},{"key":"4_CR7","unstructured":"D.P. Friedman and D.S. Wise. CONS should not evaluate its arguments. in Michaelson and Milner (eds.), Automata, Languages, and Programming, 257\u2013284, Edinburgh University Press (1976)."},{"issue":"4","key":"4_CR8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/TC.1978.1675100","volume":"C-27","author":"D.P. Friedman","year":"1978","unstructured":"D.P. Friedman and D.S. Wise. The impact of applicative programming on multiprocessing. IEEE Trans. on Computers, C-27, 4, 289\u2013296 (April 1978).","journal-title":"IEEE Trans. on Computers"},{"key":"4_CR9","unstructured":"J.V. Giordano. A transformation for parallel programs with indeterminate operators. UC Irvine Dataflow Architecture Project Note No. 46 (Feb. 1980)."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"P. Henderson and J.H. Morris, Jr. A lazy evaluator. Proc. Third ACM Conference on Principles of Programming Languages, 95\u2013103 (1976).","DOI":"10.1145\/800168.811543"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"C.A.R. Hoare","year":"1972","unstructured":"C.A.R. Hoare. Proof of correctness of data representations. Acta Informatica, 1, 271\u2013281 (1972).","journal-title":"Acta Informatica"},{"issue":"8","key":"4_CR12","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"C.A.R. Hoare. Communicating sequential processes. CACM, 21, 8, 666\u2013677 (Aug. 1978).","journal-title":"CACM"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"J.D. Ichbiah, et al. Rationale for the design of the ADA programming language. Sigplan notices, 14, 6, Part B (June 1979).","DOI":"10.1145\/956653.956654"},{"key":"4_CR14","unstructured":"B. Jayaraman. Resource control in a demand-driven data-flow model. University of Utah, Dept. of Computer Science, PhD dissertation proposal (May 1980)."},{"key":"4_CR15","unstructured":"G. Kahn. The semantics of a simple language for parallel programming. Proc. IFIP '74, 471\u2013475 (1974)."},{"key":"4_CR16","unstructured":"G. Kahn and D. MacQueen. Coroutines and networks of parallel processes. Proc. IFIP '77, 993\u2013998 (1977)."},{"key":"4_CR17","unstructured":"R.M. Keller. Semantics of parallel program graphs. University of Utah, Dept. of Computer Science, Tech. Rept. UUCS-77-110 (July 1977)."},{"key":"4_CR18","unstructured":"R.M. Keller. Denotational models for parallel programs with indeterminate operators. In E.J. Neuhold (ed.), Formal description of programming concepts, 337\u2013366, North-Holland (1978)."},{"key":"4_CR19","unstructured":"R.M. Keller. An approach to determinacy proofs. University of Utah, Dept. of Computer Science, Tech. Rept. UUCS-78-102 (March 1978)."},{"key":"4_CR20","unstructured":"R.M. Keller. Sentinels: A concept for multiprocess coordination. University of Utah, Dept. of Computer Science, Tech. Rept. UUCS-78-104 (June 1978)."},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"R.M. Keller, G. Lindstrom, and S. Patil. A loosely-coupled applicative multi-processing system. AFIPS Proc. (June 1979).","DOI":"10.1109\/MARK.1979.8817294"},{"key":"4_CR22","first-page":"105","volume":"80","author":"R.M. Keller","year":"1980","unstructured":"R.M. Keller, G. Lindstrom, and S. Patil. Data-flow concepts for hardware design. Digest of papers, IEEE Compoon 80, 105\u2013111 (Feb. 1980).","journal-title":"Digest of papers, IEEE Compoon"},{"key":"4_CR23","unstructured":"Divide and CONCer: Data structuring aspects of applicative multiprocessing. Manuscript submitted for publication (March 1980)."},{"key":"4_CR24","unstructured":"Semantics and applications of function graphs. Manuscript submitted for publication (March 1980)."},{"key":"4_CR25","unstructured":"R.M. Keller and G. Lindstrom. Hierarchical analysis of a distributed evaluator. Manuscript submitted for publication (March 1980)."},{"key":"4_CR26","unstructured":"R.M. Keller and G. Lindstrom. Programming paradigms in a graph-based Lisp extension. Manuscript submitted for publication (March 1980)."},{"key":"4_CR27","unstructured":"FGL Programmer's guide. Internal memorandum, Dept. of Computer Science, University of Utah (March 1980)."},{"issue":"7","key":"4_CR28","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1145\/361454.361460","volume":"15","author":"Z. Manna","year":"1972","unstructured":"Z. Manna and J. Vuillemin. Fixpoint approach to the theory of computation. CACM, 15, 7, 528\u2013536 (July 1972).","journal-title":"CACM"},{"key":"4_CR29","unstructured":"A.K. Nori. A storage reclamation scheme for AMPS. M.S. Thesis, Dept. of Computer Science, University of Utah (Dec. 1979)."},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"M. O'Donnell. Computing in systems described by equations. Lecture Notes in Computer Science, 58 (1977).","DOI":"10.1007\/3-540-08531-9"},{"key":"4_CR31","series-title":"Supplement 1 to Tech. Rept.","volume-title":"Communication with automata","author":"C.A. Petri","year":"1966","unstructured":"C.A. Petri. Communication with automata. Supplement 1 to Tech. Rept. RADC-TR-65-377. Griffiss Air Force Base, New York (1966)."},{"issue":"7","key":"4_CR32","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/361011.361061","volume":"17","author":"D.M. Ritchie","year":"1975","unstructured":"D.M. Ritchie and K. Thompson. The Unix time-sharing system. CACM, 17, 7, 365\u2013381 (July 1975).","journal-title":"CACM"},{"issue":"1","key":"4_CR33","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/322108.322119","volume":"26","author":"W.J. Savitch","year":"1979","unstructured":"W.J. Savitch and M.J. Stimson. Time bounded random access machines with parallel processing. JACM, 26, 1, 103\u2013118 (Jan. 1979).","journal-title":"JACM"},{"issue":"3","key":"4_CR34","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"D. Scott. Data types as lattices. SIAM J. Comp., 5, 3, 522\u2013587 (Sept. 1976).","journal-title":"SIAM J. Comp."},{"key":"4_CR35","unstructured":"J. Schwarz. Using annotations to make recursion equations behave. Res. Rept. 43, Dept. of Artificial Intelligence, University of Edinburgh (Sept. 1977)."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1980"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0022495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:21:46Z","timestamp":1586564506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010027X"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/bfb0022495","relation":{},"subject":[]}}