{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:10:15Z","timestamp":1648541415379},"reference-count":15,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0167-739x(99)00089-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:32:32Z","timestamp":1027650752000},"page":"753-769","source":"Crossref","is-referenced-by-count":0,"title":["Abstract machine construction through operational semantics refinements"],"prefix":"10.1016","volume":"16","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Cabestre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Percebois","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Paul","family":"Bodeveix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-739X(99)00089-8_BIB1","unstructured":"K. Arnold, J. Gosling, The Java Programming Language, Addison-Wesley, Reading, MA, 1996."},{"key":"10.1016\/S0167-739X(99)00089-8_BIB2","unstructured":"A. Aho, R. Sethi, J. Ullman, Compilers: Principles, Techniques and Tools, Addison-Wesley, Reading, MA, 1987."},{"key":"10.1016\/S0167-739X(99)00089-8_BIB3","doi-asserted-by":"crossref","unstructured":"U. J\u00f8rring, W. Scherlis, Compilers and staging transformations, in: Thirteenth ACM Symposium on Principles of Programming Languages, St. Petersburg, Florida, 1986, pp. 86\u201396.","DOI":"10.1145\/512644.512652"},{"key":"10.1016\/S0167-739X(99)00089-8_BIB4","doi-asserted-by":"crossref","unstructured":"J. Hannan, D. Miller, From operational semantics to abstract machines: preliminary results, in: M. Wand (Ed.), Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, ACM, New York, 1990, pp. 323\u2013332.","DOI":"10.1145\/91556.91680"},{"key":"10.1016\/S0167-739X(99)00089-8_BIB5","first-page":"130","article-title":"Staging transformations for abstract machines","volume":"26","author":"Hannan","year":"1991","journal-title":"Partial Evaluation and Semantic Based Program Manipulation"},{"key":"10.1016\/S0167-739X(99)00089-8_BIB6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1017\/S0956796897002712","article-title":"Deriving a lazy abstract machine","volume":"7","author":"Sestoft","year":"1997","journal-title":"J. Funct. Programming"},{"key":"10.1016\/S0167-739X(99)00089-8_BIB7","unstructured":"S. Diehl, Semantics-directed generation of compilers and abstract machines, Ph.D. Thesis, University Saarbr\u00fccken, Germany, 1996."},{"key":"10.1016\/S0167-739X(99)00089-8_BIB8","unstructured":"S. Diehl, Transformations of evolving algebras, in: LIRA\u201997 (VIII International Conference on Logic and Computer Science), Novi Sad, Yugoslavia, September 1997, pp. 51\u201357."},{"key":"10.1016\/S0167-739X(99)00089-8_BIB9","first-page":"264","article-title":"Evolving algebras: an introductory tutorial","volume":"43","author":"Gurevich","year":"1991","journal-title":"Bull. Eur. Assoc. Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0167-739X(99)00089-8_BIB10","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1145\/357172.357179","article-title":"Deriving target code as a representation of continuation semantics","volume":"4","author":"Wand","year":"1982","journal-title":"ACM Trans. Programming Languages Syst."},{"key":"10.1016\/S0167-739X(99)00089-8_BIB11","unstructured":"X. Leroy, The Objective Caml System Release 1.03, INRIA, October 1996."},{"key":"10.1016\/S0167-739X(99)00089-8_BIB12","unstructured":"N.D. Jones, C.K. Gomard, P. Sestoft, Partial Evaluation and Automatic Program Generation, Series in Computer Science, Prentice-Hall, Englewood Cliffs, NJ, 1993."},{"key":"10.1016\/S0167-739X(99)00089-8_BIB13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by-name, call-by-value and the \u03bb-calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-739X(99)00089-8_BIB14","doi-asserted-by":"crossref","unstructured":"J.-C. Reynolds, Definitional interpreters for higher order programming languages, in: ACM Conference Proceedings, 1972, pp. 717\u2013740.","DOI":"10.1145\/800194.805852"},{"key":"10.1016\/S0167-739X(99)00089-8_BIB15","unstructured":"G. Huet, G. Kahn, C. Paulin-Mohring, The Coq proof assistant \u2014a tutorial, version 6.1, Tech. Rep. 204, INRIA, August 1997."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X99000898?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X99000898?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T13:53:10Z","timestamp":1555249990000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X99000898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":15,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0167739X99000898"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(99)00089-8","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}