{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T00:10:32Z","timestamp":1771891832876,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540713142","type":"print"},{"value":"9783540713166","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71316-6_8","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:58:28Z","timestamp":1184605108000},"page":"95-109","source":"Crossref","is-referenced-by-count":7,"title":["On the Implementation of Construction Functions for Non-free Concrete Data Types"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Blanqui","sequence":"first","affiliation":[]},{"given":"Th\u00e9r\u00e8se","family":"Hardin","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Weis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0747-7171(87)80027-5","volume":"3","author":"D. Benanav","year":"1987","unstructured":"Benanav, D., Kapur, D., Narendran, P.: Complexity of matching problems. J. of Symbolic Computation\u00a03(1-2), 203\u2013216 (1987)","journal-title":"J. of Symbolic Computation"},{"key":"8_CR2","volume-title":"Computational problems in abstract algebra","author":"P. Bendix","year":"1970","unstructured":"Bendix, P., Knuth, D.: Simple word problems in universal algebra. In: Leech, J. (ed.) Computational problems in abstract algebra, Pergamon Press, Oxford (1970)"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1017\/S095679680000068X","volume":"3","author":"F. Burton","year":"1993","unstructured":"Burton, F., Cameron, R.: Pattern matching with abstract data types. J. of Functional Programming\u00a03(2), 171\u2013190 (1993)","journal-title":"J. of Functional Programming"},{"key":"8_CR4","unstructured":"Burton, W., et al.: Views: An extension to Haskell pattern matching (1996), http:\/\/www.haskell.org\/extensions\/views.html"},{"key":"8_CR5","series-title":"Research notes in theoretical computer science","volume-title":"Canonical forms in finitely presented algebras","author":"P. Chenadec Le","year":"1986","unstructured":"Le Chenadec, P.: Canonical forms in finitely presented algebras. Research notes in theoretical computer science. Pitman, London (1986)"},{"key":"8_CR6","unstructured":"Contejean, E., et al.: CiME version 2.02. LRI, CNRS UMR 8623, Universit\u00e9 Paris-Sud, France (2004), http:\/\/cime.lri.fr\/"},{"key":"8_CR7","unstructured":"Coq Development Team: The Coq Proof Assistant Reference Manual, Version 8.0. INRIA, France (2006), http:\/\/coq.inria.fr\/"},{"key":"8_CR8","volume-title":"Handbook of Theoretical Computer Science, vol. B","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, North-Holland, Amsterdam (1990)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Doligez, D.: Zenon, version 0.4.1 (2006), http:\/\/focal.inria.fr\/zenon\/","DOI":"10.1016\/S1365-6937(06)71158-3"},{"key":"8_CR10","unstructured":"Doligez, D., et al.: The Objective Caml system release 3.09, Documentation and user\u2019s manual. INRIA, France (2005), http:\/\/caml.inria.fr\/"},{"key":"8_CR11","volume-title":"Haskell 98 Language and Libraries, The revised report","author":"S.P. Jones","year":"2003","unstructured":"Jones, S.P.: Haskell 98 Language and Libraries, The revised report. Cambridge University Press, Cambridge (2003)"},{"key":"8_CR12","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Automated Deduction \u2013 CADE-19","author":"J.-M. Gaillourdet","year":"2003","unstructured":"Gaillourdet, J.-M., et al.: The new Waldmeister loop at work. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, Springer, Heidelberg (2003)"},{"key":"8_CR13","unstructured":"Hullot, J.-M.: Compilation de formes canoniques dans les th\u00e9ories \u00e9quationnelles. PhD thesis, Universit\u00e9 Paris 11, France (1980)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Term Rewriting and Applications","author":"J.-P. Jouannaud","year":"2006","unstructured":"Jouannaud, J.-P.: Modular church-rosser modulo. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, Springer, Heidelberg (2006)"},{"key":"8_CR15","unstructured":"Moreau, P.-E., et al.: Tom Manual version 2.3. INRIA & LORIA, Nancy, France (2006), http:\/\/tom.loria.fr\/"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Compiler Construction","author":"P.-E. Moreau","year":"2003","unstructured":"Moreau, P.-E., Ringeissen, C., Vittek, M.: A pattern matching compiler for multiple target languages. In: Hedin, G. (ed.) CC 2003 and ETAPS 2003. LNCS, vol.\u00a02622, Springer, Heidelberg (2003)"},{"key":"8_CR17","unstructured":"Okasaki, C.: Views for standard ML. In: Proc. of ML\u201998 (1998)"},{"issue":"2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G. Peterson","year":"1981","unstructured":"Peterson, G., Stickel, M.: Complete sets of reductions for some equational theories. J. of the ACM\u00a028(2), 233\u2013264 (1981)","journal-title":"J. of the ACM"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"K. Rao","year":"1993","unstructured":"Rao, K.: Completeness of hierarchical combinations of term rewriting systems. In: Shyamasundar, R.K. (ed.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol.\u00a0761, Springer, Heidelberg (1993)"},{"key":"8_CR20","unstructured":"Rioboo, R., Doligez, D., Hardin, T.: all. FoCal Reference Manual, version 0.3.1. Universit\u00e9 Paris 6, CNAM & INRIA (2005), http:\/\/focal.inria.fr\/"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Thompson, S.: Laws in Miranda. In: Proc. of LFP\u201986 (1986)","DOI":"10.1145\/319838.319839"},{"issue":"2-3","key":"8_CR22","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0167-6423(90)90070-T","volume":"13","author":"S. Thompson","year":"1990","unstructured":"Thompson, S.: Lawful functions and program verification in Miranda. Science of Computer Programming\u00a013(2-3), 181\u2013218 (1990)","journal-title":"Science of Computer Programming"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Views: a way for pattern matching to cohabit with data abstraction. In: Proc. of POPL\u201987 (1987)","DOI":"10.1145\/41625.41653"},{"key":"8_CR24","unstructured":"Weis, P.: Private constructors in OCaml (2003), http:\/\/alan.petitepomme.net\/cwn\/2003.07.01.html#5"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71316-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:49:35Z","timestamp":1556682575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71316-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540713142","9783540713166"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71316-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}