{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T16:09:15Z","timestamp":1762445355644,"version":"build-2065373602"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T00:00:00Z","timestamp":1758153600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1016\/j.tcs.2025.115550","type":"journal-article","created":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T06:54:30Z","timestamp":1757660070000},"page":"115550","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The Grothendieck computability model"],"prefix":"10.1016","volume":"1057","author":[{"given":"Luis","family":"Gambarte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iosif","family":"Petrakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"2010","series-title":"Categories and Computability","author":"Cockett","key":"10.1016\/j.tcs.2025.115550_bib0001"},{"issue":"2-3","key":"10.1016\/j.tcs.2025.115550_bib0002","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.apal.2008.04.005","article-title":"Introduction to Turing categories","volume":"156","author":"Cockett","year":"2008","journal-title":"Ann. Pure Appl. Log."},{"issue":"10","key":"10.1016\/j.tcs.2025.115550_bib0003","doi-asserted-by":"crossref","first-page":"1835","DOI":"10.1016\/j.jpaa.2009.12.028","article-title":"Categorical simulations","volume":"214","author":"Cockett","year":"2010","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.tcs.2025.115550_bib0004","series-title":"Bachelor\u2019s Thesis","article-title":"2-dep-Categories","author":"Ehrhardt","year":"2024"},{"year":"2025","series-title":"Categories with a Base of Computability","author":"Gambarte","key":"10.1016\/j.tcs.2025.115550_bib0005"},{"issue":"CEUR-WS.org 2024","key":"10.1016\/j.tcs.2025.115550_bib0006","first-page":"16","article-title":"The Grothendieck Computability Model","volume":"3811","author":"Gambarte","year":"2024","journal-title":"CEUR Workshop Proceedings"},{"key":"10.1016\/j.tcs.2025.115550_bib0007","unstructured":"M. Hofmann, T. Streicher, The Groupoid Interpretation of Type Theory, in [22]83\u2013111."},{"year":"2002","series-title":"Sketches of an Elephant: A Topos Theory Compendium","author":"Johnstone","key":"10.1016\/j.tcs.2025.115550_bib0008"},{"key":"10.1016\/j.tcs.2025.115550_bib0009","series-title":"PhD Thesis","article-title":"Realizability Toposes and Language Semantics","author":"Longley","year":"1995"},{"issue":"5","key":"10.1016\/j.tcs.2025.115550_bib0010","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1017\/S0960129507006251","article-title":"On the ubiquity of certain total type structures","volume":"17","author":"Longley","year":"2007","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2025.115550_bib0011","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0960129513000182","article-title":"Computability structures, simulations and realizability","volume":"24","author":"Longley","year":"2014","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/j.tcs.2025.115550_bib0012","series-title":"Higher-Order Computability","first-page":"1","author":"Longley","year":"2015"},{"year":"2021","series-title":"Computability Models Over Categories","author":"Petrakis","key":"10.1016\/j.tcs.2025.115550_bib0013"},{"key":"10.1016\/j.tcs.2025.115550_bib0014","series-title":"Computability Models over Categories and Presheaves, Logical Foundations of Computer Science","volume":"13137","author":"Petrakis","year":"2022"},{"key":"10.1016\/j.tcs.2025.115550_bib0015","article-title":"Strict computability models over categories and presheaves","volume":"077","author":"Petrakis","year":"2022","journal-title":"J. Log. Comput."},{"year":"2023","series-title":"Categories with Dependent Arrows","author":"Petrakis","key":"10.1016\/j.tcs.2025.115550_bib0016"},{"year":"2025","series-title":"Categories with Dependent and Codependent Arrows","author":"Petrakis","key":"10.1016\/j.tcs.2025.115550_bib0017"},{"year":"2000","series-title":"Categorical logic","author":"Pitts","key":"10.1016\/j.tcs.2025.115550_bib0018"},{"key":"10.1016\/j.tcs.2025.115550_bib0019","series-title":"PhD Thesis","article-title":"Continuity and Effectiveness in Topoi","author":"Rosolini","year":"1986"},{"year":"2010","series-title":"Two-Sided Discrete Fibrations in 2-Categories and Bicategories","author":"Riehl","key":"10.1016\/j.tcs.2025.115550_bib0020"},{"year":"2016","series-title":"Category Theory in Context","author":"Riehl","key":"10.1016\/j.tcs.2025.115550_bib0021"},{"year":"1998","key":"10.1016\/j.tcs.2025.115550_bib0022","article-title":"Twenty-Five Years of Constructive Type Theory"},{"year":"2013","series-title":"The Univalent Foundations Program, Homotopy Type Theory: Univalent Foundations of Mathematics, Institute for Advanced Study","key":"10.1016\/j.tcs.2025.115550_bib0023"},{"key":"10.1016\/j.tcs.2025.115550_bib0024","series-title":"PhD Thesis","article-title":"The Grothendieck Construction in Enriched, Internal and \u221e-Category Theory","author":"Wong","year":"2019"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525004888?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525004888?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:59:59Z","timestamp":1762444799000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397525004888"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":24,"alternative-id":["S0304397525004888"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115550","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The Grothendieck computability model","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115550","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115550"}}