{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:42Z","timestamp":1725484662195},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425540"},{"type":"electronic","value":"9783540448020"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44802-0_28","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:15:38Z","timestamp":1180671338000},"page":"399-414","source":"Crossref","is-referenced-by-count":1,"title":["Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic"],"prefix":"10.1007","author":[{"given":"Yohji","family":"Akama","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"28_CR1","unstructured":"H.P. Barendregt. The Lambda Calculus. 1984."},{"key":"28_CR2","unstructured":"S. Berardi. Classical logic as limit completion I&II, submitted, 2001."},{"key":"28_CR3","first-page":"339","volume-title":"Logic and algebra (Pontignano, 1994)","author":"A. Berarducci","year":"1996","unstructured":"A. Berarducci. Infinite \u03bb-calculus and non-sensible models. In Logic and algebra (Pontignano, 1994), pp. 339\u2013377. Dekker, New York, 1996."},{"issue":"2","key":"28_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1005073330585","volume":"61","author":"K. Fujita","year":"1998","unstructured":"K. Fujita. On proof terms and embeddings of classical substructural logics. Studia Logica, 61(2):199\u2013221, 1998.","journal-title":"Studia Logica"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"28","DOI":"10.2307\/2270580","volume":"30","author":"E. M. Gold","year":"1965","unstructured":"E. Mark Gold. Limiting recursion. JSL, 30:28\u201348, 1965.","journal-title":"JSL"},{"key":"28_CR6","series-title":"Lect Notes Comput Sci","volume-title":"TYPES2000","author":"S. Hayashi","year":"2001","unstructured":"S. Hayashi and M. Nakata. Towards limit computable mathematics. In TYPES2000, LNCS. Springer, 2001."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"S. Hayashi, R. Sumitomo, and K. Shii. Towards animation of proofs-testing proofs by examples-. TCS, 2001. to appear.","DOI":"10.1016\/S0304-3975(00)00350-9"},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","volume":"175","author":"J.R. Kennaway","year":"1997","unstructured":"J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Infinitary lambda calculus. TCS, 175(1):93\u2013125, 1997.","journal-title":"TCS"},{"key":"28_CR9","unstructured":"M. Nakata and S. Hayashi. Limiting first order realizability interpretation. Sci. Math. Japonicae, 2001. to appear."},{"key":"28_CR10","unstructured":"M. Parigot. \u03bb\u00b5-calculus: an algorithmic interpretation of classical natural deduction. In Logic programming and automated reasoning. Springer, 1992."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"H. Schwichtenberg and S. S. Wainer. Infinite terms and recursion in higher types. In J. Diller and G. H. M\u00fcller, eds., =ISILC Proof Theory Symposion, pp. 341\u2013364. LNM., Vol. 500, 1975. Springer.","DOI":"10.1007\/BFb0079561"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"R. I. Soare. Recursively Enumerable Sets and Degrees Springer, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"issue":"6","key":"28_CR13","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1017\/S0956796898003141","volume":"8","author":"Th. Streicher","year":"1998","unstructured":"Th. Streicher and B. Reus. Classical logic, continuation semantics and abstract machines. J. Funct. Programming, 8(6):543\u2013572, 1998.","journal-title":"J. Funct. Programming"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1147\/rd.126.0465","volume":"12","author":"H.R. Strong","year":"1968","unstructured":"H.R. Strong. Algebraically generalized recursive function theory. IBM Journal of Research and Development, 12:465\u2013475, 1968.","journal-title":"IBM Journal of Research and Development"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"W.W. Tait. Infinitely long terms of transfinite type. In Crossley and Dummet, eds., Formal Systems and Recursive Functions, pp. 176\u2013185. North-Holland, 1965.","DOI":"10.1016\/S0049-237X(08)71689-6"},{"key":"28_CR16","unstructured":"A. S. Troelstra and D. van Dalen. Constructivism in Mathematics, 1988."},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995267","volume":"144","author":"E. G. Wagner","year":"1969","unstructured":"E. G. Wagner. Uniformly reflexive structures: On the nature of G\u00f6delizations and relative computability. Trans. of the Amer. Math. Soc., 144:1\u201341, 1969.","journal-title":"Trans. of the Amer. Math. Soc."},{"key":"28_CR18","unstructured":"M. Yasugi, V. Brattka, and M. Washihara. Computability aspects of some discontinuous functions. http:\/\/www.kyoto-su.ac.jp\/~yasugi\/Recent\/gaussnew.ps , 2001."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44802-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T03:47:23Z","timestamp":1683863243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44802-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425540","9783540448020"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44802-0_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}