{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T17:52:18Z","timestamp":1693849938313},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"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":4288,"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":[[2001,11]]},"DOI":"10.1016\/s1571-0661(04)00280-4","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"79-96","source":"Crossref","is-referenced-by-count":4,"title":["A Representation of F\u03c9 in LF"],"prefix":"10.1016","volume":"58","author":[{"given":"Carsten","family":"Sch\u00fcrmann","sequence":"first","affiliation":[]},{"given":"Dachuan","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Zhaozhong","family":"Ni","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB1","series-title":"Implementing Mathematics with the Nuprl Proof Development System","author":"Constable","year":"1986"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB2","series-title":"Logical Frameworks","first-page":"255","article-title":"An algorithm for testing conversion in type theory","author":"Coquand","year":"1991"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Jo\u00eblle Despeyroux, Frank Pfenning, and Carsten Sch\u00fcrmann. Primitive recursion for higher-order abstract syntax. In R. Hindley, editor, Proceedings of the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97), pages 147\u2013163, Nancy, France, April 1997. Springer-Verlag LNCS.","DOI":"10.1007\/3-540-62688-3_34"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB4","unstructured":"An extended version is available as Technical Report CMU-CS-96\u2013172, Carnegie Mellon University."},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB5","unstructured":"Gilles Dowek, Amy Felty, Hugo Herbelin, G\u00e9rard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The Coq proof assistant user's guide. Rapport Techniques 154, INRIA, Rocquencourt, France, 1993. Version 5.8."},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB6","unstructured":"J.-Y. Girard. Interpretation fonctionelle et elimination des coupures de l'arithmetique d'ordre superieur. These D'Etat, Universite Paris VII, 1972."},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB7","series-title":"Cambridge Tracts in Theoretical Computer Science 7","article-title":"Proofs and Types","author":"Girard","year":"1988"},{"issue":"1","key":"10.1016\/S1571-0661(04)00280-4_NEWBIB8","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\/S1571-0661(04)00280-4_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Robert Harper and Greg Morrisett. Compiling polymorphism using intensional type analysis. In Conference Record of POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 130\u2013141, San Francisco, California, 1995.","DOI":"10.1145\/199448.199475"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB10","doi-asserted-by":"crossref","unstructured":"Martin Hofmann. Semantical analysis for higher-order abstract syntax. In G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99), pages 204\u2013213, Trento, Italy, July 1999. IEEE Computer Society Press.","DOI":"10.1109\/LICS.1999.782616"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB11","unstructured":"Christopher League, Valery Trifonov, and Zhong Shao. Type-preserving compilation of featherweight Java. In Foundations of Object-Oriented Languages (FOOL8), London, January 2001."},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB12","doi-asserted-by":"crossref","unstructured":"G. Morrisett, D. Walker, K. Crary, and N. Glew. From system F to typed assembly language. In In 25th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 85\u201397, San Diego California, USA, 1998. ACM Press.","DOI":"10.1145\/268946.268954"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB13","doi-asserted-by":"crossref","unstructured":"George C. Necula. Proof-carrying code. In Neil D. Jones, editor, Conference Record of the 24th Symposium on Principles of Programming Languages (POPL'97), pages 106\u2013119, Paris, France, January 1997. ACM Press.","DOI":"10.1145\/263699.263712"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB14","series-title":"Isabelle: A Generic Theorem Prover","author":"Lawrence Paulson","year":"1994"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB15","series-title":"Logical Frameworks","first-page":"149","article-title":"Logic programming in the LF logical framework","author":"Pfenning","year":"1991"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB16","doi-asserted-by":"crossref","unstructured":"Frank Pfenning. A proof of the Church-Rosser theorem and its representation in a logical framework. Journal of Automated Reasoning, 1993. To appear. A preliminary version is available as Carnegie Mellon Technical Report CMU-CS-92\u2013186, September 1992.","DOI":"10.21236\/ADA256574"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB17","doi-asserted-by":"crossref","unstructured":"Frank Pfenning and Carsten Sch\u00fcrmann. System description: Twelf \u2014 a metalogical framework for deductive systems. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), pages 202\u2013206, Trento, Italy, July 1999. Springer-Verlag LNAI 1632.","DOI":"10.1007\/3-540-48660-7_14"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB18","doi-asserted-by":"crossref","unstructured":"Carsten Sch\u00fcrmann, Dachuan Yu, and Zhaozhong Ni. A representation of F\u03c9 in LF. http:\/\/www.cs.yale.edu\/~carsten\/public\/merlin01.elf, 2001.","DOI":"10.1016\/S1571-0661(04)00280-4"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB19","doi-asserted-by":"crossref","unstructured":"Zhong Shao. Implementing typed intermediate language. In Proc. 1998 ACM SIGPLAN International Conference on Functional Programming (ICFP'98), pages 313\u2013323, Baltimore, Maryland, September 1998.","DOI":"10.1145\/289423.289460"},{"key":"10.1016\/S1571-0661(04)00280-4_NEWBIB20","doi-asserted-by":"crossref","unstructured":"Valery Trifonov, Bratin Saha, and Zhong Shao. Fully reflexive intensional type analysis. In Proc. 2000 ACM SIGPLAN International Conference on Functional Programming (ICFP'00), pages 82\u201393. ACM Press, September 2000.","DOI":"10.1145\/351240.351248"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002804?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002804?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T12:25:54Z","timestamp":1585484754000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104002804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S1571066104002804"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00280-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}