{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:44:27Z","timestamp":1775054667718,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540414131","type":"print"},{"value":"9783540444503","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_16","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:26:08Z","timestamp":1187252768000},"page":"201-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Combining Semantics with Non-standard Interpreter Hierarchies"],"prefix":"10.1007","author":[{"given":"Sergei","family":"Abramov","sequence":"first","affiliation":[]},{"given":"Robert","family":"Gl\u00fcck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"key":"16_CR1","unstructured":"S. M. Abramov, R. Gl\u00fcck. From standard to non-standard semantics by semantics modifiers. International Journal of Foundations of Computer Science. to appear."},{"key":"16_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/10722010_13","volume-title":"Mathematics of Program Construction","author":"S. M. Abramov","year":"2000","unstructured":"S. M. Abramov, R. Gl\u00fcck. The universal resolving algorithm: inverse computation in a functional language. In R. Backhouse, J. N. Oliveira (eds.), Mathematics of Program Construction. Proceedings, LNCS 1837, 187\u2013212. Springer-Verlag, 2000."},{"key":"16_CR3","unstructured":"K. Apt, F. Turini. Meta-Logics and Logic Programming. MIT Press, 1995."},{"key":"16_CR4","unstructured":"O. Danvy. Across the bridge between reflection and partial evaluation. In D. Bj\u00f8rner, A. P. Ershov, N. D. Jones (eds.), PEMC, 83\u2013116. North-Holland, 1988."},{"key":"16_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Partial Evaluation","year":"1996","unstructured":"O. Danvy, R. Gl\u00fcck, P. Thiemann (eds.). Partial Evaluation. Proceedings, LNCS 1110. Springer-Verlag, 1996."},{"issue":"10","key":"16_CR6","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/355598.362740","volume":"13","author":"J. Earley","year":"1970","unstructured":"J. Earley, H. Sturgis. A formalism for translator interactions. CACM, 13(10):607\u2013617, 1970.","journal-title":"CACM"},{"issue":"5","key":"16_CR7","first-page":"45","volume":"2","author":"Y. Futamura","year":"1971","unstructured":"Y. Futamura. Partial evaluation of computing process-an approach to a compilercompiler. Systems, Computers, Controls, 2(5):45\u201350, 1971.","journal-title":"Systems, Computers, Controls"},{"issue":"2\/3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01806112","volume":"9","author":"S. Jefferson","year":"1996","unstructured":"S. Jefferson, D. P. Friedman. A simple reflective interpreter. Lisp and Symbolic Computation, 9(2\/3):181\u2013202, 1996.","journal-title":"Lisp and Symbolic Computation"},{"key":"16_CR9","unstructured":"N. D. Jones, C. K. Gomard, P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993."},{"key":"16_CR10","unstructured":"S. N. Kamin. Programming Languages: An Interpreter-Based Approach. Addison-Wesley, 1990."},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1017\/S0956796800001465","volume":"5","author":"A. Kishon","year":"1995","unstructured":"A. Kishon, P. Hudak. Semantics directed program execution monitoring. Journal of Functional Programming, 5(4):501\u2013547, 1995.","journal-title":"Journal of Functional Programming"},{"key":"16_CR12","unstructured":"P. Lucas, P. Lauer, H. Stigleitner. Method and notation for the formal definition of programming languages. Technical report, IBM Lab Vienna, 1968."},{"issue":"4","key":"16_CR13","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/367177.367199","volume":"3","author":"J. McCarthy","year":"1960","unstructured":"J. McCarthy. Recursive functions of symb. expressions. CACM, 3(4):184\u2013195, 1960.","journal-title":"CACM"},{"issue":"2","key":"16_CR14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1093\/comjnl\/19.2.151","volume":"19","author":"F. G. Pagan","year":"1976","unstructured":"F. G. Pagan. On interpreter-oriented definitions of programming languages. Computer Journal, 19(2):151\u2013155, 1976.","journal-title":"Computer Journal"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"J. C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM Annual Conference, 717\u2013740. ACM, 1972.","DOI":"10.1145\/800194.805852"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01211087","volume":"9","author":"B. J. Ross","year":"1997","unstructured":"B. J. Ross. Running programs backwards: the logical inversion of imperative computation. Formal Aspects of Computing, 9:331\u2013348, 1997.","journal-title":"Formal Aspects of Computing"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"B. C. Smith. Reflection and semantics in Lisp. In POPL, 23\u201335. ACM Press, 1984.","DOI":"10.1145\/800017.800513"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"G. L. Steele. Building interpreters by composing monads. In POPL, 472\u2013492. ACM Press, 1994.","DOI":"10.1145\/174675.178068"},{"key":"16_CR19","unstructured":"G. L. Steele, G. J. Sussman. The art of the interpreter or, the modularity complex (parts zero, one, two). MIT AI Memo 453, MIT AI Laboratory, 1978."},{"key":"16_CR20","unstructured":"L. Sterling, E. Shapiro. The Art of Prolog. MIT Press, 1986."}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T00:40:14Z","timestamp":1558485614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 November 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}