{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:00:24Z","timestamp":1725512424899},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540713883"},{"type":"electronic","value":"9783540713890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71389-0_7","type":"book-chapter","created":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T20:22:53Z","timestamp":1183321373000},"page":"78-92","source":"Crossref","is-referenced-by-count":1,"title":["The Rewriting Calculus as a Combinatory Reduction System"],"prefix":"10.1007","author":[{"given":"Clara","family":"Bertolissi","sequence":"first","affiliation":[]},{"given":"Claude","family":"Kirchner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1145\/604131.604152","volume-title":"Principles of Programming Languages - POPL\u201903","author":"G. Barthe","year":"2003","unstructured":"Barthe, G., et al.: Pure Patterns Type Systems. In: Principles of Programming Languages - POPL\u201903, pp. 250\u2013261. ACM Press, New York (2003)"},{"key":"7_CR2","unstructured":"Bertolissi, C.: Developments in the rewriting calculus. Research Report INRIA & LORIA (2006), http:\/\/hal.inria.fr\/inria-00121212"},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10990-006-0479-z","volume":"19","author":"C. Bertolissi","year":"2006","unstructured":"Bertolissi, C., Cirstea, H., Kirchner, C.: Expressing combinatory reduction systems derivations in the rewriting calculus. Higher-Order and Symbolic Computation\u00a019(4), 345\u2013376 (2006)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"7_CR4","unstructured":"Brauner, P.: Un calcul des s\u00e9quents extensible. Master thesis, LORIA (2006)"},{"key":"7_CR5","unstructured":"Cirstea, H.: Calcul de r\u00e9\u00e9criture\u00a0: fondements et applications. Th\u00e8se de Doctorat d\u2019Universit\u00e9, Universit\u00e9 Henri Poincar\u00e9 - Nancy I (2000)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Cirstea, H., Faure, G., Kirchner, C.: A rho-calculus of explicit constraint application. In: Proc. of WRLA\u20192004. ENTCS, vol.\u00a0117 (2004)","DOI":"10.1016\/j.entcs.2004.06.029"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/3-540-49366-2_7","volume-title":"Advances in Computing Science - ASIAN\u201998","author":"H. Cirstea","year":"1998","unstructured":"Cirstea, H., Kirchner, C.: The rewriting calculus as a semantics of ELAN. In: Hsiang, J., Ohori, A. (eds.) ASIAN 1998. LNCS, vol.\u00a01538, pp. 8\u201310. Springer, Heidelberg (1998)"},{"issue":"3","key":"7_CR8","first-page":"427","volume":"9","author":"H. Cirstea","year":"2001","unstructured":"Cirstea, H., Kirchner, C.: The rewriting calculus \u2014 Part\u00a0I and II. Logic Journal of the Interest Group in Pure and Applied Logics\u00a09(3), 427\u2013498 (2001)","journal-title":"Logic Journal of the Interest Group in Pure and Applied Logics"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45127-7_8","volume-title":"Rewriting Techniques and Applications","author":"H. Cirstea","year":"2001","unstructured":"Cirstea, H., Kirchner, C., Liquori, L.: Matching Power. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 77\u201392. Springer, Heidelberg (2001)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Cirstea, H., et al.: Rewrite strategies in the rewriting calculus. In: Gramlich, B., Lucas, S. (eds.) Proceedings of WRS\u201903. ENTCS (June 2003)","DOI":"10.1016\/S1571-0661(05)82613-1"},{"key":"7_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11916277_5","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"G. Faure","year":"2006","unstructured":"Faure, G.: Matching Modulo Superdevelopments Application to Second-Order Matching. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 60\u201374. Springer, Heidelberg (2006)"},{"key":"7_CR12","unstructured":"Houtmann, C.: Coh\u00e9rence de la d\u00e9duction surnaturelle. Master thesis, LORIA (2006)"},{"key":"7_CR13","unstructured":"Huet, G.: R\u00e9solution d\u2019\u00e9quations dans les langages d\u2019ordre 1,2, ...,\u03c9. Th\u00e8se de Doctorat d\u2019Etat, Universit\u00e9 de Paris\u00a07 (France) (1976)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/11693024_8","volume-title":"Programming Languages and Systems","author":"B. Jay","year":"2006","unstructured":"Jay, B., Kesner, D.: Pure pattern calculus. In: Sestoft, P. (ed.) ESOP 2006 and ETAPS 2006. LNCS, vol.\u00a03924, pp. 100\u2013114. Springer, Heidelberg (2006)"},{"key":"7_CR15","unstructured":"Klop, J.W.: Combinatory Reduction Systems. PhD thesis, CWI (1980)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","volume":"121","author":"J.W. Klop","year":"1993","unstructured":"Klop, J.W., van Oostrom, V., van Raamsdonk, F.: Combinatory Reduction Systems: Introduction and Survey. Theoretical Computer Science\u00a0121, 279\u2013308 (1993)","journal-title":"Theoretical Computer Science"},{"key":"7_CR17","first-page":"167","volume-title":"Proc. of PPDP\u201904","author":"L. Liquori","year":"2004","unstructured":"Liquori, L., Serpette, B.: iRho: an Imperative Rewriting Calculus. In: Proc. of PPDP\u201904, pp. 167\u2013178. ACM Press, New York (2004)"},{"key":"7_CR18","unstructured":"Melli\u00e8s, P.-A.: Description Abstraite des Syst\u00e8mes de R\u00e9\u00e9criture. PhD thesis, Universit\u00e9 Paris 7 (1996)"},{"key":"7_CR19","unstructured":"van Oostrom, V.: Lambda calculus with patterns. Technical report, Vrije Universiteit, Amsterdam (Nov. 1990)"},{"key":"7_CR20","unstructured":"van Oostrom, V.: Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam (1994)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/3-540-58233-9_13","volume-title":"Higher-Order Algebra, Logic, and Term Rewriting","author":"V. Oostrom van","year":"1994","unstructured":"van Oostrom, V., van Raamsdonk, F.: Comparing combinatory reduction systems and higher-order rewrite systems. In: Heering, J., et al. (eds.) HOA 1993. LNCS, vol.\u00a0816, pp. 276\u2013304. Springer, Heidelberg (1994)"},{"key":"7_CR22","unstructured":"Wack, B.: Typage et d\u00e9duction dans le calcul de r\u00e9\u00e9criture. Th\u00e8se de doctorat, Universit\u00e9 Henri Poincar\u00e9 - Nancy I (Oct. 2005)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71389-0_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:19:41Z","timestamp":1605763181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71389-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540713883","9783540713890"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71389-0_7","relation":{},"subject":[]}}