{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:40Z","timestamp":1725472060345},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540489375"},{"type":"electronic","value":"9783540489382"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11924661_25","type":"book-chapter","created":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T09:42:39Z","timestamp":1161942159000},"page":"406-422","source":"Crossref","is-referenced-by-count":5,"title":["On Jones-Optimal Specializers: A Case Study Using Unmix"],"prefix":"10.1007","author":[{"given":"Johan","family":"Gade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Gl\u00fcck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"volume-title":"Partial Evaluation and Mixed Computation","year":"1988","key":"25_CR1","unstructured":"Bj\u00f8rner, D., Ershov, A.P., Jones, N.D. (eds.): Partial Evaluation and Mixed Computation. North-Holland, Amsterdam (1988)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-36575-3_23","volume-title":"Programming Languages and Systems","author":"O. Danvy","year":"2003","unstructured":"Danvy, O., Mart\u00ednez L\u00f3pez, P.E.: Tagging, encoding, and jones optimality. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 335\u2013347. Springer, Heidelberg (2003)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-39866-0_16","volume-title":"Perspectives of System Informatics","author":"R. Gl\u00fcck","year":"2004","unstructured":"Gl\u00fcck, R.: The translation power of the futamura projections. In: Broy, M., Zamulin, A.V. (eds.) PSI 2003. LNCS, vol.\u00a02890, pp. 133\u2013147. Springer, Heidelberg (2004)"},{"issue":"3","key":"25_CR4","first-page":"123","volume":"12","author":"C.K. Gomard","year":"1991","unstructured":"Gomard, C.K., Jones, N.D.: Compiler generation by partial evaluation: a case study. Structured Programming\u00a012(3), 123\u2013144 (1991)","journal-title":"Structured Programming"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-61580-6_10","volume-title":"Partial Evaluation","author":"J. Hughes","year":"1996","unstructured":"Hughes, J.: Type specialisation for the lambda-calculus; or, a new paradigm for partial evaluation based on type inference. In: Danvy, O., Thiemann, P., Gl\u00fcck, R. (eds.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01110, pp. 183\u2013215. Springer, Heidelberg (1996)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Jones, N.D.: Challenging problems in partial evaluation and mixed computation. In: Bj\u00f8rner, et al. (eds.) [1], pp. 1\u201314","DOI":"10.1007\/BF03037143"},{"key":"25_CR7","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N.D. Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs (1993)"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01806312","volume":"2","author":"N.D. Jones","year":"1989","unstructured":"Jones, N.D., Sestoft, P., S\u00f8ndergaard, H.: Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation\u00a02(1), 9\u201350 (1989)","journal-title":"Lisp and Symbolic Computation"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-45350-4_11","volume-title":"Semantics, Applications, and Implementation of Program Generation","author":"H. Makholm","year":"2000","unstructured":"Makholm, H.: On jones-optimal specialization for strongly typed languages. In: Taha, W. (ed.) SAIG 2000. LNCS, vol.\u00a01924, pp. 129\u2013148. Springer, Heidelberg (2000)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-47018-2_6","volume-title":"Partial Evaluation. Practice and Theory","author":"T.\u00c6. Mogensen","year":"1999","unstructured":"Mogensen, T.\u00c6.: Inherited limits. In: Hatcliff, J., Mogensen, T.\u00c6., Thiemann, P. (eds.) DIKU 1998. LNCS, vol.\u00a01706, pp. 189\u2013202. Springer, Heidelberg (1999)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/3-540-52592-0_73","volume-title":"ESOP 1990","author":"S.A. Romanenko","year":"1990","unstructured":"Romanenko, S.A.: Arity raiser and its use in program specialization. In: Jones, N.D. (ed.) ESOP 1990. LNCS, vol.\u00a0432, pp. 341\u2013360. Springer, Heidelberg (1990)"},{"key":"#cr-split#-25_CR12.1","unstructured":"Romanenko, S.A.: The specializer Unmix (1990);"},{"key":"#cr-split#-25_CR12.2","unstructured":"Program and documentation available from:                                           ftp:\/\/ftp.diku.dk\/pub\/diku\/dists\/jones-book\/Romanenko\/"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/3-540-16446-4_14","volume-title":"Programs as Data Objects","author":"P. Sestoft","year":"1986","unstructured":"Sestoft, P.: The structure of a self-applicable partial evaluator. In: Ganzinger, H., Jones, N.D. (eds.) Programs as Data Objects. LNCS, vol.\u00a0217, pp. 236\u2013256. Springer, Heidelberg (1986)"},{"key":"25_CR14","unstructured":"Sestoft, P.: Automatic call unfolding in a partial evaluator. In: Bj\u00f8rner, et al. (eds.) [1], pp. 485\u2013506 (1988)"},{"key":"25_CR15","unstructured":"Skalberg, S.C.: Mechanical proof of the optimality of a partial evaluator. Master\u2019s thesis, Department of Computer Science, University of Copenhagen (1999)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-44978-7_15","volume-title":"Programs as Data Objects","author":"W. Taha","year":"2001","unstructured":"Taha, W., Makholm, H., Hughes, J.: Tag elimination and jones-optimality. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol.\u00a02053, pp. 257\u2013275. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11924661_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:45:11Z","timestamp":1619495111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11924661_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540489375","9783540489382"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11924661_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}