{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:58:23Z","timestamp":1648576703000},"reference-count":35,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4733,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0167-6423(99)00047-7","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T16:12:04Z","timestamp":1036080724000},"page":"125-142","source":"Crossref","is-referenced-by-count":1,"title":["A generative methodology for the design of abstract machines"],"prefix":"10.1016","volume":"38","author":[{"given":"Stephan","family":"Diehl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(99)00047-7_BIB1","series-title":"Handbook of Mathematical Logic","article-title":"An introduction to inductive definitions","author":"Aczel","year":"1977"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB2","series-title":"Warren's Abstract Machine \u2013 A Tutorial Reconstruction","author":"A\u0131\u0308t-Kaci","year":"1991"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB3","unstructured":"C. B\u00f6schen, C. Fecht, A.V. Hense, R. Wilhelm, An abstract machine for an object-oriented language with top-level classes, Technical Report FB14-No. A 02\/94, Computer Science Department, University Saarbr\u00fccken, 1994."},{"key":"10.1016\/S0167-6423(99)00047-7_BIB4","doi-asserted-by":"crossref","unstructured":"L. Cardelli, Compiling a functional language, in: Internat. Symp. on LISP and Functional Programming, 1984.","DOI":"10.1145\/800055.802037"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB5","doi-asserted-by":"crossref","unstructured":"G. Cousineau, P.-L. Curien, M. Mauny, The categorial abstract machine, in: Proc. FPCA\u201985, Lecture Notes in Computer Science, Vol. 201, Springer, Berlin, 1985.","DOI":"10.1007\/3-540-15975-4_29"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB6","doi-asserted-by":"crossref","unstructured":"L. Damas, R. Milner, Principal type-schemes for functional languages, in: Proc. ACM Symp. on Principles of Programming Languages, 1982.","DOI":"10.1145\/582153.582176"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB7","article-title":"Proof of translation in natural semantics","volume":"Vol. 213","author":"Despeyroux","year":"1986"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB8","doi-asserted-by":"crossref","unstructured":"T. Despeyroux, Executable specification of static semantics, in: Semantics of Data Types, Lecture Notes in Computer Science, Vol. 173, Springer, Berlin, 1984.","DOI":"10.1007\/3-540-13346-1_11"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB9","unstructured":"S. Diehl, Prolog and typed feature structures: a compiler for parallel computers, Master's Thesis, Worcester Polytechnic Institute, Worcester, Massachusetts, 1993."},{"key":"10.1016\/S0167-6423(99)00047-7_BIB10","unstructured":"S. Diehl, Semantics-directed generation of compilers and abstract machines, Ph.D. Thesis, University Saarbr\u00fccken, Germany, 1996. http:\/\/www.cs.uni-sb.de\/\u00a0\u0303diehl\/phd.html."},{"key":"10.1016\/S0167-6423(99)00047-7_BIB11","unstructured":"S. Diehl, Transformations of evolving algebras, in: Proc. 8th Internat. Conf. on Logic and Computer Science LIRA\u201997, Novi Sad, Yugoslavia, 1997, pp. 43\u201350."},{"key":"10.1016\/S0167-6423(99)00047-7_BIB12","doi-asserted-by":"crossref","unstructured":"S. Diehl, Natural semantics-directed generation of compilers and abstract machines, Formal Aspects of Comput. (1999), to appear.","DOI":"10.1007\/PL00003929"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB13","unstructured":"F.Q.B. da Silva, Towards a formal framework for evaluation of operational semantics, Technical Report ECS-LFCS-90-126, Edinburgh University, 1990."},{"key":"10.1016\/S0167-6423(99)00047-7_BIB14","unstructured":"F.Q.B. da Silva, Correctness proofs of compilers and debuggers: an approach based on structural operational semantics, Ph.D. Thesis, University of Edinburgh, 1992."},{"issue":"4","key":"10.1016\/S0167-6423(99)00047-7_BIB15","doi-asserted-by":"crossref","DOI":"10.1145\/183432.183458","article-title":"Operational semantics-directed compilers and machine architectures","volume":"16","author":"Hannan","year":"1994","journal-title":"ACM TOPLAS"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB16","doi-asserted-by":"crossref","unstructured":"J. Jaffar, P.J. Stuckey, S. Michaylov, R.H.C. Yap, An abstract machine for CLP(R), in: PLDI\u201992, San Francisco, Sigplan Notices, 1992.","DOI":"10.1145\/143095.143127"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB17","doi-asserted-by":"crossref","unstructured":"T. Johnson, Efficient compilation of lazy evaluation. in: CC\u201984. Sigplan Notices 19(6) (1984).","DOI":"10.1145\/502949.502880"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB18","doi-asserted-by":"crossref","unstructured":"U. J\u00f8rring, W.L. Scherlis, Compilers and staging transformations, in: Proc. Thirteenth ACM Symp. on Principles of Programming Languages, St. Petersburg, Florida, ACM, New York, 1986, pp. 86\u201396.","DOI":"10.1145\/512644.512652"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB19","doi-asserted-by":"crossref","unstructured":"G. Kahn, Natural semantics, in: Proc. 4th Annual Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 247, Springer, Berlin, 1987, pp. 22\u201339.","DOI":"10.1007\/BFb0039592"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB20","first-page":"134","article-title":"How to invent a Prolog machine","volume":"Vol. 225","author":"Kursawe","year":"1986"},{"issue":"4","key":"10.1016\/S0167-6423(99)00047-7_BIB21","doi-asserted-by":"crossref","DOI":"10.1093\/comjnl\/6.4.308","article-title":"The mechanical evaluation of expressions","volume":"6","author":"Landin","year":"1964","journal-title":"Comput. J."},{"key":"10.1016\/S0167-6423(99)00047-7_BIB22","unstructured":"X. Leroy, The caml light system, release 0.6 \u2013 documentation and user's manual, Technical Report, INRIA, France, 1993."},{"key":"10.1016\/S0167-6423(99)00047-7_BIB23","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB24","doi-asserted-by":"crossref","unstructured":"M. Mauny, A. Suarez, Implementing functional languages in the categorial abstract machine, in: Internat. Conf. on LISP and Functional Programming, 1986.","DOI":"10.1145\/319838.319869"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB25","unstructured":"S. McKeever, A framework for generating compilers from natural semantics specifications, in: P.D. Mosses (Ed.), Proc. 1st Workshop on Action Semantics, BRICS-NS-94-1. University of Aarhus, Denmark, 1994."},{"key":"10.1016\/S0167-6423(99)00047-7_BIB26","series-title":"Proc. 7th Internat. Symp., PLILP\u201995","article-title":"An abstract machine for OZ","volume":"Vol. 982","author":"Mehl","year":"1995"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB27","series-title":"The Definition of Standard ML","author":"Milner","year":"1990"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB28","unstructured":"H. Moura, Action notation transformations, Ph.D. Thesis, University of Glasgow, 1993."},{"key":"10.1016\/S0167-6423(99)00047-7_BIB29","article-title":"Action transformations in the ACTRESS compiler generator","volume":"Vol. 768","author":"Moura","year":"1994"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB30","article-title":"Camel","volume":"Vol. 631","author":"M\u00fcck","year":"1992"},{"issue":"1,2","key":"10.1016\/S0167-6423(99)00047-7_BIB31","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0743-1066(93)90026-D","article-title":"Towards a methodology for the design of abstract machines","volume":"16","author":"Nilsson","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB32","series-title":"Pascal Implementation, The P4 Compiler","author":"Pemberton","year":"1982"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB33","doi-asserted-by":"crossref","unstructured":"D.A. Schmidt, Natural-semantics-based abstract interpretation (preliminary version), in: SAS\u201995, 1995.","DOI":"10.1007\/3-540-60360-3_28"},{"key":"10.1016\/S0167-6423(99)00047-7_BIB34","unstructured":"Sun Microsystems, Documentation of the Java Developers Kit-version 1.0 Beta, 1995, available at http:\/\/java.sun.com\/JDK-beta\/index.html."},{"key":"10.1016\/S0167-6423(99)00047-7_BIB35","unstructured":"D.H.D. Warren, Implementing Prolog \u2013 compiling predicate logic programs, D.A.I Research Report No. 40, Edinburgh, 1977."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642399000477?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642399000477?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T17:08:30Z","timestamp":1578503310000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642399000477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":35,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0167642399000477"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(99)00047-7","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}