{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:45:56Z","timestamp":1725453956669},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540123105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0000100","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T10:17:45Z","timestamp":1128507465000},"page":"82-101","source":"Crossref","is-referenced-by-count":1,"title":["Church-Rosser properties for graph replacement systems with unique splitting"],"prefix":"10.1007","author":[{"given":"H.","family":"Ehrig","sequence":"first","affiliation":[]},{"given":"J.","family":"Staples","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Introduction to the algebraic theory of graph grammars, in \u201cGraph-Grammars and their Application to Computer Science and Biology\u201d, editors V.Claus, H.Ehrig and G.Rozenberg, Springer Lecture Notes in Computer Science 73 (1979), 1\u201369.","DOI":"10.1007\/BFb0025714"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01752403","volume":"14","author":"H. Ehrig","year":"1981","unstructured":"Ehrig, H., Kreowski, H.-J., Maggiolo-Schettini, A., Rosen, B.K. and Winkowski, J., Transformations of structures: an algebraic approach, Math. System Theory 14 (1981) 305\u2013334.","journal-title":"Math. System Theory"},{"key":"6_CR3","volume-title":"Introduction to Combinatory Logic","author":"R. Hindley","year":"1972","unstructured":"Hindley, R., Lercher, B., and Seldin, J.P., Introduction to Combinatory Logic, CUP, London and New York, 1972."},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1090\/S0002-9947-1978-0489603-9","volume":"240","author":"R. Hindley","year":"1978","unstructured":"Hindley, R., Reductions of residuals are finite, Trans. Amer. Math. Soc. 240 (1978) 345\u2013361.","journal-title":"Trans. Amer. Math. Soc."},{"key":"6_CR5","unstructured":"L\u00e9vy, J.-J., R\u00e9ductions correctes et optimales dans the \u03bb-calcul, Th\u00e8se, U. Paris VII, 1978."},{"key":"6_CR6","unstructured":"L\u00e9vy, J.-J. Optimal reductions in the lambda calculus, in \u201cTo H.B. Curry: essays in combinatory logic, lambda calculus and formalism,\u201d editors J.P. Seldin and J.R.Hindley, Academic Press, 1980, 159\u2013191."},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B.K. Rosen","year":"1973","unstructured":"Rosen, B.K., Tree-manipulating systems and Church-Rosser theorems, Journ. ACM 20 (1973) 160\u2013187.","journal-title":"Journ. ACM"},{"key":"6_CR8","first-page":"201","volume":"3","author":"J. Staples","year":"1981","unstructured":"Staples, John, A new technique for analysing parameter passing, applied to the lambda calculus, Aust. Comp. Sci. Commun 3 (1981) 201\u2013210.","journal-title":"Aust. Comp. Sci. Commun"}],"container-title":["Lecture Notes in Computer Science","Graph-Grammars and Their Application to Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0000100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T14:43:15Z","timestamp":1607352195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0000100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540123105"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0000100","relation":{},"subject":[]}}