{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:45Z","timestamp":1725489345204},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_8","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"78-92","source":"Crossref","is-referenced-by-count":2,"title":["Confluence of Pattern-Based Calculi"],"prefix":"10.1007","author":[{"given":"Horatiu","family":"Cirstea","sequence":"first","affiliation":[]},{"given":"Germain","family":"Faure","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(94)90209-7","volume":"122","author":"H. Ait-Kaci","year":"1994","unstructured":"Ait-Kaci, H., Podelski, A., Smolka, G.: A feature constraint system for logic programming with entailment. Theoretical Computer Science\u00a0122(1-2), 263\u2013283 (1994)","journal-title":"Theoretical Computer Science"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/11805618_14","volume-title":"Term Rewriting and Applications","author":"A. Arbiser","year":"2006","unstructured":"Arbiser, A., Miquel, A., R\u00edos, A.: A lambda-calculus with constructors. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 181\u2013196. Springer, Heidelberg (2006)"},{"key":"8_CR3","unstructured":"Barendregt, H.: The Lambda-Calculus, its syntax and semantics. Studies in Logic and the Foundation of Mathematics. North Holland, 2nd edn. (1984)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1145\/604131.604152","volume-title":"30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2003","author":"G. Barthe","year":"2003","unstructured":"Barthe, G., Cirstea, H., Kirchner, C., Liquori, L.: Pure Patterns Type Systems. In: 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2003, New Orleans, USA, pp. 250\u2013261. ACM, New York (2003)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"FOSSACS 2007","author":"C. Bertolissi","year":"2007","unstructured":"Bertolissi, C., Kirchner, C.: The rewriting calculus as a combinatory reduction system. In: Siedl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, Springer, Heidelberg (2007)"},{"key":"8_CR6","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, 427\u2013498 (2001)","journal-title":"Logic Journal of the Interest Group in Pure and Applied Logics"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-540-24849-1_10","volume-title":"Types for Proofs and Programs","author":"H. Cirstea","year":"2004","unstructured":"Cirstea, H., Liquori, L., Wack, B.: Rewriting calculus with fixpoints: Untyped and first-order systems. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol.\u00a03085, pp. 147\u2013161. Springer, Heidelberg (2004)"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1145\/226643.226675","volume":"43","author":"P.-L. Curien","year":"1996","unstructured":"Curien, P.-L., Hardin, T., L\u00e9vy, J.-J.: Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM (JACM)\u00a043(2), 362\u2013397 (1996)","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C.M. Hoffmann","year":"1982","unstructured":"Hoffmann, C.M., O\u2019Donnell, M.J.: Pattern matching in trees. Journal of the ACM\u00a029(1), 68\u201395 (1982)","journal-title":"Journal of the ACM"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/11693024_8","volume-title":"European Symposium on Programming \u2013 ESOP 2006","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)"},{"issue":"1-2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(98)00166-2","volume":"238","author":"D. Kesner","year":"2000","unstructured":"Kesner, D.: Confluence of extensional and non-extensional lambda-calculi with explicit substitutions. Theoritical Computer Science\u00a0238(1-2), 183\u2013220 (2000)","journal-title":"Theoritical Computer Science"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"European Symposium on Programming \u2013 ESOP 2007","author":"C. Kirchner","year":"2007","unstructured":"Kirchner, C., Kopetz, R., Moreau, P.-E.: Anti-pattern matching. In: European Symposium on Programming \u2013 ESOP 2007, Braga, Portugal. LNCS, Springer, Heidelberg (2007)"},{"key":"8_CR13","unstructured":"Klop, J.W.: Combinatory Reduction Systems. Ph.D. thesis, Mathematisch Centrum, Amsterdam (1980)"},{"key":"8_CR14","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"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM Journal of Computing\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM Journal of Computing"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Liquori, L., Honsell, F., Lenisa, M.: A framework for defining logical frameworks (2007) (submitted)","DOI":"10.1016\/j.entcs.2007.02.014"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(97)00143-6","volume":"192","author":"R. Mayr","year":"1998","unstructured":"Mayr, R., Nipkow, T.: Higher-order rewrite systems and their confluence. Theoretical Comput. Sci.\u00a0192, 3\u201329 (1998)","journal-title":"Theoretical Comput. Sci."},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-45610-4_4","volume-title":"Rewriting Techniques and Applications","author":"P.-A. Melli\u00e8s","year":"2002","unstructured":"Melli\u00e8s, P.-A.: Axiomatic rewriting theory VI residual theory revisited. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, pp. 24\u201350. Springer, Heidelberg (2002)"},{"key":"8_CR19","volume-title":"The implementation of functional programming languages","author":"S. Peyton-Jones","year":"1987","unstructured":"Peyton-Jones, S.: The implementation of functional programming languages. Prentice Hall, Inc., Englewood Cliffs (1987)"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1006\/inco.1995.1057","volume":"118","author":"M. Takahashi","year":"1995","unstructured":"Takahashi, M.: Parallel reductions in \u03bb-calculus. Information and Compututation\u00a0118, 120\u2013127 (1995)","journal-title":"Information and Compututation"},{"key":"8_CR21","volume-title":"Term Rewriting Systems","author":"Terese","year":"2002","unstructured":"Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2002)"},{"key":"8_CR22","unstructured":"The Maude Team. The Maude Home Page, http:\/\/maude.cs.uiuc.edu\/"},{"key":"8_CR23","unstructured":"The Tom Team. The Tom language, http:\/\/tom.loria.fr\/"},{"key":"8_CR24","unstructured":"van Oostrom, V.: Lambda calculus with patterns. Technical report, Vrije Universiteit, Amsterdam (November 1990)"},{"issue":"1","key":"8_CR25","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1137\/0219005","volume":"19","author":"H. Yokouchi","year":"1990","unstructured":"Yokouchi, H., Hikita, T.: A rewriting system for categorical combinators with multiple arguments. SIAM Journal on Computing\u00a019(1), 78\u201397 (1990)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:37Z","timestamp":1619518357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}