{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:38Z","timestamp":1742617238884,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620648"},{"type":"electronic","value":"9783540496373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62064-8_24","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:33:04Z","timestamp":1330295584000},"page":"285-296","source":"Crossref","is-referenced-by-count":2,"title":["Polyvariant expansion and compiler generators"],"prefix":"10.1007","author":[{"given":"Peter","family":"Thiemann","sequence":"first","affiliation":[]},{"given":"Michael","family":"Sperber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0167-6423(91)90035-V","volume":"17","author":"A. Bondorf","year":"1991","unstructured":"A. Bondorf. Automatic autoprojection of higher order recursive equations. Science of Computer Programming, 17:3\u201334, 1991.","journal-title":"Science of Computer Programming"},{"issue":"3","key":"24_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1017\/S0956796800000769","volume":"3","author":"A. Bondorf","year":"1993","unstructured":"A. Bondorf and J. J\u00f8rgensen. Efficient analyses for realistic off-line partial evaluation. Journal of Functional Programming, 3(3):315\u2013346, July 1993.","journal-title":"Journal of Functional Programming"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF00271642","volume":"21","author":"M. A. Bulyonkov","year":"1984","unstructured":"M. A. Bulyonkov. Polyvariant mixed computation for analyzer programs. Acta Inf., 21:473\u2013484, 1984.","journal-title":"Acta Inf."},{"doi-asserted-by":"crossref","unstructured":"M. A. Bulyonkov. Extracting polyvariant binding times from polyvariant specializer. In PEPM1993 [26], pages 59\u201365.","key":"24_CR4","DOI":"10.1145\/154630.154637"},{"key":"24_CR5","first-page":"264","volume-title":"Symp. Lisp and Functional Programming '92","author":"C. Consel","year":"1992","unstructured":"C. Consel. Binding time analysis for higher order untyped functional languages. In Symp. Lisp and Functional Programming '92, pages 264\u2013272, San Francisco, Ca., June 1992. ACM."},{"doi-asserted-by":"crossref","unstructured":"C. Consel. Polyvariant binding-time analysis for applicative lanuages. In PEPM1993 [26], pages 66\u201377.","key":"24_CR6","DOI":"10.1145\/154630.154638"},{"doi-asserted-by":"crossref","unstructured":"C. Consel. A tour of Schism. In PEPM1993 [26], pages 134\u2013154.","key":"24_CR7","DOI":"10.1145\/154630.154645"},{"key":"24_CR8","first-page":"493","volume-title":"Tutorial notes on partial evaluation","author":"C. Consel","year":"1993","unstructured":"C. Consel and O. Danvy. Tutorial notes on partial evaluation. In Symposium on Principles of Programming Languages '93, pages 493\u2013501, Charleston, Jan. 1993. ACM."},{"doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th Symposium on Principles of Programming Languages. ACM, 1977.","key":"24_CR9","DOI":"10.1145\/512950.512973"},{"key":"24_CR10","series-title":"LNCS 631","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-55844-6_142","volume-title":"Proc. Programming Language Implementation and Logic Programming '92","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Comparing the galois connection and widening\/narrowing approaches to abstract interpretation. In M. Bruynooghe and M. Wirsing, editors, Proc. Programming Language Implementation and Logic Programming '92, pages 269\u2013295, Leuven, Belgium, Aug. 1992. Springer-Verlag. LNCS 631."},{"key":"24_CR11","first-page":"170","volume-title":"Proc. Functional Programming Languages and Computer Architecture 1995","author":"P. Cousot","year":"1995","unstructured":"P. Cousot and R. Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In S. Peyton Jones, editor, Proc. Functional Programming Languages and Computer Architecture 1995, pages 170\u2013181, La Jolla, CA, June 1995. ACM Press, New York."},{"unstructured":"A. Ershov. Mixed computation: Potential applications and problems for study. In Mathematical Logic Methods in AI Problems and Systematic Programming, Part 1, pages 26\u201355. Vil'nyus, USSR, 1980. (In Russian).","key":"24_CR12"},{"key":"24_CR13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0304-3975(82)90111-6","volume":"18","author":"A. Ershov","year":"1982","unstructured":"A. Ershov. Mixed computation: Potential applications and problems for study. Theoretical Computer Science, 18:41\u201367, 1982.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"24_CR14","first-page":"45","volume":"2","author":"Y. Futamura","year":"1971","unstructured":"Y. Futamura. Partial evaluation of computation process\u2014an approach to a compiler-compiler. Systems, Computers, Controls, 2(5):45\u201350, 1971.","journal-title":"Systems, Computers, Controls"},{"key":"24_CR15","first-page":"322","volume-title":"volume 81\u201382 of Bigre Journal","author":"M. Gengler","year":"1992","unstructured":"M. Gengler and B. Rytz. A polyvariant binding time analysis handling partially known values. In Workshop on Static Analysis, volume 81\u201382 of Bigre Journal, pages 322\u2013330, Rennes, France, 1992. IRISA."},{"issue":"4","key":"24_CR16","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1017\/S0956796800001167","volume":"4","author":"R. Gl\u00fcck","year":"1994","unstructured":"R. Gl\u00fcck. On the generation of specializers. Journal of Functional Programming, 4(4):499\u2013514, Oct. 1994.","journal-title":"Journal of Functional Programming"},{"doi-asserted-by":"crossref","unstructured":"R. Gl\u00fcck and J. J\u00f8rgensen. Generating optimizing specializers. In IEEE International Conference on Computer Languages, pages 183\u2013194. IEEE Computer Society Press, 1994.","key":"24_CR17","DOI":"10.1109\/ICCL.1994.288382"},{"key":"24_CR18","first-page":"282","volume-title":"Partial type inference for untyped functional programs","author":"C. K. Gomard","year":"1990","unstructured":"C. K. Gomard. Partial type inference for untyped functional programs. In Proceedings of the Conference on Lisp and Functional Programming, pages 282\u2013287, Nice, France, 1990. ACM."},{"issue":"1","key":"24_CR19","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1017\/S0956796800000058","volume":"1","author":"C. K. Gomard","year":"1991","unstructured":"C. K. Gomard and N. D. Jones. A partial evaluator for the untyped lambdacalculus. Journal of Functional Programming, 1(1):21\u201369, January 1991.","journal-title":"Journal of Functional Programming"},{"key":"24_CR20","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/3540543961_22","volume-title":"Conf. Functional Programming Languages and Computer Architecture '91","author":"F. Henglein","year":"1991","unstructured":"F. Henglein. Efficient type inference for higher-order binding-time analysis. In Conf. Functional Programming Languages and Computer Architecture '91, pages 448\u2013472, Cambridge, Sept. 1991. ACM."},{"key":"24_CR21","volume-title":"Technical Report 1178-1990","author":"IEEE","year":"1991","unstructured":"IEEE. Standard for the Scheme programming language. Technical Report 1178-1990, Institute of Electrical and Electronic Engineers, Inc., New York, 1991."},{"unstructured":"N. D. Jones. Flow Analysis of Lazy Higher-Order Functional Programs, pages 103\u2013122. Ellis Horwood, 1987.","key":"24_CR22"},{"unstructured":"N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.","key":"24_CR23"},{"key":"24_CR24","series-title":"LNCS 351,352","first-page":"II","volume-title":"TAPSOFT '89","author":"T. \u00c6. Mogensen","year":"1989","unstructured":"T. \u00c6. Mogensen. Binding time analysis for polymorphically typed higher order languages. In J. D\u00edaz and F. Orejas, editors, TAPSOFT '89, pages II, 298\u2013312, Barcelona, Spain, Mar. 1989. Springer-Verlag. LNCS 351,352."},{"doi-asserted-by":"crossref","unstructured":"T. \u00c6. Mogensen. Separating binding times in language specifications. In Proc. Functional Programming Languages and Computer Architecture 1989, pages 14\u201325, London, GB, 1989.","key":"24_CR25","DOI":"10.1145\/99370.99372"},{"unstructured":"Proc. 1993 ACM Symp. Partial Evaluation and Semantics-Based Program Manipulation, Copenhagen, Denmark, June 1993. ACM.","key":"24_CR26"},{"key":"24_CR27","series-title":"Report YALEU\/DCS\/RR-909","first-page":"21","volume-title":"Workshop Partial Evaluation and Semantics-Based Program Manipulation '92","author":"B. Rytz","year":"1992","unstructured":"B. Rytz and M. Gengler. A polyvariant binding time analysis. In C. Consel, editor, Workshop Partial Evaluation and Semantics-Based Program Manipulation '92, pages 21\u201328, San Francisco, CA, June 1992. Yale University. Report YALEU\/DCS\/RR-909."},{"doi-asserted-by":"crossref","unstructured":"M. Sperber, R. Gl\u00fcck, and P. Thiemann. Bootstrapping higher-order program transformers from interpreters. In 1996 ACM Symposium on Applied Computing Programming Languages Track, pages 408\u2013413, Philadelphia, 1996.","key":"24_CR28","DOI":"10.1145\/331119.331417"},{"unstructured":"M. H. S\u00f8rensen. A grammar-based data-flow analysis to stop deforestation. In Trees in Algebra and Programming, volume 787 of Lecture Notes in Computer Science, Edinburgh, Apr. 1994.","key":"24_CR29"},{"issue":"2","key":"24_CR30","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/954063.954069","volume":"14","author":"V. Turchin","year":"1979","unstructured":"V. Turchin. A supercompiler system based on the language Refal. SIGPLAN Notices, 14(2):46\u201354, February 1979.","journal-title":"SIGPLAN Notices"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62064-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:27:51Z","timestamp":1742599671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62064-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620648","9783540496373"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-62064-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}