{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:33:52Z","timestamp":1728174832378},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019021X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0026099","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:47:21Z","timestamp":1132645641000},"page":"102-116","source":"Crossref","is-referenced-by-count":4,"title":["Implementing term rewrite languages in Dactl"],"prefix":"10.1007","author":[{"given":"J. R.","family":"Kennaway","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","first-page":"613","volume":"21","author":"J. Backus","year":"1978","unstructured":"Backus, J. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Comm. A.C.M., 21, 613\u2013641, (1978).","journal-title":"Comm. A.C.M."},{"key":"8_CR2","unstructured":"Barendregt, H.P. The Lambda Calculus. (North-Holland, 1984)"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume":"259","author":"H.P. Barendregt","year":"1987","unstructured":"Barendregt, H.P., van Eekelen, M.C.J.D., Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J., and Sleep, M.R. Term Graph Rewriting. Proc. PARLE Conference, Lecture Notes in Computer Science 259, 141\u2013158, (Springer, 1987).","journal-title":"Lecture Notes in Computer Science"},{"key":"8_CR4","volume-title":"Conditional rewrite rules: confluency and termination. Report IW 198\/82","author":"J.A. Bergstra","year":"1982","unstructured":"Bergstra, J.A., and Klop, J.W. Conditional rewrite rules: confluency and termination. Report IW 198\/82, Stichting Mathematisch Centrum, Amsterdam, 1982."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Berry, Stable models of typed lambda-calculi, in Proc. 5th Int. Conf. on Automata, Languages, and Programming, eds. G. Ausiello and C B\u00f6hm. Lecture Notes in Computer Science 62 (Springer, 1978).","DOI":"10.1007\/3-540-08860-1"},{"key":"8_CR6","unstructured":"Brus, T.H., van Eekelen, M.C.J.D., van Leer, M.O., and Plasmeijer, M.J. Clean: a language for functional graph rewriting. Internal report 95, Computing Science Department, University of Nijmegen, (1987)."},{"key":"8_CR7","unstructured":"Burstall, R.M., MacQueen, D.B., and Sannella, D.T. HOPE: an experimental applicative language. Report CSR-62-80, Department of Computer Science, University of Edinburgh, (1980)."},{"key":"8_CR8","unstructured":"Glauert, J.R.W., Kennaway, J.R., and Sleep, M.R. Dactl: a computational model and compiler target language. University of East Anglia, (1987)."},{"key":"8_CR9","unstructured":"Glauert, J.R.W., Kennaway, J.R., Sleep, M.R., Holt, N., Reeve, M., and Watson, I. Specification of Core Dactl1. University of East Anglia, (1987)."},{"key":"8_CR10","unstructured":"Glauert, J.R.W., Kennaway, J.R., Sleep, M.R., Holt, N., Reeve, M., and Watson, I. Dactl Language Specification. University of East Anglia, (to appear, 1987)."},{"key":"8_CR11","unstructured":"Huet, G, and L\u00e9vy, J.J. Call by need computations in non-ambiguous term rewriting systems. Report 359, IRIA, (1979)."},{"key":"8_CR12","unstructured":"Huet, G. and Oppen, Equations and rewrite rules: a survey. Report CSL-111, SRI International, (1980)."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Laville, A. Lazy pattern-matching in the ML language. Report 664, INRIA, (1987).","DOI":"10.1007\/3-540-18625-5_64"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Milner, R. A proposal for standard ML, in Proc. ACM Conf. on Lisp and Functional Programming, 184\u2013197, (1984)","DOI":"10.1145\/800055.802035"},{"key":"8_CR15","unstructured":"Peyton-Jones, S.L. The Implementation of Functional Programming Languages. (Prentice-Hall, 1987)."},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Turner, D.A. Miranda: a non-strict language with polymorphic types. in Proc. Conf. on Functional Programming Languages and Computer Architecture, ed. J.P. Jouannaud, Lecture Notes in Computer Science 201, (Springer, 1985).","DOI":"10.1007\/3-540-15975-4_26"}],"container-title":["Lecture Notes in Computer Science","CAAP '88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026099.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:55:52Z","timestamp":1607550952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019021X"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0026099","relation":{},"subject":[]}}