{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:39Z","timestamp":1725663999044},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578871"},{"type":"electronic","value":"9783540483830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57887-0_114","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:38:43Z","timestamp":1330263523000},"page":"543-554","source":"Crossref","is-referenced-by-count":10,"title":["Syntactic definitions of undefined: On defining the undefined"],"prefix":"10.1007","author":[{"given":"Zena","family":"Ariola","sequence":"first","affiliation":[]},{"given":"Richard","family":"Kennaway","sequence":"additional","affiliation":[]},{"given":"Jan Willem","family":"Klop","sequence":"additional","affiliation":[]},{"given":"Ronan","family":"Sleep","sequence":"additional","affiliation":[]},{"given":"Fer-Jan","family":"Vries","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"28_CR1","unstructured":"S. Abramsky, D. Gabbay, and T. Maibaum, editors. Handbook of Logic in Computer Science, volume II. Oxford University Press, 1992."},{"key":"28_CR2","volume-title":"The Lambda Calculus, its Syntax and Semantics","author":"H. P. Barendregt","year":"1984","unstructured":"H. P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North-Holland, Amsterdam, 2nd edition, 1984.","edition":"2nd edition"},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1017\/S0956796800000447","volume":"2","author":"H.P. Barendregt","year":"1992","unstructured":"H.P. Barendregt. Representing \u2018undefined\u2019 in the lambda calculus. J. Functional Programming, 2:367\u2013374, 1992.","journal-title":"J. Functional Programming"},{"key":"28_CR4","volume-title":"Technical Report SYS-C93-10","author":"J. R. Kennaway","year":"1993","unstructured":"J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries. Transfinite reductions in orthogonal term rewriting systems. Technical Report SYS-C93-10, University of East Anglia, Norwich, U.K., 1993. Revised version of [?]. To appear in Information and Computation."},{"key":"28_CR5","unstructured":"M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. van Eekelen, editors. Term Graph Rewriting: Theory and Practice. John Wiley, 1993."},{"volume-title":"Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics","year":"1990","key":"28_CR6","unstructured":"J. van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. North-Holland, Amsterdam, 1990."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57887-0_114.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:31Z","timestamp":1619572171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57887-0_114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578871","9783540483830"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-57887-0_114","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}