{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T20:05:08Z","timestamp":1780430708255,"version":"3.54.1"},"reference-count":85,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["MCIN\/AEI\/10.13039\/501100011033"],"award-info":[{"award-number":["MCIN\/AEI\/10.13039\/501100011033"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014849","name":"Valencia Department of Education Culture and Sport","doi-asserted-by":"publisher","award":["CIPROM\/2022\/6"],"award-info":[{"award-number":["CIPROM\/2022\/6"]}],"id":[{"id":"10.13039\/501100014849","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003359","name":"Generalitat Valenciana","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003359","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Gobierno de Espa\u00f1a Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Logical and Algebraic Methods in Programming"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.jlamp.2026.101112","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T17:26:44Z","timestamp":1772558804000},"page":"101112","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Should computations halt?"],"prefix":"10.1016","volume":"150","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9923-2108","authenticated-orcid":false,"given":"Salvador","family":"Lucas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.jlamp.2026.101112_bib0001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/421139","article-title":"Hilbert\u2019s programs: 1917\u20131922","volume":"5","author":"Sieg","year":"1999","journal-title":"Bull. Symb. Log."},{"key":"10.1016\/j.jlamp.2026.101112_bib0002","series-title":"The Stanford Encyclopedia of Philosophy","article-title":"Hilbert\u2019s program","author":"Zach","year":"2023"},{"key":"10.1016\/j.jlamp.2026.101112_bib0003","series-title":"From Frege to G\u00f6del. a Source Book in Mathematical Logic","first-page":"464","article-title":"The foundations of mathematics (1927)","author":"Hilbert","year":"1967"},{"key":"10.1016\/j.jlamp.2026.101112_bib0004","article-title":"Grundz\u00fcge der Theoretischen Logik","author":"Hilbert","year":"1928"},{"key":"10.1016\/j.jlamp.2026.101112_bib0005","series-title":"Philosophy of Mathematics","first-page":"535","article-title":"On computability","author":"Sieg","year":"2009"},{"key":"10.1016\/j.jlamp.2026.101112_bib0006","series-title":"David Hilbert\u2019s Lectures On the Foundations of Arithmetic and Logic, 1917\u20131933","author":"Ewald","year":"2013"},{"key":"10.1016\/j.jlamp.2026.101112_bib0007","series-title":"A Half-Century Survey on the Universal Turing Machine","first-page":"55","article-title":"The confluence of ideas in 1936","author":"Gandy","year":"1988"},{"key":"10.1016\/j.jlamp.2026.101112_bib0008","series-title":"Mathematische probleme","first-page":"253","author":"Hilbert","year":"1900"},{"key":"10.1016\/j.jlamp.2026.101112_bib0009","series-title":"A history of computing technology (2. ed.)","author":"Williams","year":"1997"},{"key":"10.1016\/j.jlamp.2026.101112_bib0010","series-title":"2006IEEE John Vincent Atanasoff International Symposium on Modern Computing (JVA2006), 3\u20136 October 2006, Sofia, Bulgaria","first-page":"3","article-title":"What does it mean to be the first computer?","author":"Williams","year":"2006"},{"issue":"1","key":"10.1016\/j.jlamp.2026.101112_bib0011","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/BF01565439","article-title":"General recursive functions of natural numbers","volume":"112","author":"Kleene","year":"1936","journal-title":"Math.e Ann."},{"key":"10.1016\/j.jlamp.2026.101112_bib0012","series-title":"Kurt G\u00f6del Collected Works Volume I: Publications 1929\u20131936","first-page":"346","article-title":"On undecidable propositions of formal mathematical systems (1934)","author":"Feferman","year":"2001"},{"key":"10.1016\/j.jlamp.2026.101112_bib0013","first-page":"332","article-title":"An unsolvable problem of elementary number theory. preliminary report (abstract)","volume":"41","author":"Church","year":"1935","journal-title":"Bull.e AMS"},{"key":"10.1016\/j.jlamp.2026.101112_bib0014","doi-asserted-by":"crossref","first-page":"345","DOI":"10.2307\/2371045","article-title":"An unsolvable problem of elementary number theory","volume":"58","author":"Church","year":"1936","journal-title":"Am. J. Math."},{"issue":"3","key":"10.1016\/j.jlamp.2026.101112_bib0015","doi-asserted-by":"crossref","first-page":"284","DOI":"10.2307\/420992","article-title":"Computability and recursion","volume":"2","author":"Soare","year":"1996","journal-title":"Bull. Symb. Log."},{"issue":"1","key":"10.1016\/j.jlamp.2026.101112_bib0016","doi-asserted-by":"crossref","first-page":"42","DOI":"10.2307\/2268808","volume":"2","author":"Church","year":"1937","journal-title":"J Symb. Log."},{"key":"10.1016\/j.jlamp.2026.101112_bib0017","first-page":"230","article-title":"On computable numbers, with an application to the entscheindungsproblem","volume":"42","author":"Turing","year":"1936","journal-title":"Proc. London Math. Soc."},{"issue":"3","key":"10.1016\/j.jlamp.2026.101112_bib0018","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2307\/2269031","article-title":"Finite combinatory processes-formulation i","volume":"1","author":"Post","year":"1936","journal-title":"J. Symb. Log."},{"key":"10.1016\/j.jlamp.2026.101112_bib0019","article-title":"Post\u2019s Machine","author":"Uspensky","year":"1983"},{"key":"10.1016\/j.jlamp.2026.101112_bib0020","article-title":"The origins of the halting problem","volume":"121","author":"Lucas","year":"2021","journal-title":"J. Log. Algebraic Methods Program."},{"key":"10.1016\/j.jlamp.2026.101112_bib0021","series-title":"The Essential Turing","author":"Copeland","year":"2004"},{"key":"10.1016\/j.jlamp.2026.101112_bib0022","series-title":"The Annotated Turing: A Guided Tour Through Alan Turing\u2019s Historic Paper on Computability and the Turing Machine","author":"Petzold","year":"2008"},{"key":"10.1016\/j.jlamp.2026.101112_bib0023","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/j.jlamp.2026.101112_bib0024","series-title":"Computability and Unsolvability","author":"Davis","year":"1958"},{"key":"10.1016\/j.jlamp.2026.101112_bib0025","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF01457115","article-title":"Axiomatisches Denken","volume":"78","author":"Hilbert","year":"1917","journal-title":"Math. Ann."},{"issue":"10","key":"10.1016\/j.jlamp.2026.101112_bib0026","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1090\/S0002-9904-1902-00923-3","article-title":"Mathematical Problems","volume":"8","author":"Hilbert","year":"1902","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/j.jlamp.2026.101112_bib0027","series-title":"From Kant to Hilbert Volume 2","author":"Ewald","year":"1996"},{"key":"10.1016\/j.jlamp.2026.101112_bib0028","series-title":"Grundlagen der Mathematik","author":"Hilbert","year":"1934"},{"key":"10.1016\/j.jlamp.2026.101112_bib0029","series-title":"From Frege to G\u00f6del. a Source Book in Mathematical Logic","first-page":"367","article-title":"On the infinite (1925)","author":"Hilbert","year":"1967"},{"key":"10.1016\/j.jlamp.2026.101112_bib0030","series-title":"Grundlagen der Mathematik II","author":"Hilbert","year":"1939"},{"issue":"9","key":"10.1016\/j.jlamp.2026.101112_bib0031","doi-asserted-by":"crossref","first-page":"524","DOI":"10.2307\/2026089","article-title":"Finitism","volume":"78","author":"Tait","year":"1981","journal-title":"J. Philos."},{"key":"10.1016\/j.jlamp.2026.101112_bib0032","series-title":"Philosophy of Logic and Mathematics: Proceedings of the 41st International Ludwig Wittgenstein Symposium","first-page":"249","article-title":"What hilbert and bernays meant by \u201cFinitism\u201d","author":"Tait","year":"2018"},{"key":"10.1016\/j.jlamp.2026.101112_bib0033","first-page":"22","article-title":"\u00dcber unendliche Zeichenreihen","volume":"7","author":"Thue","year":"1906","journal-title":"Skr. Vid. Kristiania, I Mat. Natuv. Klasse"},{"key":"10.1016\/j.jlamp.2026.101112_bib0034","first-page":"40","article-title":"Die L\u00f6sung eines spezialfalles eines generellen logischen problems","volume":"8","author":"Thue","year":"1910","journal-title":"Skr. Vid. Kristiania, I Mat. Natuv. Klasse."},{"key":"10.1016\/j.jlamp.2026.101112_bib0035","first-page":"67","article-title":"\u00dcber die gegenseitige lage gleicher teile gewisser zeichenreihen","volume":"1","author":"Thue","year":"1912","journal-title":"Skr. Vid. Kristiania, I Mat. Natuv. Klasse."},{"key":"10.1016\/j.jlamp.2026.101112_bib0036","first-page":"34","article-title":"Probleme \u00dcber Ver\u00e4nderungen von zeichenreihen nach gegebenen regeln","volume":"10","author":"Thue","year":"1914","journal-title":"Skr. Vid. Kristiania, I Mat. Natuv. Klasse."},{"key":"10.1016\/j.jlamp.2026.101112_bib0037","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0041-0","article-title":"Algebra","author":"Lang","year":"2002"},{"key":"10.1016\/j.jlamp.2026.101112_bib0038","first-page":"1","article-title":"Axel Thue\u2019s work on repetitions in words","volume":"20","author":"Berstel","year":"1995","journal-title":"S\u00e9ries formelles et combinatoire alg\u00e9brique"},{"key":"10.1016\/j.jlamp.2026.101112_bib0039","series-title":"String-rewriting systems","author":"Book","year":"1993"},{"key":"10.1016\/j.jlamp.2026.101112_bib0040","article-title":"Thue\u2019s 1914 paper: a translation","volume":"abs\/1308.5858","author":"Power","year":"2013","journal-title":"CoRR"},{"key":"10.1016\/j.jlamp.2026.101112_bib0041","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5695-3","article-title":"Selected Writings on Computing: A Personal Perspective","author":"Dijkstra","year":"1982"},{"key":"10.1016\/j.jlamp.2026.101112_bib0042","series-title":"18Th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October - 1 November 1977","first-page":"30","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","author":"Huet","year":"1977"},{"key":"10.1016\/j.jlamp.2026.101112_bib0043","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"issue":"1","key":"10.1016\/j.jlamp.2026.101112_bib0044","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2267170","article-title":"Recursive unsolvability of a problem of thue","volume":"12","author":"Post","year":"1947","journal-title":"J. Symb. Log."},{"key":"10.1016\/j.jlamp.2026.101112_bib0045","series-title":"Was sind und was sollen die Zahlen","author":"Dedekind","year":"1918"},{"issue":"1","key":"10.1016\/j.jlamp.2026.101112_bib0046","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01700692","article-title":"\u00dcber formal unentscheidbare S\u00e4tze der principia mathematica und verwandter systeme i","volume":"38","author":"G\u00f6del","year":"1931","journal-title":"Monatshefte f\u00fcr Math. Phys."},{"key":"10.1016\/j.jlamp.2026.101112_bib0047","series-title":"On Hilbert\u2019s Construction of the Real Numbers","first-page":"493","article-title":"The foundations of mathematics (1927)","author":"Ackermann","year":"1967"},{"key":"10.1016\/j.jlamp.2026.101112_bib0048","first-page":"1","article-title":"Sur la non-contradiction de l\u2019arithmetique","volume":"166","author":"Herbrand","year":"1932","journal-title":"J. f\u00fcr die reine und Angew. Math."},{"issue":"2","key":"10.1016\/j.jlamp.2026.101112_bib0049","doi-asserted-by":"crossref","first-page":"346","DOI":"10.2307\/1968337","article-title":"A set of postulates for the foundation of logic","volume":"33","author":"Church","year":"1932","journal-title":"Ann. Math."},{"key":"10.1016\/j.jlamp.2026.101112_bib0050","series-title":"Introduction to Combinators and Lambda-Calculus","author":"Hindley","year":"1986"},{"issue":"4","key":"10.1016\/j.jlamp.2026.101112_bib0051","doi-asserted-by":"crossref","first-page":"839","DOI":"10.2307\/1968702","article-title":"A set of postulates for the foundation of logic. (second paper)","volume":"34","author":"Church","year":"1933","journal-title":"Ann. Math."},{"issue":"4","key":"10.1016\/j.jlamp.2026.101112_bib0052","doi-asserted-by":"crossref","first-page":"153","DOI":"10.2307\/2268280","article-title":"Computability and \u03bb-Definability","volume":"2","author":"Turing","year":"1937","journal-title":"J. Symb. Log."},{"issue":"3","key":"10.1016\/j.jlamp.2026.101112_bib0053","doi-asserted-by":"crossref","first-page":"529","DOI":"10.2307\/1968749","article-title":"Proof by cases in formal logic","volume":"35","author":"Kleene","year":"1934","journal-title":"Ann. Math."},{"key":"10.1016\/j.jlamp.2026.101112_bib0054","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1215\/S0012-7094-36-00227-2","article-title":"\u03bb-Definability and recursiveness","volume":"2","author":"Kleene","year":"1936","journal-title":"Duke Math. J."},{"issue":"4","key":"10.1016\/j.jlamp.2026.101112_bib0055","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/comjnl\/7.4.313","article-title":"An impossible program","volume":"7","author":"Strachey","year":"1965","journal-title":"Comput. J."},{"key":"10.1016\/j.jlamp.2026.101112_bib0056","series-title":"Computability, Complexity, and Languages. Fundamentals of Theoretical Computer Science","author":"Davis","year":"1983"},{"key":"10.1016\/j.jlamp.2026.101112_bib0057","series-title":"What is a Computation?","first-page":"241","author":"Davis","year":"1978"},{"issue":"4","key":"10.1016\/j.jlamp.2026.101112_bib0058","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2267778","article-title":"On notation for ordinal numbers","volume":"3","author":"Kleene","year":"1938","journal-title":"J.Symb. Log."},{"issue":"2","key":"10.1016\/j.jlamp.2026.101112_bib0059","doi-asserted-by":"crossref","first-page":"197","DOI":"10.2307\/2371809","article-title":"Formal reductions of the general combinatorial decision problem","volume":"65","author":"Post","year":"1943","journal-title":"Am. J. Math."},{"key":"10.1016\/j.jlamp.2026.101112_bib0060","series-title":"Semantics of Concurrent Computation, Proceedings of the International Symposium, Evian, France, July 2\u20134, 1979","first-page":"285","article-title":"An extensional treatment of dataflow deadlock","volume":"70","author":"Wadge","year":"1979"},{"key":"10.1016\/j.jlamp.2026.101112_bib0061","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(81)90108-0","article-title":"An extensional treatment of dataflow deadlock","volume":"13","author":"Wadge","year":"1981","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jlamp.2026.101112_bib0062","series-title":"Semantics and Pragmatics of the \u03bb-calculus","author":"Wadsworth","year":"1971"},{"key":"10.1016\/j.jlamp.2026.101112_bib0063","series-title":"Communicating and mobile systems - the Pi-calculus","author":"Milner","year":"1999"},{"issue":"2","key":"10.1016\/j.jlamp.2026.101112_bib0064","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1177\/026839628700200202","article-title":"Is computing an experimental science?","volume":"2","author":"Milner","year":"1987","journal-title":"J. Inf. Technol."},{"key":"10.1016\/j.jlamp.2026.101112_bib0065","series-title":"Some extensional term models for combinatory logics and \u03bb-calculi","author":"Barendregt","year":"1971"},{"key":"10.1016\/j.jlamp.2026.101112_bib0066","article-title":"The lambda calculus - its syntax and semantics","volume":"103","author":"Barendregt","year":"1985"},{"key":"10.1016\/j.jlamp.2026.101112_bib0067","series-title":"Theoretical Aspects of Computer Software, International Conference TACS \u201994, Sendai, Japan, April 19\u201322, 1994, Proceedings","first-page":"543","article-title":"Syntactic definitions of undefined: on defining the undefined","volume":"789","author":"Ariola","year":"1994"},{"key":"10.1016\/j.jlamp.2026.101112_bib0068","series-title":"Algebraic and Logic Programming, 5Th International Conference, ALP\u201996, Aachen, Germany, September 25\u201327, 1996, Proceedings","first-page":"254","article-title":"Meaningless terms in rewriting","volume":"1139","author":"Kennaway","year":"1996"},{"issue":"1","key":"10.1016\/j.jlamp.2026.101112_bib0069","article-title":"Meaningless terms in rewriting","volume":"1999","author":"Kennaway","year":"1999","journal-title":"J. Funct. Log. Program."},{"issue":"5","key":"10.1016\/j.jlamp.2026.101112_bib0070","first-page":"1","article-title":"Report on the programming language haskell, a non-strict, purely functional language","volume":"27","author":"Hudak","year":"1992","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/j.jlamp.2026.101112_bib0071","article-title":"Elements of functional programming","author":"Reade","year":"1989"},{"key":"10.1016\/j.jlamp.2026.101112_bib0072","series-title":"Introduction to Lattices and Order, Second Edition","author":"Davey","year":"2002"},{"key":"10.1016\/j.jlamp.2026.101112_bib0073","article-title":"Semantics of programming languages - structures and techniques","author":"Gunter","year":"1993"},{"key":"10.1016\/j.jlamp.2026.101112_bib0074","series-title":"The Formal Semantics Of Programming Languages. An Introduction","author":"Winskel","year":"1993"},{"issue":"3","key":"10.1016\/j.jlamp.2026.101112_bib0075","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.jlamp.2026.101112_bib0076","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1145\/69558.69563","article-title":"On the productivity of recursive list definitions","volume":"11","author":"Sijtsma","year":"1989","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/j.jlamp.2026.101112_bib0077","series-title":"Term Rewriting and All That","author":"Baader","year":"1998"},{"key":"10.1016\/j.jlamp.2026.101112_bib0078","article-title":"Term rewriting systems","volume":"55","author":"Terese","year":"2003"},{"issue":"4\u20135","key":"10.1016\/j.jlamp.2026.101112_bib0079","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/j.tcs.2009.10.014","article-title":"Productivity of stream definitions","volume":"411","author":"Endrullis","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jlamp.2026.101112_bib0080","series-title":"Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15\u201317, 2008, Proceedings","first-page":"441","article-title":"Normalization of infinite terms","volume":"5117","author":"Zantema","year":"2008"},{"key":"10.1016\/j.jlamp.2026.101112_bib0081","series-title":"Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010, July 11\u201313, 2010, Edinburgh, Scottland, UK","first-page":"401","article-title":"Proving productivity in infinite data structures","volume":"6","author":"Zantema","year":"2010"},{"issue":"1","key":"10.1016\/j.jlamp.2026.101112_bib0082","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1006\/inco.1995.1075","article-title":"Transfinite reductions in orthogonal term rewriting systems","volume":"119","author":"Kennaway","year":"1995","journal-title":"Inf. Comput."},{"key":"10.1016\/j.jlamp.2026.101112_bib0083","series-title":"Mathematical Theory of Computation","author":"Manna","year":"2003"},{"key":"10.1016\/j.jlamp.2026.101112_bib0084","series-title":"Introduction to the theory of computation, Third Edition","author":"Sipser","year":"2013"},{"key":"10.1016\/j.jlamp.2026.101112_bib0085","series-title":"The Hilbert Challenge","author":"Gray","year":"2000"}],"container-title":["Journal of Logical and Algebraic Methods in Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220826000040?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220826000040?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T19:25:11Z","timestamp":1780428311000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2352220826000040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":85,"alternative-id":["S2352220826000040"],"URL":"https:\/\/doi.org\/10.1016\/j.jlamp.2026.101112","relation":{},"ISSN":["2352-2208"],"issn-type":[{"value":"2352-2208","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Should computations halt?","name":"articletitle","label":"Article Title"},{"value":"Journal of Logical and Algebraic Methods in Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jlamp.2026.101112","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author. Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"101112"}}