{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:38:45Z","timestamp":1761590325188,"version":"build-2065373602"},"reference-count":36,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4337,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic and Algebraic Programming"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s1567-8326(01)00006-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:02:01Z","timestamp":1027591321000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Formalizing non-termination of recursive programs"],"prefix":"10.1016","volume":"49","author":[{"given":"Reinhard","family":"Kahle","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Studer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1998","author":"Amadio","series-title":"Domains and Lambda-Calculi","key":"10.1016\/S1567-8326(01)00006-6_BIB1"},{"year":"1984","author":"Barendregt","series-title":"The Lambda Calculus","key":"10.1016\/S1567-8326(01)00006-6_BIB2"},{"year":"1985","author":"Beeson","series-title":"Foundations of Constructive Mathematics: Metamathematical Studies","key":"10.1016\/S1567-8326(01)00006-6_BIB3"},{"unstructured":"H. Curry, J. Hindley, J. Seldin, Combinatory Logic, vol. II, North-Holland, Amsterdam, 1972","key":"10.1016\/S1567-8326(01)00006-6_BIB4"},{"doi-asserted-by":"crossref","unstructured":"S. Feferman, A language and axioms for explicit mathematics, in: J.N. Crossley (Ed.), Algebra and Logic, Lecture Notes in Mathematics, vol. 450, Springer, Berlin, 1975, pp. 87\u2013139","key":"10.1016\/S1567-8326(01)00006-6_BIB5","DOI":"10.1007\/BFb0062852"},{"key":"10.1016\/S1567-8326(01)00006-6_BIB6","series-title":"Logic Colloquium '78","first-page":"159","article-title":"Constructive theories of functions and classes","author":"Feferman","year":"1979"},{"doi-asserted-by":"crossref","unstructured":"S. Feferman, Polymorphic typed lambda-calculi in a type-free axiomatic framework, in: W. Sieg (Ed.), Logic and Computation, Contemporary Mathematics, vol.\u00a0106, American Mathematical Society, Providence, RI, 1990, pp. 101\u2013136","key":"10.1016\/S1567-8326(01)00006-6_BIB7","DOI":"10.1090\/conm\/106\/1057818"},{"doi-asserted-by":"crossref","unstructured":"S. Feferman, Logics for termination and correctness of functional programs, in: Y.N. Moschovakis (Ed.), Logic from Computer Science, MSRI Publications, vol. 21, Springer, Berlin, 1991, pp. 95\u2013127","key":"10.1016\/S1567-8326(01)00006-6_BIB8","DOI":"10.1007\/978-1-4612-2822-6_5"},{"key":"10.1016\/S1567-8326(01)00006-6_BIB9","series-title":"Proof Theory","first-page":"195","article-title":"Logics for termination and correctness of functional programs II: Logics of strength PRA","author":"Feferman","year":"1992"},{"doi-asserted-by":"crossref","unstructured":"S. Feferman, A new approach to abstract data types II: computation on ADTs as ordinary computations, in: E. B\u00f6rger, G. J\u00e4ger, H. Kleine B\u00fcning, M.M. Richter (Eds.), Computer Science Logic '91, Lecture Notes in Computer Science, vol. 626, Springer, Berlin, 1992, pp. 79\u201395","key":"10.1016\/S1567-8326(01)00006-6_BIB10","DOI":"10.1007\/BFb0023759"},{"issue":"3","key":"10.1016\/S1567-8326(01)00006-6_BIB11","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0168-0072(93)90013-4","article-title":"Systems of explicit mathematics with non-constructive \u03bc-operator. Part I","volume":"65","author":"Feferman","year":"1993","journal-title":"Annals of Pure and Applied Logic"},{"unstructured":"S. Finn, M.P. Fourman, Logic Manual for the LAMBDA System 3.2. Abstract Hardware Ltd., November 1990","key":"10.1016\/S1567-8326(01)00006-6_BIB12"},{"unstructured":"M. Francis, S. Finn, E. Mayger, Reference Manual for the LAMBDA System 3.2. Abstract Hardware Ltd., 1990","key":"10.1016\/S1567-8326(01)00006-6_BIB13"},{"year":"1986","author":"Hindley","series-title":"Introduction to Combinators and \u03bb-Calculus","key":"10.1016\/S1567-8326(01)00006-6_BIB14"},{"doi-asserted-by":"crossref","unstructured":"G. J\u00e4ger, R. Kahle, T. Strahm, On applicative theories, in: A. Cantini, E. Casari, P. Minari (Eds.), Logic and Foundations of Mathematics, Kluwer, Dordrecht, 1999, pp. 83\u201392","key":"10.1016\/S1567-8326(01)00006-6_BIB15","DOI":"10.1007\/978-94-017-2109-7_6"},{"year":"1997","author":"Jones","series-title":"Computability and Complexity","key":"10.1016\/S1567-8326(01)00006-6_BIB16"},{"unstructured":"R. Kahle, Einbettung des Beweissystems Lambda in eine Theorie von Operationen und Zahlen. Diplomarbeit, Mathematisches Institut der Universit\u00e4t M\u00fcnchen, 1992","key":"10.1016\/S1567-8326(01)00006-6_BIB17"},{"unstructured":"R. Kahle, Applikative Theorien und Frege-Strukturen, Dissertation, Institut f\u00fcr Informatik und angewandte Mathematik, Universit\u00e4t Bern, 1997","key":"10.1016\/S1567-8326(01)00006-6_BIB18"},{"issue":"2","key":"10.1016\/S1567-8326(01)00006-6_BIB19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s001530050007","article-title":"N-strictness in applicative theories","volume":"39","author":"Kahle","year":"2000","journal-title":"Archive for Mathematical Logic"},{"doi-asserted-by":"crossref","unstructured":"R. Kahle, T. Studer, A theory of explicit mathematics equivalent to ID1, in: P. Clote, H. Schwichtenberg (Eds.), Computer Science Logic CSL 2000, Lecture Notes in Computer Science, vol. 1862, Springer, Berlin, 2000, pp. 356\u2013370","key":"10.1016\/S1567-8326(01)00006-6_BIB20","DOI":"10.1007\/3-540-44622-2_24"},{"year":"1974","author":"Manna","series-title":"Mathematical Theory of Computation","key":"10.1016\/S1567-8326(01)00006-6_BIB21"},{"year":"1996","author":"Mitchell","series-title":"Foundations for Programming Languages","key":"10.1016\/S1567-8326(01)00006-6_BIB22"},{"year":"1974","author":"Moschovakis","series-title":"Elementary Induction on Abstract Structures","key":"10.1016\/S1567-8326(01)00006-6_BIB23"},{"doi-asserted-by":"crossref","unstructured":"W. Pohlers, Proof Theory, Lecture Notes in Mathematics, vol. 1407, Springer, Berlin, 1989","key":"10.1016\/S1567-8326(01)00006-6_BIB24","DOI":"10.1007\/978-3-540-46825-7"},{"year":"1989","author":"Reade","series-title":"Elements of Functional Programming","key":"10.1016\/S1567-8326(01)00006-6_BIB25"},{"year":"1986","author":"Schmidt","series-title":"Denotational Semantics","key":"10.1016\/S1567-8326(01)00006-6_BIB26"},{"doi-asserted-by":"crossref","unstructured":"D.S. Scott, A type-theoretical alternative to ISWIM, CUCH, OWHY. Manuscript, 1969. Later published in Theoretical Computer Science 121 (1993) 411\u2013440","key":"10.1016\/S1567-8326(01)00006-6_BIB27","DOI":"10.1016\/0304-3975(93)90095-B"},{"doi-asserted-by":"crossref","unstructured":"R. St\u00e4rk, Call-by-value, call-by-name and the logic of values, in: D. van Dalen, M. Bezem (Eds.), Computer Science Logic '96, Lecture Notes in Computer Science, vol. 1258, Springer, Berlin, 1997, pp. 431\u2013445","key":"10.1016\/S1567-8326(01)00006-6_BIB28","DOI":"10.1007\/3-540-63172-0_54"},{"issue":"2","key":"10.1016\/S1567-8326(01)00006-6_BIB29","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1017\/S0956796898002974","article-title":"Why the constant `undefined'? Logics of partial terms for strict, and non-strict functional programming languages","volume":"8","author":"St\u00e4rk","year":"1998","journal-title":"Journal of Functional Programming"},{"unstructured":"T. Studer, Constructive foundations for Featherweight Java, preprint","key":"10.1016\/S1567-8326(01)00006-6_BIB30"},{"unstructured":"T. Studer, Impredicative overloading in explicit mathematics, submitted","key":"10.1016\/S1567-8326(01)00006-6_BIB31"},{"unstructured":"T. Studer, A semantics for \u03bbstr{}: a calculus with overloading and late-binding, Journal of Logic and Computation, to appear","key":"10.1016\/S1567-8326(01)00006-6_BIB32"},{"unstructured":"T. Studer, The Mathematics of Objects, Dissertation, Institut f\u00fcr Informatik und angewandte Mathematik, Universit\u00e4t Bern, 2001","key":"10.1016\/S1567-8326(01)00006-6_BIB33"},{"unstructured":"A. Sjerp Troelstra, D. van Dalen, Constructivism in Mathematics, vol II, North-Holland, Amsterdam, 1988","key":"10.1016\/S1567-8326(01)00006-6_BIB34"},{"year":"1991","author":"Turner","series-title":"Constructive Foundations for Functional Languages","key":"10.1016\/S1567-8326(01)00006-6_BIB35"},{"issue":"1","key":"10.1016\/S1567-8326(01)00006-6_BIB36","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/logcom\/6.1.5","article-title":"Weak theories of operations and types","volume":"6","author":"Turner","year":"1996","journal-title":"Journal of Logic and Computation"}],"container-title":["The Journal of Logic and Algebraic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832601000066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832601000066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:33:30Z","timestamp":1761590010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1567832601000066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":36,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S1567832601000066"],"URL":"https:\/\/doi.org\/10.1016\/s1567-8326(01)00006-6","relation":{},"ISSN":["1567-8326"],"issn-type":[{"type":"print","value":"1567-8326"}],"subject":[],"published":{"date-parts":[[2001,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Formalizing non-termination of recursive programs","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic and Algebraic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1567-8326(01)00006-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}