{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:45Z","timestamp":1761611265196},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540214021"},{"type":"electronic","value":"9783540247548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24754-8_20","type":"book-chapter","created":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T20:28:24Z","timestamp":1278534504000},"page":"276-290","source":"Crossref","is-referenced-by-count":8,"title":["Basic Pattern Matching Calculi: a Fresh View on Matching Failure"],"prefix":"10.1007","author":[{"given":"Wolfram","family":"Kahl","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Aczel, P.: A general Church-Rosser theorem. unpublished note, see [20] (1978)"},{"key":"20_CR2","volume-title":"POPL 2003","author":"G. Barthe","year":"2003","unstructured":"Barthe, G., et al.: Pure Patterns Type Systems. In: POPL 2003, ACM, New York (2003)"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1109\/LICS.1993.287581","volume-title":"Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science","author":"V. Breazu-Tannen","year":"1993","unstructured":"Breazu-Tannen, V., Kesner, D., Puel, L.: A Typed Pattern Calculus. In: Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, Montreal, Canada, pp. 262\u2013274. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"20_CR4","first-page":"95","volume-title":"Frontiers of Combining Systems 2","author":"H. Cirstea","year":"1999","unstructured":"Cirstea, H., Kirchner, C.: Combining Higher-Order and First-Order Computation Using \u03c1-calculus: Towards a semantics of ELAN. In: Gabbay, D., de Rijke, M. (eds.) Frontiers of Combining Systems 2, October 1998, pp. 95\u2013120. Wiley, Chichester (1999)"},{"key":"20_CR5","first-page":"427","volume":"9","author":"H. Cirstea","year":"2001","unstructured":"Cirstea, H., Kirchner, C.: The rewriting calculus \u2014 Part I 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":"20_CR6","doi-asserted-by":"crossref","unstructured":"Erwig, M., Jones, S.P.: Pattern Guards and Transformational Patterns. In: Haskell Workshop 2000. ENTCS, vol.\u00a041(1), pp. 12.1\u201312.27 (2001)","DOI":"10.1016\/S1571-0661(05)80540-7"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-45610-4_6","volume-title":"Rewriting Techniques and Applications","author":"G. Faure","year":"2002","unstructured":"Faure, G., Kirchner, C.: Exceptions in the rewriting calculus. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, pp. 66\u201382. Springer, Heidelberg (2002)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-44881-0_9","volume-title":"Rewriting Techniques and Applications","author":"J. Forest","year":"2003","unstructured":"Forest, J., Kesner, D.: Expression Reduction Systems with Patterns. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 107\u2013122. Springer, Heidelberg (2003)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-45442-X_6","volume-title":"Mathematics of Program Construction","author":"W.L. Harrison","year":"2002","unstructured":"Harrison, W.L., Sheard, T., Hook, J.: Fine Control of Demand in Haskell. In: Boiten, E.A., M\u00f6ller, B. (eds.) MPC 2002. LNCS, vol.\u00a02386, p. 68. Springer, Heidelberg (2002)"},{"key":"20_CR10","unstructured":"Kahl, W.: Basic Pattern Matching Calculi: Syntax, Reduction, Confluence, and Normalisation. SQRL Rep. 16, Software Quality Res. Lab., McMaster Univ. (2003)"},{"key":"20_CR11","unstructured":"Klop, J.W.: Combinatory Reduction Systems. Mathematical Centre Tracts 127, Centre for Mathematics and Computer Science, Amsterdam, PhD thesis (1980)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/507635.507641","volume-title":"ICFP 2001","author":"F. Fessant Le","year":"2001","unstructured":"Le Fessant, F., Maranget, L.: Optimizing Pattern Matching. In: Leroy, X. (ed.) ICFP 2001, pp. 26\u201337. ACM, New York (2001)"},{"key":"20_CR13","unstructured":"Maranget, L.: Two Techniques for Compiling Lazy Pattern Matching. Technical Report RR 2385, INRIA (1994)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-46028-4_4","volume-title":"Implementation of Functional Languages","author":"M. Mol de","year":"2002","unstructured":"de Mol, M., van Eekelen, M., Plasmeijer, R.: Theorem Proving for Functional Programmers \u2014 Sparkle: A Functional Theorem Prover. In: Arts, T., Mohnen, M. (eds.) IFL 2002. LNCS, vol.\u00a02312, pp. 55\u201371. Springer, Heidelberg (2002)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL \u2014 A Proof Assistant for Higher-Order Logic","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"20_CR16","unstructured":"van Oostrom, V.: Lambda Calculus with Patterns. Technical Report IR 228, Vrije Universiteit, Amsterdam (1990)"},{"key":"20_CR17","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., Meinke, K., M\u00f6ller, B., Nipkow, T. (eds.) HOA 1993. LNCS, vol.\u00a0816, pp. 276\u2013304. Springer, Heidelberg (1994)"},{"key":"20_CR18","volume-title":"The Implementation of Functional Programming Languages","author":"S.L. Peyton Jones","year":"1987","unstructured":"Peyton Jones, S.L.: The Implementation of Functional Programming Languages. Prentice-Hall, Englewood Cliffs (1987)"},{"key":"20_CR19","series-title":"International Computer Science Series","volume-title":"Functional Programming and Parallel Graph Rewriting","author":"R. Plasmeijer","year":"1993","unstructured":"Plasmeijer, R., van Eekelen, M.: Functional Programming and Parallel Graph Rewriting. International Computer Science Series. Addison-Wesley, Reading (1993)"},{"key":"20_CR20","first-page":"588","volume-title":"Term Rewriting Systems","author":"F. Raamsdonk van","year":"2003","unstructured":"van Raamsdonk, F.: Higher-order Rewriting. In: Terese (ed.) Term Rewriting Systems,\u00a0ch. 11, pp. 588\u2013667. Cambridge Univ. Press, Cambridge (2003)"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-46584-7_1","volume-title":"Practical Aspects of Declarative Languages","author":"M. Tullsen","year":"2000","unstructured":"Tullsen, M.: First Class Patterns. In: Pontelli, E., Santos Costa, V. (eds.) PADL 2000. LNCS, vol.\u00a01753, pp. 1\u201315. Springer, Heidelberg (2000)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-45127-7_23","volume-title":"Rewriting Techniques and Applications","author":"R. Vestergaard","year":"2001","unstructured":"Vestergaard, R., Brotherston, J.: A Formalised First-Order Confluence Proof for the \u03bb-Calculus using One-Sorted Variable Names. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 306\u2013321. Springer, Heidelberg (2001)"},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1145\/41625.41653","volume-title":"POPL 1987","author":"P. Wadler","year":"1987","unstructured":"Wadler, P.: Views: A Way for Pattern Matching to Cohabit with Data Abstraction. In: Munchnik, S. (ed.) POPL 1987, pp. 307\u2013313. ACM Press, New York (1987)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24754-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T14:35:03Z","timestamp":1552833303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24754-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540214021","9783540247548"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24754-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}