{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:28:51Z","timestamp":1738387731936,"version":"3.35.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. of Comput. Sci. &amp; Technol."],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1007\/bf02943577","type":"journal-article","created":{"date-parts":[[2008,9,7]],"date-time":"2008-09-07T15:49:22Z","timestamp":1220802562000},"page":"302-310","source":"Crossref","is-referenced-by-count":0,"title":["Compiling CIL rewriting language for multiprocessors"],"prefix":"10.1007","volume":"9","author":[{"given":"Xinmin","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingxing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weimin","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meiming","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02943577_CR1","volume-title":"Compiling lazy functional language Part II","author":"L Augustsson","year":"1987","unstructured":"Augustsson L. Compiling lazy functional language Part II. Ph.D Thesis, Department of Computer Science, Chalmers University, 1987, Sweden."},{"key":"BF02943577_CR2","doi-asserted-by":"crossref","unstructured":"Burs T H. Clean\u2014A language for function graph rewriting. LNCS 274, Springer-Verlag, Sept. 1987, pp.264\u2013384.","DOI":"10.1007\/3-540-18317-5_20"},{"key":"BF02943577_CR3","unstructured":"Darlington J, Reeve M. ALICE: a multiprocessor reduction machine for the parallel evaluation of applicative language. In: Functional Programming Languages and Computer Architecture, Oct. 1981, ACM, pp.65\u201376."},{"key":"BF02943577_CR4","doi-asserted-by":"crossref","unstructured":"Fairbair J. TIM\u2014a simple lazy abstract machine to execute supercombinator. In: Proc. IFIP Conf. on Func. Prog. Lang. and Comp. Archi., Springer Verlag, LNCS 274, pp.34\u201345.","DOI":"10.1007\/3-540-18317-5_3"},{"issue":"5","key":"BF02943577_CR5","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01383883","volume":"17","author":"B E Goldberg","year":"1988","unstructured":"Goldberg B E. Multiprocessor execution of functional programs.Int'l J., of Parallel Programming, 1988, 17(5): 425\u2013473.","journal-title":"Int'l J., of Parallel Programming"},{"key":"BF02943577_CR6","doi-asserted-by":"crossref","unstructured":"Hudak P, Goldberg B E. Serial combinator: optimal grains of parallelism LNCS 201, Springer-Verlag, Sept., 1985, pp.382\u2013388.","DOI":"10.1007\/3-540-15975-4_49"},{"key":"BF02943577_CR7","unstructured":"Hwang K, Degroot D. Parallel processing for supercomputer and artificial intelligence. McGraw-Hill, 1989."},{"key":"BF02943577_CR8","doi-asserted-by":"crossref","unstructured":"Johnsson T. Parallel graph reduction with the <v,G>-machine. In: Proc. of Functional Prog. Lang. and Comp. Archi., 1989, pp.202\u2013213.","DOI":"10.1145\/99370.99386"},{"key":"BF02943577_CR9","unstructured":"Kernaway J R. Implementing term rewrite languages in DACTL. Internal Report, SYS-C87-02, London College, Jan. 1987."},{"key":"BF02943577_CR10","unstructured":"Kernaway J R. On \u2018On graph rewriting\u2019. Internal Report, SYS-C87-05, London College Jan. 1987."},{"key":"BF02943577_CR11","volume-title":"Introduction to standard ML","author":"R Milner","year":"1987","unstructured":"Milner R, Mitchell H. Introduction to standard ML. Computer Science Department, University of Edinburgh, UK, 1987."},{"key":"BF02943577_CR12","doi-asserted-by":"crossref","unstructured":"Reyton Jones S Let al. GRIP\u2014A high performance architecture for parallel graph reduction. LNCS 274, Sept. 1987, pp.98\u2013112.","DOI":"10.1007\/3-540-18317-5_7"},{"key":"BF02943577_CR13","doi-asserted-by":"crossref","unstructured":"Peyton Jones S Let al. High-performance parallel graph reduction machine. PARLE'89, Springer-Verlag, 1989, pp.184\u2013205.","DOI":"10.1007\/3540512845_40"},{"issue":"2","key":"BF02943577_CR14","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BF02939495","volume":"9","author":"Tian Xinmin","year":"1994","unstructured":"Tian Xinmin, Wang Dingxing, Shen Meiminget al. Granularity analysis for exploiting adaptive parallelism of declarative programs on multiprocessors. Journal of Comput. Sci. & Technol. 1994, 9(2), pp. 144\u2013152.","journal-title":"Journal of Comput. Sci. & Technol."},{"key":"BF02943577_CR15","unstructured":"Tian Xinmin, Wang Dingxing Shen Meiminget al. Automatic parallelizing of compiled functional and logic languages on the abstract machine PAM\/TGR. In: Proceedings of Int'l Computer Symposium ICS'92, Dec. 1992, Taichung, Taiwan."},{"key":"BF02943577_CR16","unstructured":"Tian Xinmin, Wang Dingxing, Shen Meiminget al. An optimized parallel compiler for executing declarative programs on transputer array. In: Proc. of 15th Int'l. Conf. on Transputer and Occam Applications, April, 1992, Aberdeen, UK."},{"key":"BF02943577_CR17","unstructured":"Tian Xinmin, Wang Dingxing, Shen Meiminget al. Parallelizing techniques for compiled declarative languages execution on transputer architecture. In: Proc. of Int'l Conf. on Intelligence Information and System ICIIPS'92, Oct. 1992, PRC."},{"key":"BF02943577_CR18","series-title":"Technical Report","volume-title":"Specification of CIL","author":"Wang Dingxing","year":"1989","unstructured":"Wang Dingxinget al., Specification of CIL. Technical Report, Dept. of Comp. Sci. and Tech., Tsinghua University, Beijing, China, Jan. 1989."},{"key":"BF02943577_CR19","unstructured":"Wang Dingxinget al. A high-level compiling implementation of PARLOG based on extended graph rewriting. In: Proc. of Tools for Artificial Intelligence 90, Washington D.C., USA, Nov. 1990."},{"key":"BF02943577_CR20","doi-asserted-by":"crossref","unstructured":"Watson Pet al. Flagship: A parallel architecture for declarative programming. In: Proc. of the 15th Annual Int'l Symp. on, Comp. Archi., 1988, pp.125\u2013130.","DOI":"10.1109\/ISCA.1988.5221"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02943577.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02943577\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02943577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T21:15:39Z","timestamp":1738358139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02943577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["BF02943577"],"URL":"https:\/\/doi.org\/10.1007\/bf02943577","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}