{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:59:05Z","timestamp":1725551945754},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642122507"},{"type":"electronic","value":"9783642122514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12251-4_10","type":"book-chapter","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T23:32:42Z","timestamp":1270855962000},"page":"118-133","source":"Crossref","is-referenced-by-count":0,"title":["A Complete Axiomatization of Strict Equality"],"prefix":"10.1007","author":[{"given":"Javier","family":"\u00c1lvez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco J.","family":"L\u00f3pez-Fraguas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"\u00c1lvez, J., L\u00f3pez-Fraguas, F.J.: A complete axiomatization of strict equality over infinite trees. Technical Report SIC-3-09, UCM, Madrid (2009), http:\/\/gpd.sip.ucm.es\/fraguas\/papers\/TR_SIC_3_09.pdf"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-58402-1_27","volume-title":"Programming Language Implementation and Logic Programming","author":"P. Arenas-S\u00e1nchez","year":"1994","unstructured":"Arenas-S\u00e1nchez, P., Gil-Luezas, A., L\u00f3pez-Fraguas, F.J.: Combining lazy narrowing with disequality constraints. In: Hermenegildo, M.V., Penjam, J. (eds.) PLILP 1994. LNCS, vol.\u00a0844, pp. 385\u2013399. Springer, Heidelberg (1994)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.entcs.2007.01.014","volume":"177","author":"E.J.G. Arias","year":"2007","unstructured":"Arias, E.J.G., Mari\u00f1o-Carballo, J., Poza, J.M.R.: A proposal for disequality constraints in Curry. Electr. Notes Theor. Comput. Sci.\u00a0177, 269\u2013285 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"10_CR4","unstructured":"Colmerauer, A.: Equations and inequations on finite and infinite trees. In: Clark, K.L., T\u00e4rnlund, S.A. (eds.) FGCS 1984, pp. 85\u201399 (1984)"},{"issue":"3\/4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0747-7171(89)80017-3","volume":"7","author":"H. Comon","year":"1989","unstructured":"Comon, H., Lescanne, P.: Equational problems and disunification. Journal of Symbolic Computation\u00a07(3\/4), 371\u2013425 (1989)","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(90)90080-L","volume":"48","author":"K.J. Compton","year":"1990","unstructured":"Compton, K.J., Henson, C.W.: A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic\u00a048(1), 1\u201379 (1990)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"4","key":"10_CR7","first-page":"431","volume":"8","author":"K. Djelloul","year":"2008","unstructured":"Djelloul, K., Dao, T.-B.-H., Fr\u00fchwirth, T.W.: Theory of finite or infinite trees revisited. TPLP\u00a08(4), 431\u2013489 (2008)","journal-title":"TPLP"},{"key":"10_CR8","unstructured":"Hanus, M. (ed.): Curry: An integrated functional logic language (March 2006), http:\/\/www.informatik.uni-kiel.de\/~curry\/report.html"},{"key":"10_CR9","unstructured":"L\u00f3pez-Fraguas, F.J.: Programaci\u00f3n Funcional y L\u00f3gica con Restricciones. PhD thesis, Univ. Complutense Madrid (1994) (in Spanish)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Fraguas, F.J., S\u00e1nchez-Hern\u00e1ndez, J.: Failure and equality in functional logic programming. Electr. Notes Theor. Comput. Sci.\u00a086(3) (2003)","DOI":"10.1016\/S1571-0661(04)80697-2"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-48685-2_19","volume-title":"Rewriting Techniques and Applications","author":"F. L\u00f3pez-Fraguas","year":"1999","unstructured":"L\u00f3pez-Fraguas, F., S\u00e1nchez-Hern\u00e1ndez, J.: $\\mathcal{TOY}$ : A multiparadigm declarative system. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 244\u2013247. Springer, Heidelberg (1999)"},{"issue":"1, 2","key":"10_CR12","first-page":"41","volume":"4","author":"F. L\u00f3pez-Fraguas","year":"2004","unstructured":"L\u00f3pez-Fraguas, F., S\u00e1nchez-Hern\u00e1ndez, J.: A proof theoretic approach to failure in functional logic programming. TPLP\u00a04(1, 2), 41\u201374 (2004)","journal-title":"TPLP"},{"key":"10_CR13","unstructured":"Maher, M.: Complete axiomatizations of the algebras of finite, rational and infinite trees. Technical report, IBM T.J. Watson Research Center (1988), http:\/\/www.cse.unsw.edu.au\/~mmaher\/pubs\/trees\/axiomatizations.pdf"},{"key":"10_CR14","first-page":"348","volume-title":"LICS 1988","author":"M.J. Maher","year":"1988","unstructured":"Maher, M.J.: Complete axiomatizations of the algebras of finite, rational and infinite trees. In: LICS 1988, pp. 348\u2013357. IEEE Computer Society, Los Alamitos (1988)"},{"volume-title":"Haskell 98 Language and Libraries. The Revised Report","year":"2003","key":"10_CR15","unstructured":"Peyton Jones, S.L. (ed.): Haskell 98 Language and Libraries. The Revised Report. Cambridge Univ. Press, Cambridge (2003)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Reiter, R.: On closed world data bases. In: Logic and Data Bases, pp. 55\u201376 (1978)","DOI":"10.1007\/978-1-4684-3384-5_3"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/3-540-61511-3_91","volume-title":"Automated Deduction - Cade-13","author":"S.G. Vorobyov","year":"1996","unstructured":"Vorobyov, S.G.: An improved lower bound for the elementary theories of trees. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol.\u00a01104, pp. 275\u2013287. Springer, Heidelberg (1996)"}],"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-642-12251-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T19:11:29Z","timestamp":1685560289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12251-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642122507","9783642122514"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12251-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}