{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:59:03Z","timestamp":1649102343404},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540183174","type":"print"},{"value":"9783540478799","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18317-5_12","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:30:05Z","timestamp":1330198205000},"page":"194-211","source":"Crossref","is-referenced-by-count":5,"title":["Functional programming with sets"],"prefix":"10.1007","author":[{"given":"Bharat","family":"Jayaraman","sequence":"first","affiliation":[]},{"given":"David A.","family":"Plaisted","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"12_CR1","volume-title":"The Computer Modelling of Mathematical Reasoning","author":"A. Bundy","year":"1983","unstructured":"A. Bundy, \u201cThe Computer Modelling of Mathematical Reasoning,\u201d Academic Press, New York, 1983."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"L. Bachmair and N. Dershowitz, \u201cCommutation, transformation, and temination,\u201d In Proc. of 8th Int'l CADE, Oxford, Springer Lecture Notes in Computer Science, 230, pp. 5\u201320.","DOI":"10.1007\/3-540-16780-3_76"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"D. Benanav, D. Kapur, and P. Narendran, \u201cOn the complexity of matching problems,\u201d In Rewriting Techniques and Applications, pp. 417\u2013429, Dijon, France, May 1985.","DOI":"10.1007\/3-540-15976-2_22"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"L. Bachmair and D.A. Plaisted, \u201cAssociative Path Ordering,\u201d J. of Symbolic Computation, 1, pp. 329\u2013349.","DOI":"10.1016\/S0747-7171(85)80019-5"},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. L. Clark","year":"1978","unstructured":"K. L. Clark, \u201cNegation as Failure,\u201d In Logic and Data Bases, Ed. H. Gallaire and J. Minker, Plenum Press, New York, 1978, pp. 293\u2013322."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"J. S. Conery and D. F. Kibler, \u201cParallel Interpretation of Logic Programs,\u201d In Conf. Functional Prog. Lang. and Comp. Arch., ACM, 1981, pp. 163\u2013170.","DOI":"10.1145\/800223.806775"},{"key":"12_CR7","volume-title":"Programming in Prolog","author":"W. F. Clocksin","year":"1981","unstructured":"W. F. Clocksin and C. S. Mellish, Programming in Prolog. Springer-Verlag, New York, 1981."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, \u201cOrderings for term-rewriting systems,\u201d Theoretical Computer Science, 17, pp. 279\u2013301.","DOI":"10.1016\/0304-3975(82)90026-3"},{"key":"12_CR9","unstructured":"N. Dershowitz, \u201cTermination of Rewriting,\u201d Technical report UIUCDCS-R-85-1220, University of Illinois at Urbana-Champaign, August 1985."},{"key":"12_CR10","unstructured":"N. Dershowitz and D. A. Plaisted, \u201cApplicative Programming cum Logic Programming,\u201d In 1985 Symp. on Logic Programming, Boston, pp. 54\u201366."},{"key":"12_CR11","unstructured":"J. Darlington, A.J. Field, and H. Pull, \u201cUnification of Functional and Logic Languages,\u201d In DeGroot and Lindstrom (eds.), Logic Programming, Relations, Functions and Equations, pp. 37\u201370, Prentice-Hall, 1986."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"D.P. Friedman and D.S. Wise, \u201cAn Indeterminate Constructor for Applicative Programming,\u201d In 7th ACM POPL, pp. 245\u2013250, Las Vegas, January 1980.","DOI":"10.1145\/567446.567470"},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet, \u201cConfluent Reductions: abstract properties and applications to term rewriting systems,\u201d J. ACM, 27, 1980, pp. 797\u2013821.","journal-title":"J. ACM"},{"key":"12_CR14","volume-title":"Formal Languages: Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"G. Huet and D. Oppen, \u201cEquations and Rewrite Rules: a Survey,\u201d In Formal Languages: Perspectives and Open Problems, R. Book (ed.), Academic Press, New York 1980."},{"issue":"1","key":"12_CR15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/357153.357158","volume":"4","author":"C. M. Hoffman","year":"1982","unstructured":"C. M. Hoffman and M. J. O'Donnell, \u201cProgramming with Equations,\u201d ACM TOPLAS 4, No. 1 (January 1982) pp. 83\u2013112.","journal-title":"ACM TOPLAS"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"B. Jayaraman and F.S.K. Silbermann, \u201cEquations, Sets, and Reduction Semantics for Functional and Logic Programming,\u201d In 1986 ACM Symposium on LISP and Functional Programming, pp. 320\u2013331, Boston, 1986.","DOI":"10.1145\/319838.319873"},{"key":"12_CR17","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. E. Knuth","year":"1970","unstructured":"D. E. Knuth and P. Bendix, \u201cSimple Word Problems in Universal Algebras,\u201d In Computational Problems in Abstract Algebra, J. Leech (ed.), Pergamon Press, New York, pp. 263\u2013297, 1970."},{"key":"12_CR18","unstructured":"R. M. Keller, \u201cFEL (Function Equation Language) Programmer's Guide,\u201d AMPS Technical Memo 7, Department of Computer Science, University of Utah, April 1982."},{"key":"12_CR19","unstructured":"L. Naish, \u201cAll Solutions Predicates in Prolog,\u201d In Symp. on Logic Programming, Boston, 1985, pp. 73\u201377."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"M. J. O'Donnell, \u201cEquational logic as a programming language,\u201d M.I.T. Press, 1985.","DOI":"10.1007\/3-540-15648-8_20"},{"key":"12_CR21","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(85)80005-X","volume":"65","author":"D. A. Plaisted","year":"1985","unstructured":"D.A. Plaisted, \u201cSemantic Confluence Tests and Completion Methods,\u201d Information and Control, 65, pp. 182\u2013215, 1985.","journal-title":"Information and Control"},{"key":"12_CR22","unstructured":"D.A. Plaisted, \u201cNondeterminism by Associative-Commutative Rewriting,\u201d Internal Report, Department of Computer Science, University of North Carolina, Chapel Hill, March 1986, 30 pages."},{"key":"12_CR23","unstructured":"J. A. Robinson, \u201cNew Generation Knowledge Processing: Syracuse University Parallel Expression Reduction,\u201d First Annual Progress Report, December 1984."},{"key":"12_CR24","unstructured":"U. S. Reddy, \u201cNarrowing as the Operational Semantics of Functional Languages,\u201d In 1985 Symp. on Logic Programming, Boston, 1985, pp. 138\u2013151."},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"D. A. Turner, \u201cThe semantic elegance of applicative languages,\u201d In ACM Symp. on Func. Prog. and Comp. Arch., New Hampshire, October, 1981, pp. 85\u201392.","DOI":"10.1145\/800223.806766"}],"container-title":["Functional Programming Languages and Computer Architecture","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18317-5_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:35Z","timestamp":1605644075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18317-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540183174","9783540478799"],"references-count":25,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-18317-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1987]]}}}