{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:01:28Z","timestamp":1648846888470},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540534877","type":"print"},{"value":"9783540463139","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53487-3_33","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:06:10Z","timestamp":1330207570000},"page":"33-47","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of algebraic specifications"],"prefix":"10.1007","author":[{"given":"Ramesh","family":"Subrahmanyam","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"S. Burris and H. P. Sankappanavar. A course in universal algebra. Volume 78 of Graduate Texts in Mathematics, Springer-Verlag, 1981.","DOI":"10.1007\/978-1-4613-8130-3"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"M. Davis, Y. Matijasevi\u010d, and J. Robinson. Hilbert's tenth problem, diophantine equations: positive aspects of a negative solution. In Proceedings of Symposia in Pure mathematics, Vol. 28, pages 323\u2013378, American Mathematical Society, 1976.","DOI":"10.1090\/pspum\/028.2\/0432534"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"H. Ehrig and B. Mahr. Fundamentals of algebraic specification 1: equations and initial semantics. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-69962-7"},{"key":"3_CR4","first-page":"51","volume":"13","author":"F. Nourani","year":"1981","unstructured":"F. Nourani. On induction for programming logic: syntax, semantics and inductive closure. Bulletin of the EATCS, (13):51\u201364, February 1981.","journal-title":"Bulletin of the EATCS"},{"key":"3_CR5","unstructured":"J. Goguen and J. Meseguer. Initiality, induction, and computability. In Algebraic Methods in Semantics, Cambridge Univ. Press, 1985."},{"key":"3_CR6","unstructured":"J. A. Goguen, J. W. Thatcher, and E. G. Wagner. An initial algebra approach to the specification, correctness, and implementation of abstract data types. In R.T. Yeh, editor, Current Trends in Programming Methodology, Prentice-Hall, 1978."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"J. A. Goguen. How to prove algebraic inductive hypotheses without induction. In Proceedings of the Conference on Automated Deduction, pages 356\u2013373, Springer-Verlag, 1984.","DOI":"10.1007\/3-540-10009-1_27"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1145\/359657.359666","volume":"21","author":"J. V. Guttag","year":"1978","unstructured":"J. V. Guttag, E. Horowitz, and D. R. Musser. Abstract data types and software validation. Communications of the ACM, 21:1048\u20131064, 1978.","journal-title":"Communications of the ACM"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0022-0000(82)90006-X","volume":"25","author":"G. Huet","year":"1982","unstructured":"G. Huet and J-M. Hullot. Proofs by induction in equatioanl theories with constructors. Journal of Computer and System Sciences, 25:239\u2013266, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1073\/pnas.50.5.869","volume":"50","author":"F. W. Lawvere","year":"1963","unstructured":"F. W. Lawvere. Functorial semantics of algebraic theories. In Proc. Nat. Acad. Sci. Vol.50, pages 869\u2013872, 1963.","journal-title":"Proc. Nat. Acad. Sci."},{"key":"3_CR11","unstructured":"S. MacLane. Categories for the Working Mathematician. Volume 5 of Graduate Texts in Mathematics, Springer-Verlag, 1988."},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/TSE.1985.232484","volume":"SE-11","author":"D. MacQueen","year":"1985","unstructured":"D. MacQueen and D. T. Sannella. Completeness of proof systems for equational specifications. IEEE Transactions on Software Engineering, SE-11:454\u2013461, 1985.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"3_CR13","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. New York: McGraw-Hill, 1967."},{"key":"3_CR14","series-title":"Technical Report","volume-title":"Theory of the initial algebra of a set of equations","author":"R. Subrahmanyam","year":"1990","unstructured":"R. Subrahmanyam. Theory of the initial algebra of a set of equations. Technical Report, University of Pennsylvania, Philadelphia, 1990."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"H. Zhang, D. Kapur, and M. S. Krishnamoorthy. A mechanizable induction principle for equational specifications. 1988. Manuscript.","DOI":"10.1007\/BFb0012831"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53487-3_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:50:12Z","timestamp":1605646212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53487-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540534877","9783540463139"],"references-count":15,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-53487-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1990]]}}}