{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:09:36Z","timestamp":1762351776833,"version":"3.32.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1007\/bf01752392","type":"journal-article","created":{"date-parts":[[2005,6,15]],"date-time":"2005-06-15T10:43:16Z","timestamp":1118832196000},"page":"97-139","source":"Crossref","is-referenced-by-count":95,"title":["Algebraic specification of data types: A synthetic approach"],"prefix":"10.1007","volume":"14","author":[{"given":"Daniel J.","family":"Lehmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael B.","family":"Smyth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01752392_CR1","unstructured":"J. Adamek, Free algebras and automata realizations in the language of categories, Commentationes Mathematicae Universitatis Carolinae 589\u2013602 (1974)."},{"key":"BF01752392_CR2","unstructured":"ADJ: J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright, Abstract data types as initial algebras and the correctness of data representations, Proc. Conference on Computer Graphics, Pattern Recognition and Data Structures (1975)."},{"issue":"1","key":"BF01752392_CR3","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. A. Goguen","year":"1977","unstructured":"ADJ: J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright, Initial algebra semantics and continuous algebras, J. ACM 24, No. 1, 68\u201395 (1977).","journal-title":"J. ACM"},{"key":"BF01752392_CR4","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/3-540-08442-8_88","volume":"56","author":"M. A. Arbib","year":"1977","unstructured":"M. A. Arbib, Free dynamics and algebraic semantics, Lecture Notes in computer Science 56, 212\u2013227 (1977).","journal-title":"Lecture Notes in computer Science"},{"key":"BF01752392_CR5","doi-asserted-by":"crossref","unstructured":"M. A. Arbib and E. G. Manes, A categorist's view of automata and systems, category theory applied to computation and control, Springer Lecture Notes in Computer Science, Vol. 25 (1974).","DOI":"10.1007\/3-540-07142-3_61"},{"key":"BF01752392_CR6","volume-title":"Recursive procedures","author":"J. Bakker de","year":"1974","unstructured":"J. de Bakker, Recursive procedures, Math. Centrum, Amsterdam (1974)."},{"issue":"116","key":"BF01752392_CR7","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF01111838","volume":"2.","author":"M. Barr","year":"1970","unstructured":"M. Barr, Coequalizers and free triples, Math. 2., 116, 307\u2013322 (1970).","journal-title":"Math."},{"key":"BF01752392_CR8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0021-9800(70)80014-X","volume":"8","author":"G. Birkhoff","year":"1970","unstructured":"G. Birkhoff and J. D. Lipson, Heterogeneous algebras, J. Combinatorial Theory 8, 115\u2013133 (1970).","journal-title":"J. Combinatorial Theory"},{"key":"BF01752392_CR9","unstructured":"W. H. Burge, Recursive programming techniques, Addison Wesley (1975)."},{"key":"BF01752392_CR10","doi-asserted-by":"crossref","unstructured":"B. Courcelle and M. Nivat, Algebraic families of interpretations, 17th Ann. IEEE Symp. on Foundations of Comp. Sci., 137\u2013146 (1978).","DOI":"10.1109\/SFCS.1976.3"},{"key":"BF01752392_CR11","unstructured":"D. P. Friedman and D. S. Wise, CONS should not evaluate its arguments, Proc. of 3rd Coll. on Automata, Languages, and Programming, Edinburgh (1976)."},{"key":"BF01752392_CR12","unstructured":"M. Gordon, Models of pure LISP, Ph.D. thesis, Dept. of Artificial Intelligence, Edinburgh University (1973)."},{"key":"BF01752392_CR13","doi-asserted-by":"crossref","unstructured":"M. Gordon, R. Milner, L. Morris, M. Newey, and C. Wadsworth, A metalanguage for interactive proof in LCF, 5th Annual ACM Symp. on Principles of Programming Languages, Tucson, AZ (1978).","DOI":"10.1145\/512760.512773"},{"issue":"6","key":"BF01752392_CR14","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/359605.359618","volume":"20","author":"J. V. Guttag","year":"1977","unstructured":"J. V. Guttag, Abstract data types and the development of data structures, Communications of the ACM, 20, No. 6, 396\u2013404 (1977).","journal-title":"Communications of the ACM"},{"key":"BF01752392_CR15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00260922","volume":"10","author":"J. V. Guttag","year":"1978","unstructured":"J. V. Guttag and J. J. Horning, The algebraic specification of abstract data types, Acta Informatica 10, 27\u201352 (1978).","journal-title":"Acta Informatica"},{"key":"BF01752392_CR16","doi-asserted-by":"crossref","unstructured":"P. Henderson and J. Morris, Jr., A lazy evaluator, 3rd ACM Symposium on Principles of Programming Languages, 95\u2013103 (1976).","DOI":"10.1145\/800168.811543"},{"key":"BF01752392_CR17","unstructured":"H. Herrlich and G. E. Strecker, Category theory, Allyn and Bacon (1973)."},{"issue":"2","key":"BF01752392_CR18","first-page":"95","volume":"4","author":"C. A. R. Hoare","year":"1975","unstructured":"C. A. R. Hoare, Recursive data structures, J. Computer and System Sciences 4, No. 2, 95\u2013103 (1975).","journal-title":"J. Computer and System Sciences"},{"key":"BF01752392_CR19","unstructured":"A. Kanda, Data types as initial algebras, 19th Annual Symp. on Foundations of Computer Science (1978)."},{"key":"BF01752392_CR20","unstructured":"D. Knuth, The art of computer programming, Vol. 1, Addison-Wesley (1969)."},{"key":"BF01752392_CR21","doi-asserted-by":"crossref","first-page":"1506","DOI":"10.1073\/pnas.52.6.1506","volume":"52","author":"F. W. Lawvere","year":"1964","unstructured":"F. W. Lawvere, An elementary theory of the category of sets, Proc. National Academy of Sciences 52, 1506\u20131510 (1964).","journal-title":"Proc. National Academy of Sciences"},{"key":"BF01752392_CR22","doi-asserted-by":"crossref","unstructured":"D. J. Lehmann, Categories for fixpoint semantics, Theory of Computation Report No. 15, Dept. of Computer Science, University of Warwick (1976); see also Proc. 17th Annual Symp. on Foundation of Computer Science, IEEE (1976).","DOI":"10.1109\/SFCS.1976.9"},{"key":"BF01752392_CR23","unstructured":"D. J. Lehmann, Models in ALGOL Y, Proc. 5th Annual I.I.I. Conference, May 1977, Guidel, France, Publ, by I.R.I.A. (1977)."},{"key":"BF01752392_CR24","unstructured":"D. J. Lehmann, On the algebra of order, see extended abstract in Proc. 19th Annual Symp. on F.O.C.S. IEEE, to appear."},{"key":"BF01752392_CR25","doi-asserted-by":"crossref","unstructured":"D. Lehmann and M. Smyth, Data types, Theory of Computation Report No. 19, University of Warwick (1977).","DOI":"10.1109\/SFCS.1977.10"},{"key":"BF01752392_CR26","doi-asserted-by":"crossref","unstructured":"S. MacLane, Categories for the working mathematician, Springer (1971).","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"BF01752392_CR27","unstructured":"S. MacLane and G. Birkhoff, Algebra, Macmillan (1967)."},{"key":"BF01752392_CR28","unstructured":"Z. Manna, Mathematical theory of computation, McGraw-Hill (1974)."},{"key":"BF01752392_CR29","unstructured":"G. Markowsky, Categories of chain-complete posets, IBM Research Tech. Report RC5100, to appear in Theoretical Computer Science."},{"key":"BF01752392_CR30","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/3-540-08442-8_96","volume":"56","author":"J. Mesguer","year":"1977","unstructured":"J. Mesguer, On order-complete universal algebra and enriched functorial semantics, Lecture Notes in Computer Science 56, 294\u2013301 (1977).","journal-title":"Lecture Notes in Computer Science"},{"issue":"3","key":"BF01752392_CR31","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G. D. Plotkin","year":"1976","unstructured":"G. D. Plotkin, A powerdomain construction, SIAM J. Computing 5, No. 3, 452\u2013487 (1976).","journal-title":"SIAM J. Computing"},{"key":"BF01752392_CR32","unstructured":"G. D. Plotkin and M. B. Smyth, The category theoretic solution of recursive domain equations, Proc 18th Annual Symp. on F.O.C.S. I.E.E.E. (1977)."},{"key":"BF01752392_CR33","unstructured":"W. P. de Roever, Recursive program schemes: semantics and proof theory, Mathematical Centre Tract No. 70, Amsterdam (1976)."},{"key":"BF01752392_CR34","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BFb0059703","volume":"188","author":"D. S. Scott","year":"1971","unstructured":"D. S. Scott, The lattice of flow diagrams, in Semantics of Algorithmic Languages (E. Engeler, ed.), Springer Lecture Notes in Mathematics 188, 311\u2013368 (1971).","journal-title":"Springer Lecture Notes in Mathematics"},{"key":"BF01752392_CR35","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BFb0073967","volume":"274","author":"D. S. Scott","year":"1972","unstructured":"D. S. Scott, Continuous lattices, in Toposes, Algebraic Geometry, and Logic (F. W. Lawvere, ed.), Springer Lecture Notes in Mathematics 274, 97\u2013136 (1972).","journal-title":"Springer Lecture Notes in Mathematics"},{"issue":"3","key":"BF01752392_CR36","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. S. Scott","year":"1976","unstructured":"D. S. Scott, Data types as lattices, SIAM J. Computing 5, No. 3, 522\u2013587 (1976).","journal-title":"SIAM J. Computing"},{"key":"BF01752392_CR37","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","volume":"5","author":"M. B. Smyth","year":"1977","unstructured":"M. B. Smyth, Effectively given domains, Theor. Comp. Sci. 5, 257\u2013274 (1977).","journal-title":"Theor. Comp. Sci."},{"key":"BF01752392_CR38","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M. B. Smyth","year":"1978","unstructured":"M. B. Smyth, Powerdomains, J. Comp. Syst. Sci. 16, 23\u201336 (1978).","journal-title":"Powerdomains, J. Comp. Syst. Sci."},{"key":"BF01752392_CR39","unstructured":"J. Stoy, Denotational semantics, M.I.T. Press (1978)."},{"key":"BF01752392_CR40","doi-asserted-by":"crossref","unstructured":"M. Wand, On the recursive specification of data types, Category Theory Applied to Computation and Control, Springer Lecture Notes in Computer Science Vol. 25 (1974).","DOI":"10.1007\/3-540-07142-3_85"},{"key":"BF01752392_CR41","unstructured":"M. Wand, Fixed-point constructions in order-enriched categories, Technical Report No. 23, Comp. Science Department, Indiana University (1975)."},{"key":"BF01752392_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00265077","volume":"5","author":"A. Wijngaarden van","year":"1975","unstructured":"A. van Wijngaarden, B. J. Mailloux, J. E. L. Peck, C. H. A. Koster, M. Sintzoff, C. H. Lindsey, L. G. L. T. Meertens, and R. G. Fisker, Revised report on the Algorithmic Language ALGOL 68, Acta Informatica 5, 1\u2013236 (1975).","journal-title":"Acta Informatica"},{"key":"BF01752392_CR43","volume-title":"Computer Programming and Formal Systems","author":"J. McCarthy","year":"1963","unstructured":"J. McCarthy, A basis for a mathematical theory of computation, in Computer Programming and Formal Systems (P. Braffort and D. Hirschberg, eds.), North-Holland, Amsterdam (1963)."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01752392.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01752392\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01752392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T18:28:33Z","timestamp":1735756113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01752392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF01752392"],"URL":"https:\/\/doi.org\/10.1007\/bf01752392","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"type":"print","value":"0025-5661"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}