{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:33:12Z","timestamp":1752982392667},"publisher-location":"Berlin\/Heidelberg","reference-count":22,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032064","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"639-659","source":"Crossref","is-referenced-by-count":12,"title":["Partial evaluation, self-application and types"],"prefix":"10.1007","author":[{"given":"Neil D.","family":"Jones","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"A. Appel: Semantics-Directed Code Generation. 12th ACM Symposium on Principles of Programming Languages, pp. 315\u2013324, 1985.","DOI":"10.1145\/318593.318661"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"A. Bondorf: Automatic Autoprojection of Higher Order Recursive Equations. 1990 ESOP Proceedings, LNCS 432, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52592-0_56"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"A. Bondorf, O. Danvy: Automatic Autoprojection of Recursive Equations with Global Variables and Abstract Data Types. DIKU report 90-4, University of Copenhagen,1990.","DOI":"10.1007\/3-540-52592-0_56"},{"issue":"2","key":"48_CR4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0020-0190(89)90113-0","volume":"30","author":"C. Consel","year":"1989","unstructured":"C. Consel, O. Danvy: Partial Evaluation of Pattern Matching in Strings. Information Processing Letters, Vol. 30, No 2, pp 79\u201386, January 1989.","journal-title":"Information Processing Letters"},{"key":"48_CR5","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/358141.358144","volume":"26","author":"S. Cook","year":"1983","unstructured":"S. Cook: An Overview of Computational Complexity. Communications of the ACM 26, pp. 401\u2013408,1983.","journal-title":"Communications of the ACM"},{"key":"48_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0304-3975(82)90111-6","volume":"18","author":"A. P. Ershov","year":"1982","unstructured":"A. P. Ershov: Mixed Computation: Potential applications and problems for study. Theoretical Computer Science 18, pp. 41\u201367, 1982.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"48_CR7","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), pp. 45\u201350, 1971.","journal-title":"Systems, Computers, Controls"},{"key":"48_CR8","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"G. Goguen","year":"1977","unstructured":"G. Goguen, J. W. Thatcher, E. G. Wagner, J. B. Wright: Initial Algebra Semantics and Continuous Algebras. Journal of the ACM vol. 24, pp. 68\u201395, 1977.","journal-title":"Journal of the ACM"},{"key":"48_CR9","unstructured":"C. K. Gomard: Higher Order Partial Evaluation: H.O.P.E. for the Lambda Calculus. M. S. thesis, DIKU, University of Copenhagen, 1989."},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"M. Hagiya: Meta-circular Interpreter for a Strongly Typed Language. Journal of Symbolic Computation (Japan), 1988.","DOI":"10.1016\/S0747-7171(89)80066-5"},{"key":"48_CR11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3-540-15976-2_6","volume":"202","author":"N. D. Jones","year":"1985","unstructured":"N. D. Jones, Peter Sestoft, Harald S\u00f8ndergaard: An experiment in Partial Evaluation: the Generation of a Compiler Generator. Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 202, ed. J. Juannoud, pp. 124\u2013140, Springer-Verlag, 1985.","journal-title":"Rewriting Techniques and Applications, Lecture Notes in Computer Science"},{"issue":"1","key":"48_CR12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01806312","volume":"2","author":"N. D. Jones","year":"1989","unstructured":"N. D. Jones, Peter Sestoft, Harald S\u00f8ndergaard: MIX: A Self-applicable Partial Evaluator for Experiments in Compiler Generation. Lisp and Symbolic Computation, vol. 2, no. 1, pp. 9\u201350, 1989.","journal-title":"Lisp and Symbolic Computation"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"N. D. Jones, C. K. Gomard, A. Bondorf, O. Danvy, T. Mogensen: A Self-applicable Partial Evaluator for the Lambda Calculus. IEEE Computer Society 1990 International Conference on Computer Languages, pp. 49\u201358, 1990.","DOI":"10.1109\/ICCL.1990.63760"},{"key":"48_CR14","unstructured":"Stephen Cole Kleene: Introduction to Metamathematics. North-Holland, 1952."},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"F. L. Morris: Advice on Structuring Compilers and proving them correct. 1st ACM Symposium on Principles of Programming Languages, pp. 144\u2013152, 1973.","DOI":"10.1145\/512927.512941"},{"key":"48_CR16","series-title":"Reference Manual and User Guide. DAIMI Report","volume-title":"SIS\u2014Semantics Implementation System","author":"P. Mosses","year":"1979","unstructured":"P. Mosses: SIS\u2014Semantics Implementation System, Reference Manual and User Guide. DAIMI Report MD-30, University of Aarhus, Denmark, 1979."},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"H. R. Nielson, F. Nielson: Automatic Binding Time Analysis for a Typed \u03bb-calculus. 15th ACM Symposium on Principles of Programming Languages, pp. 98\u2013106,1988\u201d.","DOI":"10.1145\/73560.73569"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"L. Paulson: A Semantics-Directed Compiler Generator. 9th ACM Symposium on Principles of Programming Languages, pp. 224\u2013233, 1982. Wolters-Noordhoff Publishing, 1970.","DOI":"10.1145\/582153.582178"},{"key":"48_CR19","unstructured":"Hartley Rogers: Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967."},{"key":"48_CR20","unstructured":"D. Schmidt: Denotational Semantics: a Methodology for Language Development. Allyn and Bacon, 1986"},{"issue":"3","key":"48_CR21","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1145\/5956.5957","volume":"8","author":"V. F. Turchin","year":"1986","unstructured":"V. F. Turchin: The Concept of a Supercompiler. ACM Transactions on Programming Languages and Systems, 8(3), pp. 292\u2013325, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"48_CR22","unstructured":"P. Weis: Le Systeme SAM: Metacompilation tres efficace a l'aide d'operateurs semantiques. Universite de Paris 7, 1987."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:44:41Z","timestamp":1586612681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0032064","relation":{},"subject":[]}}