{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T20:17:01Z","timestamp":1784233021679,"version":"3.55.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0096-0551(01)00007-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:51:15Z","timestamp":1027612275000},"page":"27-41","source":"Crossref","is-referenced-by-count":2,"title":["Lenient evaluation and parallelism"],"prefix":"10.1016","volume":"26","author":[{"given":"G.","family":"Tremblay","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.","family":"Malenfant","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0096-0551(01)00007-8_BIB1","doi-asserted-by":"crossref","unstructured":"Tremblay G. Lenient evaluation is neither strict nor lazy. Computer Languages 2000;26:43\u201366.","DOI":"10.1016\/S0096-0551(01)00006-6"},{"key":"10.1016\/S0096-0551(01)00007-8_BIB2","unstructured":"Traub K. Sequential implementation of lenient programming languages. Technical Report MIT\/LCS\/TR-417, Laboratory for Computer Science, MIT, 1988."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB3","unstructured":"Nikhil R. The parallel programming language Id and its compilation for parallel machines. CSG Memo 313, Laboratory for Computer Science, MIT, July 1990."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB4","unstructured":"Milner R. The polyadic pi-calculus: a tutorial. Technical Report ECS-LFCS-91-180, LFCS, Department of Computer Science, University of Edinburgh, UK, 1991."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB5","series-title":"Communicating and mobile systems: the \u03c0-Calculus.","author":"Milner","year":"1999"},{"key":"10.1016\/S0096-0551(01)00007-8_BIB6","doi-asserted-by":"crossref","unstructured":"Milner R. Functions as processes. In: Paterson MS, editor. Automata, languages and programming, Lecture Notes in Computer Science, vol. 443. Berlin: Springer, 1990, p. 167\u201380.","DOI":"10.1007\/BFb0032030"},{"key":"10.1016\/S0096-0551(01)00007-8_BIB7","unstructured":"Glauert J, Leth L, Thomsen B. A new process model for functions. In: Sleep M, Plasmeijer M, van Eekelen M, editors. Term graph rewriting\u2014theory and practice, New York: Wiley, 1993, p. 269\u201382."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB8","unstructured":"Ostheimer G, Davie A. \u03c0-calculus characterizations of some practical lambda-calculus reduction strategies. Technical Report CS 93\/14, University of St Andrews, Division of Computer Science, October 1993."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB9","unstructured":"Hum H, Maquelin O et al. A design study of the EARTH multiprocessor. In: Bic L, Bohm W, Evripidou P, Gaudiot JL, editors. PACT \u201995, New York: ACM Press, 1995, p. 59\u201368."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB10","unstructured":"Nikhil R, Arvind HJ, Aditya S, Augustsson L, Meassen J.-W, Zhou Y. pH language reference manual, version 1.0\u2014preliminary. Technical Report 369, Laboratory for Computer Science, MIT, January 1995."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB11","unstructured":"Peterson J, Hammond K. editors. Report on the programming language Haskell, a non-strict purely functional language (Version 1.4). Technical Report, Yale University, Department of Computer Science, April 1997."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB12","unstructured":"Pierce B. Foundational calculi for programming languages. In: Tucker A, editor. Handbook of computer science and engineering. Boca Raton, FL: CRC Press, 1996 [chapter 139]."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB13","doi-asserted-by":"crossref","unstructured":"Glauert J. Asynchronous mobile processes and graph rewriting. In: Etiemble D, Syre JC, editors. PARLE\u201992, Lecture Notes in Computer Science, vol. 605. Berlin: Springer, 1992. p. 63\u201378.","DOI":"10.1007\/3-540-55599-4_81"},{"key":"10.1016\/S0096-0551(01)00007-8_BIB14","doi-asserted-by":"crossref","unstructured":"Hum H, Theobald K, Gao G. Building multithreaded architectures with off-the-shelf microprocessors. Proceedings of the Eighth IEEE International Parallel Processing Symposium, 1994.","DOI":"10.1109\/IPPS.1994.288287"},{"key":"10.1016\/S0096-0551(01)00007-8_BIB15","unstructured":"Tremblay G, Theobald K, Morrone C, Butala M, Amaral J, Gao G. Threaded-C language reference manual (release 2.0). CAPSL Technical Memo 39, University of Delaware, September 2000."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB16","series-title":"Denotational semantics: a methodology for language development.","author":"Schmidt","year":"1988"},{"key":"10.1016\/S0096-0551(01)00007-8_BIB17","unstructured":"Malenfant B. S\u00e9mantique et mise en oeuvre parall\u00e8le d'un langage fonctionnel indulgent. Master's thesis, D\u00e9pt.d'Informatique, UQAM, D\u00e9c. 1998."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB18","unstructured":"Tremblay G, Gao G. The impact of laziness on parallelism and the limits of strictness analysis. In: Bohm AW, Feo J, editors. High Performance Functional Computing, Lawrence Livermore National Laboratory, University of California, Livermore, CA, CONF-9504126, 1995. p. 119\u201333."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB19","unstructured":"Tremblay G. Compilation de langages paresseux par analyse de stricticit\u00e9 arri\u00e8re: Utilit\u00e9 et limites. In JFLA 96\u2014Journ\u00e9es Francophones des Langages Applicatifs, INRIA #15 (Collection Didactique), Janvier 1996. p. 225\u201344."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB20","unstructured":"Davis K. Projection-based termination analysis. Proceedings of the 1991 Glasgow Workshop on Functional Programming. Berlin: Springer, 1991."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB21","unstructured":"Tremblay G. Parallel Implementation of Lazy Functional Languages using Abstract Demand Propagation. Ph.D. thesis, School of Computer Science, McGill University, November 1994."},{"key":"10.1016\/S0096-0551(01)00007-8_BIB22","unstructured":"Tremblay G, Malenfant B. S\u00e9mantique parall\u00e8le d'un langage fonctionnel indulgent. Rapport interne de recherche: www.info.uqam.ca\/\u00a0\u0303tremblay\/TremblayMal98-2.html, Septembre 1998."}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096055101000078?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096055101000078?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T01:52:31Z","timestamp":1555897951000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096055101000078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0096055101000078"],"URL":"https:\/\/doi.org\/10.1016\/s0096-0551(01)00007-8","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}