{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:15Z","timestamp":1725663555656},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543459"},{"type":"electronic","value":"9783540475798"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":[[1991]]},"DOI":"10.1007\/3-540-54345-7_82","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:42:59Z","timestamp":1330191779000},"page":"387-396","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An extensional partial combinatory algebra based on \u03bb-terms"],"prefix":"10.1007","author":[{"given":"Ram\u00f3n Pino","family":"Perez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"39_CR1","unstructured":"Abramsky, A., (1989), The Lazy Lambda Calculus. In \u201dDeclarative Programming\u201d. David Turner, editor. Addison-Wesley. To appear."},{"key":"39_CR2","unstructured":"Abramsky, A., Ong C.-H. L. (1989), Full Abstraction in the Lazy Lambda Calculus. To appear."},{"key":"39_CR3","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H. (1984), \u201dThe Lambda Calculus: Its Syntax and Semantics\u201d. North-Holland. Amsterdam. 1984."},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Beeson, M. (1985), \u201cFoundations of Constructive Mathematics\u201d. Springer-Verlag. 1985","DOI":"10.1007\/978-3-642-68952-9"},{"key":"39_CR5","unstructured":"Berry, G. (1981) \u201dSome Syntactic and Categorical Constructions of Lambda Calculus Models\u201d. Rapport de Recherche de L'Institut National de Recherche en Informatique et Automatique (INRIA). Rocquancourt. 1981."},{"key":"39_CR6","unstructured":"Bethke, I. (1988), \u201dNotes on Partial Combinatory Algebras\u201d. Ph.D. Thesis. University of Amsterdam. 1988."},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Hoofman, R., Schellinx, H. (1991) Collapsing Graph Models by Preorders. ITLI Prepublication Series ML-91-04. Amsterdam. 1991.","DOI":"10.1007\/BFb0013457"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Egidi, L., Honsell, F., Ronchi de la Rocca, S. The for Lazy call-by-value \u03bb-calculus. Presented at Jumelage on typed lambda calculus, Paris, 1\u20135 February 1991.","DOI":"10.1007\/3-540-54345-7_59"},{"key":"39_CR9","unstructured":"Moggi, E. (1986), Categories of partial morphisms and the Partial Lambda Calculus. In \u201dProceedings of the Workshop on Category Theory and Computer Programming\u201d. Guilford 1985. Lecture Notes in Computer Science vol. 240. Springer-Verlag, 1986."},{"key":"39_CR10","unstructured":"Moggi, E. (1988), The Partial Lambda Calculus, Ph.D. Thesis, University of Edinburgh. 1988."},{"key":"39_CR11","unstructured":"Pino P\u00e9rez, R. (1990), Contribution \u00e0 l'\u00e9tude du Lambda Calcul Partiel. Forthcoming thesis (draft). Universit\u00e9 Paris 7."},{"key":"39_CR12","unstructured":"Pino P\u00e9rez, R. (1991), Semantics of the partial lambda calculus. Rapport de recherche LIFL. Universit\u00e9 Lille I. 1991."},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Plotkin, G. (1975), Call-by-name, call-by-value and the \u03bb-calculus. Theoretical Computer Science (1), 1975.","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"39_CR14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A. (1955) A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics. Vol. 5, pp 285\u2013309.","journal-title":"Pacific Journal of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54345-7_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:07:26Z","timestamp":1558253246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54345-7_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543459","9783540475798"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-54345-7_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}