{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:05:15Z","timestamp":1725487515412},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540420682"},{"type":"electronic","value":"9783540449782"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44978-7_15","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:46:22Z","timestamp":1184600782000},"page":"257-275","source":"Crossref","is-referenced-by-count":17,"title":["Tag Elimination and Jones-Optimality"],"prefix":"10.1007","author":[{"given":"Walid","family":"Taha","sequence":"first","affiliation":[]},{"given":"Henning","family":"Makholm","sequence":"additional","affiliation":[]},{"given":"John","family":"Hughes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,4,25]]},"reference":[{"key":"15_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055112","volume-title":"25th International Colloquium on Automata, Languages, and Programming","author":"O. Danvy","year":"1998","unstructured":"Olivier Danvy. A simple solution to type specialization. In 25th International Colloquium on Automata, Languages, and Programming, volume 1443 of Lecture Notes in Computer Science, Aalborg, 1998."},{"key":"15_CR2","volume-title":"Proceedings of the International Conference on Functional Programming Languages and Computer Architecture (FPCA)","author":"F. Henglein","year":"1995","unstructured":"Fritz Henglein and Jakob Rehof. Safe polymorphic type inference for a dynamically typed language: Translating Scheme to ML. In Proceedings of the International Conference on Functional Programming Languages and Computer Architecture (FPCA), La Jolla, 1995. ACM Press."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"John Hughes. Type specialization. ACM Computing Surveys, 30(3es), 1998.","DOI":"10.1145\/289121.289135"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"John Hughes. The correctness of type specialisation. In European Symposium on Programming (ESOP), 2000.","DOI":"10.1007\/3-540-46425-5_14"},{"key":"15_CR5","first-page":"1","volume-title":"Partial Evaluation and Mixed Computation","author":"N. D. Jones","year":"1988","unstructured":"Neil D. Jones. Challenging problems in partial evaluation and mixed computation. In D. Bj\u00f8rner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 1\u201314, North-Holland, 1988. IFIP World Congress Proceedings, Elsevier Science Publishers B.V."},{"key":"15_CR6","unstructured":"Neil D. Jones, Carsten K Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993."},{"key":"15_CR7","series-title":"Lect Notes Comput Sci","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":"Henning Makholm. On Jones-optimal specialization for strongly typed languages. In [13], pages 129\u2013148, 2000."},{"key":"15_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/3-540-54415-1_51","volume-title":"Theoretical Aspects of Computer Software","author":"J. C. Mitchell","year":"1991","unstructured":"John C. Mitchell. On abstraction and the expressive power of programming languages. In T. Ito and A. R. Meyer, editors, Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science, pages 290\u2013310. Springer-Verlag, 1991."},{"key":"15_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-47018-2_6","volume-title":"Partial Evaluation: Practice and Theory","author":"T. Mogensen","year":"1999","unstructured":"Torben Mogensen. Inherited limits. In Partial Evaluation: Practice and Theory, volume 1706 of Lecture Notes in Computer Science, pages 189\u2013202. Springer-Verlag, 1999."},{"key":"15_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-49099-X_13","volume-title":"European Symposium on Programming (ESOP)","author":"E. Moggi","year":"1999","unstructured":"Eugenio Moggi, Walid Taha, Zine El-Abidine Benaissa, and Tim Sheard. An idealized MetaML: Simpler, and more expressive. In European Symposium on Programming (ESOP), volume 1576 of Lecture Notes in Computer Science, pages 193\u2013207. Springer-Verlag, 1999."},{"key":"15_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/3-540-50940-2_46","volume-title":"TAPSOFT\u201989: Proceedings of the International Joint Conference on Theory and Practice of Software Development","author":"F. Pfenning","year":"1989","unstructured":"Frank Pfenning and Peter Lee. LEAP: A language with eval and polymorphism. In Josep D\u00edaz and Fernando Orejas, editors, TAPSOFT\u201989: Proceedings of the International Joint Conference on Theory and Practice of Software Development,, volume 352 of Lecture Notes in Computer Science, pages 345\u2013359. Springer-Verlag, 1989."},{"key":"15_CR12","unstructured":"Brian Cantwell Smith. Reflection and Semantics in a Procedural Language. PhD thesis, Massachusetts Institute of Technology, 1982."},{"key":"15_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Semantics, Applications, and Implementation of Program Generation","year":"2000","unstructured":"Walid Taha, editor. Semantics, Applications, and Implementation of Program Generation, volume 1924 of Lecture Notes in Computer Science, Montr\u00e9al, 2000. Springer-Verlag."},{"key":"15_CR14","volume-title":"Proceedings of the Workshop on Partial Evaluation and Semantics-Based Program Maniplation (PEPM)","author":"W. Taha","year":"2000","unstructured":"Walid Taha. A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trivial. In Proceedings of the Workshop on Partial Evaluation and Semantics-Based Program Maniplation (PEPM), Boston, 2000. ACM Press."},{"key":"15_CR15","unstructured":"Walid Taha and Henning Makholm. Tag elimination \u2014 or \u2014 type specialisation is a type-indexed effect. In Subtyping and Dependent Types in Programming, APPSEM Workshop. INRIA technical report, 2000."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/258993.259019","volume-title":"Proceedings of the Symposium on Partial Evaluation and Semantic-Based Program Manipulation (PEPM)","author":"W. Taha","year":"1997","unstructured":"Walid Taha and Tim Sheard. Multi-stage programming with explicit annotations. In Proceedings of the Symposium on Partial Evaluation and Semantic-Based Program Manipulation (PEPM), pages 203\u2013217, Amsterdam, 1997. ACM Press."},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1023\/A:1007720632734","volume":"10","author":"M. Wand","year":"1998","unstructured":"Mitchell Wand. The theory of fexprs is trivial. Lisp and Symbolic Computation, 10:189\u2013199, 1998.","journal-title":"Lisp and Symbolic Computation"},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"A. K. Wright","year":"1994","unstructured":"Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38\u201394, 1994.","journal-title":"Information and Computation"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/289423.289458","volume-title":"Proceedings of the International Conference on Functional Programming (ICFP)","author":"Z. Yang","year":"1998","unstructured":"Zhe Yang. Encoding types in ML-like languages. In Proceedings of the International Conference on Functional Programming (ICFP), pages 289\u2013300, Baltimore, 1998. ACM Press."}],"container-title":["Lecture Notes in Computer Science","Programs as Data Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44978-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T00:12:58Z","timestamp":1550448778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44978-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540420682","9783540449782"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44978-7_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}