{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:09Z","timestamp":1725663489195},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540556022"},{"type":"electronic","value":"9783540472520"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55602-8_196","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:21:17Z","timestamp":1330233677000},"page":"618-632","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Programming with equations: A framework for lazy parallel evaluation"],"prefix":"10.1007","author":[{"given":"R. C.","family":"Sekar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. V.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"R. Burstall, D. MacQueen and D. Sanella, Hope: An Experimental Applicative Language, Proc. of 1st Int. LISP Conf., 1980.","DOI":"10.1145\/800087.802799"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.P. Jouannaud, Rewrite Systems, Handbook of Theoretical Computer Science, Ch. 6, Vol II, North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J. Goguen, J.P. Jouannaud and J. Meseguer, Principles of OBJ2, POPL 1985, pp. 52\u201366.","DOI":"10.1145\/318593.318610"},{"key":"46_CR4","unstructured":"R. Harper, R. Milner and M. Tofte, The Definition of Standard ML, Report ECS-LFCS-88-62, LFCS, U. of Edinburgh, 1988."},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"C. Hoffmann, and M.J. O'Donnell, Implementation of an Interpreter for Abstract Equations, POPL 1984, pp. 111\u2013120.","DOI":"10.1145\/800017.800522"},{"key":"46_CR6","volume-title":"TR No. 359","author":"G. Huet","year":"1979","unstructured":"G. Huet and J.J. Levy, Computations in Nonambiguous Linear Term Rewriting Systems, TR No. 359 (1979), INRIA, France."},{"key":"46_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0168-0072(89)90024-9","volume":"43","author":"J.R. Kennaway","year":"1989","unstructured":"J.R. Kennaway, Sequential Evaluation Strategies for Parallel-Or and Related Reduction Systems, Annals of Pure and Applied Logic 43, pp. 31\u201356, 1989.","journal-title":"Annals of Pure and Applied Logic"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"A. Laville, Lazy Pattern Matching in the ML Language, Proc. of FST&TCS, Springer-Verlag LNCS, 1987.","DOI":"10.1007\/3-540-18625-5_64"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"M.J. O'Donnell, Equational Logic as a Programming Language, MIT Press (1985).","DOI":"10.1007\/3-540-15648-8_20"},{"key":"46_CR10","unstructured":"K. Owen, S. Pawagi, C.R. Ramakrishnan, I.V. Ramakrishnan and R.C. Sekar, Fast Parallel Implementation of Lazy Languages \u2014 The EQUALS Experience, Lisp and Functional Programming, 1992."},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"R.C. Sekar, S. Pawagi and I.V. Ramakrishnan, Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient Parallel Execution, RTA 1989.","DOI":"10.1007\/3-540-51081-8_122"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Sekar, R.C, Shaunak Pawagi and Ramakrishnan, I.V., Small Domains Spell Fast Strictness Analysis, POPL 1990.","DOI":"10.1145\/96709.96727"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Robert I. Strandh, Compiling Equational Programs into Efficient Machine Code, PhD Thesis, Johns Hopkins University, 1988.","DOI":"10.1007\/3-540-51081-8_125"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Satish Thatte, On the correspondence between two classes of Reduction systems, Information Processing Letters 20 (2), pp. 83\u201385.","DOI":"10.1016\/0020-0190(85)90068-7"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction\u2014CADE-11"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55602-8_196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:39:11Z","timestamp":1558255151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55602-8_196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540556022","9783540472520"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-55602-8_196","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}