{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:22:45Z","timestamp":1725456165119},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600176"},{"type":"electronic","value":"9783540494041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0022248","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:12:29Z","timestamp":1132639949000},"page":"76-90","source":"Crossref","is-referenced-by-count":0,"title":["Usability: formalising (un)definedness in typed lambda calculus"],"prefix":"10.1007","author":[{"given":"Jan","family":"Kuper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"6_CR1","volume-title":"Research Topics in Functional Programming Languages","author":"S. Abramsky","year":"1990","unstructured":"Abramsky, S. (1990), The Lazy Lambda Calculus, in: Turner, D.A. (Editor), Research Topics in Functional Programming Languages, Addison-Wesley, Reading, Massachusetts."},{"key":"6_CR2","unstructured":"Barendregt, H.P. (1971), Some extensional term models for combinatory logics and lambda calculi, Ph.D. Thesis, Utrecht."},{"key":"6_CR3","unstructured":"Barendregt, H.P. (1975), Solvability in lambda calculi, Colloque International de Logique, Clermont Ferrand, 209\u2013219."},{"key":"6_CR4","volume-title":"The Lambda Calculus \u2014 Its Syntax and Semantics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P. (1984), The Lambda Calculus \u2014 Its Syntax and Semantics (revised edition), North-Holland, Amsterdam.","edition":"revised edition"},{"key":"6_CR5","first-page":"89","volume-title":"Algebraic Methods in Semantics","author":"G. Berry","year":"1985","unstructured":"Berry, G., P.-L. Curien, J.-J. L\u00e9vy (1985), Full abstraction for sequential languages: state of the art, in: Nivat, M. and J.C. Reynolds (Editors), Algebraic Methods in Semantics, Cambridge University Press, Cambridge, 89\u2013132."},{"key":"6_CR6","unstructured":"Kuper, J. (1994), Partiality in Logic and Computation \u2014 Aspects of Undefinedness, Ph.D.Thesis, Enschede."},{"key":"6_CR7","volume-title":"Ph.D. Thesis","author":"C.-H.L. Ong","year":"1988","unstructured":"Ong, C.-H.L. (1988), The Lazy Lambda Calculus: an Investigation into the Foundations of Functional Programming, Ph.D. Thesis, Imperial College, London."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D.(1977), LCF considered as a programming language, Theoretical Computer Science 5, 223\u2013255.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T06:22:07Z","timestamp":1549347727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600176","9783540494041"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0022248","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}