{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:07:29Z","timestamp":1649102849203},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1007\/bf01293598","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T22:09:21Z","timestamp":1111702161000},"page":"401-426","source":"Crossref","is-referenced-by-count":5,"title":["Relating graph and term rewriting via B\u00f6hm models"],"prefix":"10.1007","volume":"7","author":[{"given":"Zena M.","family":"Ariola","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01293598_CR1","unstructured":"Ariola, Z. M.: An Algebraic Approach to the Compilation and Operational Semantics of Functional Languages with I-structures. PhD thesis, MIT Technical Report TR-544, 1992"},{"key":"BF01293598_CR2","doi-asserted-by":"crossref","unstructured":"Ariola, Z. M., Arvind, P-TAC: A parallel intermediate language. In: Proc. ACM Conference on Functional Programming Languages and Computer Architecture, London, September 1989","DOI":"10.1145\/99370.99388"},{"key":"BF01293598_CR3","volume-title":"Lecture Notes in Computer Science vol. 589","author":"Z. M. Ariola","year":"1991","unstructured":"Ariola, Z. M., Arvind: Compilation of Id. In: Proc of the Fourth Workshop on Languages and Compilers for Parallel Computing, Santa Clara, California. Lecture Notes in Computer Science vol. 589. Berlin, Heidelberg, New York: Springer August 1991"},{"key":"BF01293598_CR4","volume-title":"Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation","author":"Z. M. Ariola","year":"1991","unstructured":"Ariola, Z. M., Arvind: A syntactic approach to program transformations. In: Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, Yale University, New Haven, CT, June 1991"},{"key":"BF01293598_CR5","first-page":"77","volume-title":"Term Graph Rewriting: Theory and Practice","author":"Z. M. Ariola","year":"1993","unstructured":"Ariola, Z. M. Arvind: Graph rewriting systems for efficient compilation. In: Sleep, M. R. Plasmeijer, M. I., van Eekelen, M. C. D. J., (eds) Term Graph Rewriting: Theory and Practice, pp 77\u201390. New York: John Wiley 1993"},{"key":"BF01293598_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(94)00185-L","volume":"146","author":"Z. M. Ariola","year":"1995","unstructured":"Ariola, Z. M. Arvind: Properties of a first-order functional language with sharing. Theoretical Computer Science.146, 69\u2013108 (1995)","journal-title":"Theoretical Computer Science"},{"key":"BF01293598_CR7","unstructured":"Ariola, Z. M., Braun, C., Klop, J. W.: A graph rewriting system to express state and sequentialization in a parallel setting. In: Proc. 5th International Workshop of Graph Grammars and their Application to Computer Science, Williamsburg, Virgina, 1994"},{"key":"BF01293598_CR8","unstructured":"Ariola, Z. M., Klop, J. W.: Equational term graph rewriting. To appear in Fundamenta Informaticae. Extended version: CWI Report CS-R9552. 1995"},{"key":"BF01293598_CR9","doi-asserted-by":"crossref","unstructured":"Barendregt, H., Brus, T., van Eekelen, M., Glauert, J., Kennaway, J., van Lee, M., Plasmeijer, M., Sleep, M. R.: Towards an intermediate language based on graph rewriting. In: Proc. Conference on Parallel Architecture and Languages Europe (PARLE '87), Eindhoven, The Netherlands, Lecture Notes in Computer Science vol. 259. Berlin, Heildelberg, New York 1987","DOI":"10.1007\/3-540-17945-3_9"},{"key":"BF01293598_CR10","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. P. Barendreg","year":"1984","unstructured":"Barendreg, H. P.: The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam, 1984"},{"key":"BF01293598_CR11","volume-title":"Lecture Notes in Computer Science","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. Sleep, M. R.: Term graph rewriting. In: de Bakker, J. W., Nijman, A. J., Treleaven, P. C. (eds), Proc. Conference on Parallel Architecture and Languages Europe (PARLE '87), Eindhoven. The Netherlands, Lecture Notes in Computer Science. Berlin, Heildelberg, New York: Springer 1987"},{"key":"BF01293598_CR12","first-page":"1","volume":"73","author":"H. Ehrig","year":"1989","unstructured":"Ehrig, H.: Introduction to the algebraic theory of graph grammars. In Proc. 1st International Workshop on Graph Grammars and their Application to Computer Science. Lecture Notes in Computer Science vol. 73, pp 1\u201369, Berlin, Heidelberg, New York 1989","journal-title":"Proc. 1st International Workshop on Graph Grammars and their Application to Computer Science. Lecture Notes in Computer Science"},{"key":"BF01293598_CR13","volume-title":"Lecture Notes in Computer Science vol. 153","year":"1983","unstructured":"Ehrig, H., Nagl, M., Rozenberg, G. (eds.): Proc. 2nd International Workshop on Graph Grammars and their Application to Computer Science, Haus Ohrbeck, Germany, Lecture Notes in Computer Science vol. 153. Berlin, Heidelberg, New York: Springer 1983"},{"key":"BF01293598_CR14","volume-title":"Lecture Notes in Computer Science vol. 291","year":"1987","unstructured":"Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.): 3rd International Workshop on Graph Grammers and their Application to Computer Science, Warrenton, Virginia, USA. Lecture Notes in Computer Science vol. 291. Berlin, Heidelberg, New York: Springer 1987"},{"key":"BF01293598_CR15","volume-title":"Lecture Notes in Computer Science vol. 532","year":"1991","unstructured":"Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.): Proc. 4th International Workshop on Graph Grammars and their Application to Computer Science, Bremen, Germany. Lecture Notes in Computer Science vol. 532. Berlin, Heidelberg, New York: Springer 1991"},{"issue":"1","key":"BF01293598_CR16","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/77606.77612","volume":"12","author":"W. M. Farmer","year":"1990","unstructured":"Farmer, W. M.: A correctness proof for combinator reduction with cycles. ACM Transactions on Programming Languages and Systems12(1), 123\u2013134 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"BF01293598_CR17","first-page":"13","volume-title":"Lecture Notes in Computer Science vol. 488","author":"W. M. Farmer","year":"1991","unstructured":"Farmer, W. M., Watro, R. J.: Redex capturing in term graph rewriting. In: Book, R. V. (ed) Proc. 4th International Conference on Rewriting Techniques and Applications (RTA-91), Como, Italy, Lecture Notes in Computer Science vol. 488, pp 13\u201324. Berlin, Heildelberg, New York: Springer 1991"},{"key":"BF01293598_CR18","first-page":"378","volume-title":"Lecture Notes in Computer Science vol. 532","author":"J. R. W. Glauert","year":"1990","unstructured":"Glauert, J. R. W., Kennaway, J. R., Sleep, M. R.: Dactl: An experimental graph rewriting language. In: Proc. 4th International Workshop on Graph Grammars and their Application to Computer Science, Bremen, Germany. Lecture Notes in Computer Science vol. 532, pp 378\u2013395. Berlin, Heidelberg, New York: Springer 1990"},{"key":"BF01293598_CR19","unstructured":"Hennessy, M.: Algebraic Theory of Processes. MIT Press, 1988"},{"issue":"5","key":"BF01293598_CR20","first-page":"1","volume":"27","author":"P. Hudak","year":"1992","unstructured":"Hudak, P., Peyton Jones, S., Wadler, P., Boutel, B., Fairbairn, J., Fasel, J., Hammond, K., Hughes, J., Johnsson, T., Kieburtz, D., Nikhil, R., Partain, W., Peterson, J.: Report on the programming language Haskell, ACM SIGPLAN Notice,27(5), 1\u201364 (1992)","journal-title":"ACM SIGPLAN Notice"},{"key":"BF01293598_CR21","unstructured":"Huet, G., Levy, J.-J.: Computations in orthogonal rewriting systems 1 and 2. In: Computa tional logic. Essays in Honor of Alan Robinson. J.-L. Lassez G. D. Plotkin, 1991 (eds.)"},{"key":"BF01293598_CR22","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(87)90079-X","volume":"52","author":"J. R. Kennaway","year":"1987","unstructured":"Kennaway, J. R.: On graph rewriting. Theoretical Computer Science52, 37\u201358 (1987)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"BF01293598_CR23","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1145\/177492.177577","volume":"16","author":"J. R. Kennaway","year":"1994","unstructured":"Kennaway, J. R., Klop, J. W., Sleep, M. R., de Vries, F. J.: The adequacy of term graph re writing for simulating term rewriting. Trans. Programming Languages Sys.16(3), 493\u2013523 (1994)","journal-title":"Trans. Programming Languages Sys."},{"key":"BF01293598_CR24","doi-asserted-by":"crossref","unstructured":"Kennaway, J. R., Klop, J. W., Sleep, M. R., deVries, F. I.: Transfinite reductions in orthogonal term rewriting systems. Information and Computation119 (1) (1995)","DOI":"10.1006\/inco.1995.1075"},{"key":"BF01293598_CR25","unstructured":"Klop, J. W.: Term rewriting systems. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic Computer Science, vol. II, pp 1\u2013116, Oxford University Press, 1992"},{"key":"BF01293598_CR26","unstructured":"L\u00e9vy, J.-J.: R\u00e9ductions Correctes et Optimales dans le Lambda-Calcul. PhD thesis, Universite Paris VII, October 1978"},{"key":"BF01293598_CR27","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(93)90068-5","volume":"109","author":"M. L\u00f6we","year":"1993","unstructured":"L\u00f6we, M.: Algebraic approach to single pushout graph transformation. Theoret Comput Sci109, 181\u2013224 (1993)","journal-title":"Theoret Comput Sci"},{"key":"BF01293598_CR28","volume-title":"Technical Report CSG Memo 284-2","author":"R. S. Nikhil","year":"1991","unstructured":"Nikhil, R. S. Id (Version 90.1) Reference Manual, Technical Report CSG Memo 284-2, MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA 02139, USA, July 1991"},{"key":"BF01293598_CR29","unstructured":"Plasmeijer, M. J., van Eekelen, M. C. D. J.: Functional Programming and Parallel Graph Rewriting. Addision Wesley 1993"},{"key":"BF01293598_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(84)90021-5","volume":"32","author":"J. C. Raoult","year":"1984","unstructured":"Raoult, J. C.: On graph rewritings. Theoretical Computer Science32, 1\u201324 (1984)","journal-title":"Theoretical Computer Science"},{"key":"BF01293598_CR31","volume-title":"Term Graph Rewriting: Theory and Practice","author":"M. R. Sleep","year":"1993","unstructured":"Sleep, M. R., Plasmeijer, M. J., vanEekelen, M. C. D. J.: Term Graph Rewriting: Theory and Practice. New York: John Wiley 1993"},{"key":"BF01293598_CR32","unstructured":"Smetsers, J. E. W.: Graph Rewriting and Functional Languages. PhD thesis, University of Nijmegen 1993"},{"key":"BF01293598_CR33","unstructured":"Wadsworth, C.: Semantics and Pragmatics of the Lambda-Calculus. 1971. PhD thesis, University of Oxford"},{"key":"BF01293598_CR34","doi-asserted-by":"crossref","unstructured":"Wadsworth, C.: The relation between computational and denotational properties for scott's d\u221e-models of the lambda-calculus. Theoretical Computer Science5 (1976)","DOI":"10.1137\/0205036"},{"key":"BF01293598_CR35","doi-asserted-by":"crossref","unstructured":"Wadsworth, C.: Approximate reduction and lambda calculus models. Theoretical Computer Science7 (1978)","DOI":"10.1137\/0207028"},{"key":"BF01293598_CR36","series-title":"Lecture Notes in Computer Science vol. 37","volume-title":"\u03bb-Calculus and Computer Science Theory, Italy","author":"P. Welch","year":"1975","unstructured":"Welch, P.: Continuous semantics and inside-out reductions. In \u03bb-Calculus and Computer Science Theory, Italy. Lecture Notes in Computer Science vol. 37. Berlin, Heidelberg, New York: Springer 1975"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293598.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01293598\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:36:10Z","timestamp":1586180170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01293598"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF01293598"],"URL":"https:\/\/doi.org\/10.1007\/bf01293598","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}