{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:59Z","timestamp":1761611219099},"reference-count":5,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":2036,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1016\/j.entcs.2007.09.022","type":"journal-article","created":{"date-parts":[[2008,3,3]],"date-time":"2008-03-03T20:35:55Z","timestamp":1204576555000},"page":"129-135","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Signature Compilation for the Edinburgh Logical Framework"],"prefix":"10.1016","volume":"196","author":[{"given":"Michael","family":"Zeller","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Stump","sequence":"additional","affiliation":[]},{"given":"Morgan","family":"Deters","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.entcs.2007.09.022_bib001","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"},{"key":"10.1016\/j.entcs.2007.09.022_bib002","doi-asserted-by":"crossref","unstructured":"G. Necula. Proof-Carrying Code. In 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 106\u2013119, January 1997","DOI":"10.1145\/263699.263712"},{"key":"10.1016\/j.entcs.2007.09.022_bib003","doi-asserted-by":"crossref","unstructured":"G. Necula and P. Lee. Efficient representation and validation of proofs. In 13th Annual IEEE Symposium on Logic in Computer Science, pages 93\u2013104, 1998","DOI":"10.1109\/LICS.1998.705646"},{"key":"10.1016\/j.entcs.2007.09.022_bib004","doi-asserted-by":"crossref","unstructured":"F. Pfenning and Carsten Sch\u00fcrmann. System Description: Twelf \u2014 A Meta-Logical Framework for Deductive Systems. In 16th International Conference on Automated Deduction, 1999","DOI":"10.1007\/3-540-48660-7_14"},{"key":"10.1016\/j.entcs.2007.09.022_bib005","doi-asserted-by":"crossref","unstructured":"A. Stump and D. Dill. Faster Proof Checking in the Edinburgh Logical Framework. In 18th International Conference on Automated Deduction, pages 392\u2013407, 2002","DOI":"10.1007\/3-540-45620-1_32"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610800042X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610800042X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T15:53:46Z","timestamp":1557330826000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610800042X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":5,"alternative-id":["S157106610800042X"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2007.09.022","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2008,1]]}}}