{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:22:00Z","timestamp":1725495720451},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643012"},{"type":"electronic","value":"9783540697213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0052378","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:31:11Z","timestamp":1149643871000},"page":"302-316","source":"Crossref","is-referenced-by-count":1,"title":["SN combinators and partial combinatory algebras"],"prefix":"10.1007","author":[{"given":"Yohji","family":"Akama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Y. Akama. A \u03bb-to-CL translation for strong normalization. In Ph. de Groote and J.R. Hindley, eds., TLCA, Proceedings, vol. 1210 of LNCS, pp. 1\u201310. 1997.","DOI":"10.1007\/3-540-62688-3_25"},{"key":"23_CR2","unstructured":"H.P. Barendregt. The Lambda Calculus, Its Syntax and Semantics. North-Holland, second edition, 1984."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"M. Beeson. Foundations of Constructive Mathematics. 1984.","DOI":"10.1007\/978-3-642-68952-9"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(93)90084-7","volume":"121","author":"A. Berarducci","year":"1993","unstructured":"A. Berarducci and B. Intrigila. Some new results on easy lambda-terms. TCS, 121:71\u201388, 1993.","journal-title":"TCS"},{"issue":"3","key":"23_CR5","first-page":"819","volume":"52","author":"I. Bethke","year":"1987","unstructured":"I. Bethke. On the existence of extensional partial combinatory algebras. JSL, 52(3):819\u2013833, 1987.","journal-title":"JSL"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"I. Bethke and J. W. Klop. Collapsing partial combinatory algebras. In G. Dowek et al., eds., HOA, Proceedings, vol. 1074 of LNCS, pp. 57\u201373. 1996.","DOI":"10.1007\/3-540-61254-8_19"},{"key":"23_CR7","volume-title":"Technical report","author":"N. Cagman","year":"1997","unstructured":"N. Cagman and J.R. Hindley. Combinatory weak reduction in lambda calculus. Technical report, University of Wales Swansea, Swansea, U.K., 1997."},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-3975(92)90306-Z","volume":"100","author":"M. Dezani-Ciancaglini","year":"1992","unstructured":"M. Dezani-Ciancaglini and J.R. Hindley. Intersection types for combinatory logic. TCS, 100(2):303\u2013324, 1992.","journal-title":"TCS"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/FI-1992-16205","volume":"16","author":"L. Egidi","year":"1992","unstructured":"L. Egidi, F. Honsell, and S. Ronchi Della Rocca. Operational, denotational and logical descriptions: A case study. Fundamenta Informaticae, 16:149\u2013169, 1992.","journal-title":"Fundamenta Informaticae"},{"key":"23_CR10","unstructured":"B. Gramlich. Termination and Confluence Properties of Structured Rewrite Systems. PhD thesis, Universit\u00e4t Kaiserslautern, 1996."},{"key":"23_CR11","volume-title":"Internal report","author":"F. Honsell","year":"1984","unstructured":"F. Honsell and S. Ronchi della Rocca. Models for theories of functions strictly depending on all their arguments. Internal report, Department of Computer Science, Turin, Italy, 1984."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","volume":"12","author":"J. M. E. Hyland","year":"1976","unstructured":"J. Martin E. Hyland. A syntactic characterization of the equality in some models of the lambda calculus. J. London Math. Soc. (2), 12:361\u2013370, 1976.","journal-title":"J. London Math. Soc. (2)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"J.M.E. Hyland and C.-H. L. Ong. Modified realizability toposes and strong normalization proofs (extended abstract). In M. Bezem and J.F. Groote, eds., TLCA, Proceedings, vol. 664 of LNCS, pp. 179\u2013194. 1993.","DOI":"10.1007\/BFb0037106"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"G.Jacopini. A condition for identifying two elements of whatever model of combinatory logic. In C.B\u00f6hm, editor, \u03bb-calculus and computer science theory, vol. 37 of LNCS, pp. 213\u2013219. 1975.","DOI":"10.1007\/BFb0029527"},{"issue":"2","key":"23_CR15","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3233\/FI-1985-8205","volume":"8","author":"G. Jacopini","year":"1985","unstructured":"G. Jacopini and M. Venturini Zilli. Easy terms in the lambda-calculus. Fundamenta Informaticae, 8(2):225\u2013233, 1985.","journal-title":"Fundamenta Informaticae"},{"key":"23_CR16","unstructured":"J.W. Klop. Term rewriting systems. In S. Abramsky et al., editors, Handbook of Logic in Computer Science, volume 2, pages 2\u2013117. Oxford UP, 1992."},{"key":"23_CR17","unstructured":"T. Kurata. Subtype relations yielding filter lambda-models. In T. Ida, A. Ohori, and M. Takeichi, eds., Second Fuji International Workshop on Functional and Logic Programming, Proceedings, pp. 210\u2013229. World Scientific, 1997."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"R. Pino Perez. An extensional partial combinatory algebra based on \u03bb-terms. In A. Tarlecki, editor, MFCS, Proceedings, vol. 520 of LNCS, pp. 387\u2013396. 1991.","DOI":"10.1007\/3-540-54345-7_82"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G. Plotkin","year":"1975","unstructured":"G. Plotkin. Call-by-name, call-by-value, and the \u03bb-calculus. TCS, 1:125\u2013159, 1975.","journal-title":"TCS"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(92)90297-S","volume":"102","author":"S. Bakel van","year":"1992","unstructured":"S. van Bakel. Complete restrictions of the intersection type discipline. TCS, 102:135\u2013163, 1992.","journal-title":"TCS"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/0205036","volume":"5","author":"C. P. Wadsworth","year":"1976","unstructured":"C. P. Wadsworth. The relation between computational and denotational properties for scott's D\u221e-models of the lambda calaulus. SIAM J. Computing, 5:488\u2013521, 1976.","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T22:23:24Z","timestamp":1627424604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0052378","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}