{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:33Z","timestamp":1761610353967,"version":"build-2065373602"},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)01134-5","type":"journal-article","created":{"date-parts":[[2005,4,8]],"date-time":"2005-04-08T09:19:45Z","timestamp":1112951985000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Proof Assistance for Refinement in Type Theory"],"prefix":"10.1016","volume":"37","author":[{"given":"Nikos","family":"Mylonakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)01134-5_bib1","unstructured":"Michel Bidoit, Mar\u00eda Victoria Cengarle, and Rolf Hennicker. Proof systems for structured specifications and their refinements. Chapter 11 of the book Algebraic Foundations of Systems Specification."},{"key":"10.1016\/S1571-0661(05)01134-5_bib2","unstructured":"Healfdene Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, University of Edinburgh, September 1994. Also published as Technical Report CST-110\u201394, Department of Computer Science."},{"issue":"1","key":"10.1016\/S1571-0661(05)01134-5_bib3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/147508.147524","article-title":"INSTITUTIONS: Abstract model theory for specification and programming","volume":"39","author":"Goguen","year":"1992","journal-title":"Journal of the Assoc. for Computing Machinery"},{"issue":"1","key":"10.1016\/S1571-0661(05)01134-5_bib4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/138027.138060","article-title":"A framework for defining logics","volume":"40","author":"Harper","year":"1993","journal-title":"Journal of the Association for Computing Machinery"},{"year":"1997","series-title":"Structured Specifications with Behavioural Operators: Semantics, Proof Methods and Applications","author":"Hennicker","key":"10.1016\/S1571-0661(05)01134-5_bib5"},{"year":"1994","series-title":"Computation and Reasoning: A Type Theory for Computer Science","author":"Luo","key":"10.1016\/S1571-0661(05)01134-5_bib6"},{"key":"10.1016\/S1571-0661(05)01134-5_bib7","doi-asserted-by":"crossref","unstructured":"James Hugh McKinna. Deliverables: A Categorical Approach to Program Development in Type Theory. PhD thesis, University of Edinburgh, November 1992.","DOI":"10.1007\/3-540-57182-5_3"},{"key":"10.1016\/S1571-0661(05)01134-5_bib8","unstructured":"Nikos Mylonakis. Adequate encodings of proof systems for algebraic specifications in UTT. CADE-13 Workshop on Proof Search in Type-Theoretic Languages, 1996."},{"key":"10.1016\/S1571-0661(05)01134-5_bib9","unstructured":"Nikos Mylonakis. A type-theoretic approach to proof support for algebraic design frameworks. PhD thesis, Universitat Polit\u00e8cnica de Catalunya, 2000. To appear."},{"key":"10.1016\/S1571-0661(05)01134-5_bib10","doi-asserted-by":"crossref","unstructured":"Don Sannella and Martin Wirsing. A kernel language for algebraic specification and implementation. In Proc. Intl. Conf. on Foundations of Computation Theory, Borgholm, Sweden, number 158 in Springer LNCS, pages 413\u201327, 1983.","DOI":"10.1007\/3-540-12689-9_122"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011345?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011345?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:35Z","timestamp":1761609995000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105011345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":10,"alternative-id":["S1571066105011345"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)01134-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Proof Assistance for Refinement in Type Theory","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)01134-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier Science B.V. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}