{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:27Z","timestamp":1725664167295},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606888"},{"type":"electronic","value":"9783540492627"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995]]},"DOI":"10.1007\/3-540-60688-2_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:52:38Z","timestamp":1330271558000},"page":"103-110","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Labeled \u03bb-calculus and a generalised notion of strictness"],"prefix":"10.1007","author":[{"given":"Milind","family":"Gandhe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Venkatesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitabha","family":"Sanyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"volume-title":"Abstract Interpretation of Declaration Languages","year":"1987","key":"9_CR1","unstructured":"Samson Abramsky and Chris Hankin, editors. Abstract Interpretation of Declaration Languages, Chicester, Great Britain, 1987. Ellis Horwood."},{"key":"9_CR2","unstructured":"H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North Holland, 1984."},{"key":"9_CR3","series-title":"Volume 37 of Lecture Notes in Computer Science","volume-title":"Lambda Calculus and Computer Science","year":"1975","unstructured":"C. Bohm, editor. Lambda Calculus and Computer Science, Volume 37 of Lecture Notes in Computer Science, Berlin, 1975. Springer Verlag. Proceedings of the Symposium held in Rome."},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G. L. Burn","year":"1986","unstructured":"Geoffrey L. Burn, Chris Hankin, and Samson Abramsky. The theory and practice of strictness analysis for higher order functions. Science of Computer Programming, 7:249\u2013278, 1986.","journal-title":"Science of Computer Programming"},{"volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","year":"1980","key":"9_CR5","unstructured":"J.R. Hindley and J.P. Seldin, editors. To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, New York and London, 1980. Academic Press."},{"key":"9_CR6","series-title":"volume 217 of Lecture Notes in Computer Science","first-page":"42","volume-title":"Programs as Data Objects","author":"J. Hughes","year":"1986","unstructured":"J. Hughes. Strictness detection in non-flat domains. In Programs as Data Objects, volume 217 of Lecture Notes in Computer Science, pages 42\u201362, New York, 1986. Springer Verlag."},{"issue":"2","key":"9_CR7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","volume":"12","author":"J.M.E. Hyland","year":"1976","unstructured":"J.M.E. Hyland. A syntactic characterisation of the equality in some models of the \u03bb calculus. Journal of the London Mathematical Society, 12(2):361\u2013370, 1976.","journal-title":"Journal of the London Mathematical Society"},{"key":"9_CR8","unstructured":"J.-J. Levy. An algebraic interpretation of the \u03bb\u03b2\u03ba calculus and a labelled \u03bb-calculus. In Bohm"},{"key":"9_CR9","first-page":"159","volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"J.-J. Levy","year":"1980","unstructured":"J.-J. Levy. Optimal reductions in the lambda calculus. In Hindley and Seldin [5], pages 159\u2013192."},{"key":"9_CR10","first-page":"269","volume-title":"volume 83 of Lecture Notes in Computer Science","author":"A. Mycroft","year":"1980","unstructured":"Alan Mycroft. The theory and practice of transforming call-by-need into call-by-value. In Procs. of an International Symposium on Programming, volume 83 of Lecture Notes in Computer Science, pages 269\u2013281, New York, 1980. Springer Verlag."}],"container-title":["Lecture Notes in Computer Science","Algorithms, Concurrency and Knowledge"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60688-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:51:06Z","timestamp":1578509466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60688-2_38"}},"subtitle":["An extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606888","9783540492627"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-60688-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}