{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:22:44Z","timestamp":1725456164292},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600176"},{"type":"electronic","value":"9783540494041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0022278","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:12:29Z","timestamp":1132639949000},"page":"501-511","source":"Crossref","is-referenced-by-count":1,"title":["General form recursive equations I"],"prefix":"10.1007","author":[{"given":"Hrant B.","family":"Marandjian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"36_CR1","volume-title":"The Lambda Calculus. Its Syntax and Semantics","author":"H. P. Barendregt","year":"1981","unstructured":"H. P. Barendregt The Lambda Calculus. Its Syntax and Semantics. North-Holland Publ. Comp., Amsterdam, 1981."},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0022-0000(87)90020-1","volume":"35","author":"D. B. Benson","year":"1987","unstructured":"D. B. Benson and I. Guessarian Algebraic solution to recursion schemata. Journal of Computer and System Sciences, 35:365\u2013400, 1987.","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR3","first-page":"243","volume-title":"Handbook of Theoretical Computer Science, volume B","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 243\u2013320. Elsevier-MIT Press, Amsterdam, New York, Oxford, Tokyo, 1990."},{"key":"36_CR4","first-page":"273","volume":"40","author":"J. P. Gallier","year":"1990","unstructured":"J. P. Gallier and W. Snyder Designing unification procedures using transformations: A survey. Bulletin of the European Association for Theoretical Computer Science, 40:273\u2013326, February 1990.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/B978-0-12-115350-2.50017-8","volume-title":"Formal Language Theory: Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"G. Huet and D. C. Oppen Equations and rewriting rules: A survey. In Formal Language Theory: Perspectives and Open Problems, pages 349\u2013405. Academic Press, New York, 1980."},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"A. J. Kfoury, J. Tiuryn, and P. Urzyczyn Computational consequences and partial solutions of a generalized unification problem. In Proc. Fourth Annual Symposium on Logic in Computer Science, pages 98\u2013105, Washington, 1989.","DOI":"10.1109\/LICS.1989.39163"},{"key":"36_CR7","volume-title":"Introduction to Metamathematics","author":"S. C. Kleene","year":"1952","unstructured":"S. C. Kleene Introduction to Metamathematics. D. Van Nostrand Co., Inc., New York, Toronto, 1952."},{"key":"36_CR8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.4064\/cm-6-1-67-78","volume":"VI","author":"S. C. Kleene","year":"1958","unstructured":"S. C. Kleene Extension of an effectively generated class of functions by enumeration. Colloquium Mathematicum, VI:67\u201378, 1958.","journal-title":"Colloquium Mathematicum"},{"key":"36_CR9","first-page":"101","volume-title":"Constructivity in Mathematics, Studies in Logic","author":"G. Kreisel","year":"1959","unstructured":"G. Kreisel Interpretation of analysis by means of constructive functionals of finite types. In A. Heyting, editor, Constructivity in Mathematics, Studies in Logic, pages 101\u2013128. North-Holland Publ. Co., Amsterdam, 1959."},{"key":"36_CR10","unstructured":"H. B. Marandjian On recursive equations. In COLOG-88, Papers presented at the Int. Conf.on Computer Logic, Part II, pages 159\u2013161, Tallinn, 1988."},{"key":"36_CR11","volume-title":"Selected Topics in Recursive Function Theory in Computer Science","author":"H. B. Marandjian","year":"1990","unstructured":"H. B. Marandjian Selected Topics in Recursive Function Theory in Computer Science. DTH, Lyngby, 1990."},{"key":"36_CR12","volume-title":"volume 128 of Transl. of Math. Monographs","author":"V. P. Orevkov","year":"1993","unstructured":"V. P. Orevkov Complexity of Proofs and Their Transformations in Axiomatic Theories, volume 128 of Transl. of Math. Monographs. American Mathematical Society, New York, 1993."},{"issue":"4","key":"36_CR13","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0214066","volume":"14","author":"R. Parikh","year":"1985","unstructured":"R. Parikh, A. Chandra, J. Halpern, and A. R. Meyer Equations between regular terms and an application to process logic. SIAM J. Comput., 14(4):935\u2013942, 1985.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"36_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/321752.321764","volume":"20","author":"T. Pietrzykowski","year":"1973","unstructured":"T. Pietrzykowski A complete mechanization of second-order type theory. JACM, 20(2):333\u2013364, 1973.","journal-title":"JACM"},{"issue":"2","key":"36_CR15","first-page":"354","volume":"LIV","author":"A. Robinson","year":"1989","unstructured":"A. Robinson. Equational logic of partial functions under Kleene equality: a complete and an incomplete set of rules. JSL, LIV(2):354\u2013362, 1989.","journal-title":"JSL"},{"key":"36_CR16","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"H. Rogers. Jr. Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, New York, 1967."},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01191787","volume":"16","author":"L. Rudak","year":"1983","unstructured":"L. Rudak. A completeness theorem for weak equational logic. Algebra Universalis, 16:331\u2013337, 1983.","journal-title":"Algebra Universalis"},{"issue":"3","key":"36_CR18","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"D. Scott Data types as lattices. SIAM J. Comput., 5(3):522\u2013587, 1976.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T04:58:01Z","timestamp":1549342681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600176","9783540494041"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0022278","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}