{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:28:06Z","timestamp":1725542886646},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642115028"},{"type":"electronic","value":"9783642115035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11503-5_7","type":"book-chapter","created":{"date-parts":[[2010,1,7]],"date-time":"2010-01-07T04:42:16Z","timestamp":1262839336000},"page":"58-72","source":"Crossref","is-referenced-by-count":5,"title":["Conversion by Evaluation"],"prefix":"10.1007","author":[{"given":"Mathieu","family":"Boespflug","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-71067-7_8","volume-title":"Theorem Proving in Higher Order Logics","author":"K. Aehlig","year":"2008","unstructured":"Aehlig, K., Haftmann, F., Nipkow, T.: A Compiled Implementation of Normalization by Evaluation. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol.\u00a05170, pp. 39\u201354. Springer, Heidelberg (2008)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Altenkirch, T., Dybjer, P., Hofmann, M., Scott, P.: Normalization by evaluation for typed lambda calculus with coproducts. In: Proceedings of the Sixteenth Annual IEEE Symposium on Logic in Computer Science, pp. 203\u2013210 (2001)","DOI":"10.1109\/LICS.2001.932506"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Berger, U., Eberl, M., Schwichtenberg, H.: Normalization by evaluation. Prospects for Hardware Foundations, 117\u2013137 (1998)","DOI":"10.1007\/3-540-49254-2_4"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0890-5401(03)00014-2","volume":"183","author":"U. Berger","year":"2003","unstructured":"Berger, U., Eberl, M., Schwichtenberg, H.: Term rewriting for normalization by evaluation. Information and Computation\u00a0183(1), 19\u201342 (2003)","journal-title":"Information and Computation"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-71316-6_8","volume-title":"Programming Languages and Systems","author":"F. Blanqui","year":"2007","unstructured":"Blanqui, F., Hardin, T., Weis, P.: On the Implementation of Construction Functions for Non-free Concrete Data Types. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 95\u2013109. Springer, Heidelberg (2007)"},{"key":"7_CR6","unstructured":"Boespflug, M.: From self-interpreters to normalization by evaluation. In: Informal proceedings of the 2009 Workshop on Normalization by Evaluation, August 2009, pp. 35\u201338 (2009)"},{"issue":"01","key":"7_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0960129596002150","volume":"7","author":"T. Coquand","year":"1997","unstructured":"Coquand, T., Dybjer, P.: Intuitionistic model constructions and normalization proofs. Mathematical Structures in Computer Science\u00a07(01), 75\u201394 (1997)","journal-title":"Mathematical Structures in Computer Science"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-73228-0_9","volume-title":"Typed Lambda Calculi and Applications","author":"D. Cousineau","year":"2007","unstructured":"Cousineau, D., Dowek, G.: Embedding pure type systems in the lambda-Pi-calculus modulo. In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol.\u00a04583, pp. 102\u2013117. Springer, Heidelberg (2007)"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10990-007-9015-z","volume":"20","author":"P. Cr\u00e9gut","year":"2007","unstructured":"Cr\u00e9gut, P.: Strongly reducing variants of the Krivine abstract machine. Higher-Order and Symbolic Computation\u00a020(3), 209\u2013230 (2007)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Danvy, O.: Type-directed partial evaluation. In: POPL 1996, pp. 242\u2013257 (1996)","DOI":"10.1145\/237721.237784"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Filinski, A., Rohde, H.: A denotational account of untyped normalization by evaluation (2004)","DOI":"10.1007\/978-3-540-24727-2_13"},{"key":"7_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-87827-8_28","volume-title":"Computer Mathematics","author":"G. Gonthier","year":"2008","unstructured":"Gonthier, G.: The four colour theorem: Engineering of a formal proof. In: Kapur, D. (ed.) ASCM 2007. LNCS (LNAI), vol.\u00a05081, p. 333. Springer, Heidelberg (2008)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, B., Leroy, X.: A compiled implementation of strong reduction. In: Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, pp. 235\u2013246 (2002)","DOI":"10.1145\/583852.581501"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/11541868_7","volume-title":"Theorem Proving in Higher Order Logics","author":"B. Gr\u00e9goire","year":"2005","unstructured":"Gr\u00e9goire, B., Mahboubi, A.: Proving equalities in a commutative ring done right in coq. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, pp. 98\u2013113. Springer, Heidelberg (2005)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Le Fessant, F., Maranget, L.: Optimizing pattern matching. In: Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, pp. 26\u201337 (2001)","DOI":"10.1145\/507635.507641"},{"key":"7_CR16","unstructured":"Leroy, X.: The ZINC experiment: an economical implementation of the ML language. Tech. rep., INRIA (1990)"},{"key":"7_CR17","unstructured":"L\u00e9vy, J.: R\u00e9ductions correctes et optimales dans le Lambda-Calcul. Universit\u00e9 Paris 7 (1978)"},{"key":"7_CR18","unstructured":"Lindley, S.: Normalisation by evaluation in the compilation of typed functional programming languages (2005)"},{"issue":"4-5","key":"7_CR19","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1017\/S0956796806005995","volume":"16","author":"S. Marlow","year":"2006","unstructured":"Marlow, S., Peyton-Jones, S.: Making a fast curry: push\/enter vs. eval\/apply for higher-order languages. Journal of Functional Programming\u00a016(4-5), 415\u2013449 (2006)","journal-title":"Journal of Functional Programming"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11503-5_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:41:25Z","timestamp":1606185685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11503-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642115028","9783642115035"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11503-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}