{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:10Z","timestamp":1725662890066},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_13","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:01:55Z","timestamp":1330192915000},"page":"138-150","source":"Crossref","is-referenced-by-count":7,"title":["Domain algebras"],"prefix":"10.1007","author":[{"given":"Peter","family":"Dybjer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"13_CR1","first-page":"147","volume-title":"Proceedings 17th IEEE Symposium on Foundations of Computer Science","author":"J. A. Goguen","year":"1976","unstructured":"ADJ (= Goguen, J.A., Thatcher, J.W., Wagner, E.G., Wright, J.B.) (1976), \"Rational Algebraic Theories and Fixed-Point Solutions\", Proceedings 17th IEEE Symposium on Foundations of Computer Science, Houston, Texas, pp 147\u2013158"},{"issue":"1","key":"13_CR2","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. A. Goguen","year":"1977","unstructured":"ADJ (= Goguen, J.A., Thatcher, J.W., Wagner, E.G., Wright, J.B.) (1977), \"Initial Algebra Semantics and Continuous Algebras\", JACM 24, 1, pp 68\u201395","journal-title":"JACM"},{"key":"13_CR3","unstructured":"ADJ (= Goguen, J.A., Thatcher, J.W., Wagner, E.G.) (1978), \"An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types\", in \"Current Trends in Programming Methodology\", R.Yeh ed., Prentice-Hall"},{"key":"13_CR4","first-page":"1","volume":"10","author":"J. Benabou","year":"1968","unstructured":"Benabou, J. (1968), \"Structures algebraic dans les categories\", Cahiers de topologie et geometrie differentiell 10, pp 1\u201324","journal-title":"Cahiers de topologie et geometrie differentiell"},{"key":"13_CR5","unstructured":"Berry, G. (1979), \"Mod\u00e8les compl\u00e8tement ad\u00e9quats et stables des lambda-calculs typ\u00e9s\", Th\u00e8se de doctorat d'etat \u00e8s sciences mathematiques, l'universit\u00e9 Paris VII"},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/3-540-10699-5_99","volume":"107","author":"G. Berry","year":"1981","unstructured":"Berry, G. (1981a), \"On the Definition of Lambda Calculus Models\", Proceedings International Colloquium on Formalization of Programming Concepts, Lecture Notes in Computer Science 107 (Springer Verlag, Berlin), pp 218\u2013230","journal-title":"Proceedings International Colloquium on Formalization of Programming Concepts, Lecture Notes in Computer Science"},{"key":"13_CR7","unstructured":"Berry, G. (1981b), \"Some Syntactic and Categorical Constructions of Lambda-Calculus Models\", Rapport INRIA 80"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G. Berry","year":"1982","unstructured":"Berry, G. and Curien, P.L. (1982), \"Sequential Algorithms on Concrete Data Structures\", Theoretical Computer Science 20, pp 265\u2013321","journal-title":"Theoretical Computer Science"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0022-0000(76)80030-X","volume":"13","author":"S. L. Bloom","year":"1976","unstructured":"Bloom, S.L. (1976), \"Varieties of Ordered Algebras\", Journal of Computer and System Sciences 13, pp 200\u2013212","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR10","unstructured":"Burstall, R.M. and Goguen, J.A. (1977), \"Putting Theories Together to Make Specifications\", Proceedings of the 5th IJCAI, pp 1045\u20131058"},{"key":"13_CR11","unstructured":"Burstall, R.M. and Landin, P.J. (1969), \"Programs and their Proofs: An Algebraic Approach\", Machine Intelligence 4, Edinburgh University Press, pp 17\u201344"},{"key":"13_CR12","unstructured":"Cohn, A.J. (1978), \"High Level Proofs in LCF\", Report CSR-35-78, Department of Computer Science, University of Edinburgh"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Courcelle, B. and Nivat, M. (1976) \"Algebraic Families of Interpretations\", Proceedings of the 17th FOCS, Houston","DOI":"10.1109\/SFCS.1976.3"},{"key":"13_CR14","unstructured":"Dybjer, P. (1983), \"Category-Theoretic Logics and Algebras of Programs\", Ph.D.thesis, CTH"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(83)90098-1","volume":"27","author":"H. D. Ehrich","year":"1983","unstructured":"Ehrich, H.D. and Lipeck, U. (1983), \"Algebraic Domain Equations\", Theoretical Computer Science 27, pp 167\u2013196","journal-title":"Theoretical Computer Science"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/947864.947865","volume":"16","author":"J. A. Goguen","year":"1981","unstructured":"Goguen, J.A. and Meseguer, J. (1981), \"Completeness of Many-Sorted Equational Logic\", SIGPLAN Notices 16, pp 24\u201332","journal-title":"SIGPLAN Notices"},{"key":"13_CR17","unstructured":"Guessarian, I. (1982) \"Survey on some Classes of Interpretations and some of their applications\", Laboratoire Informatique Theorieque et Programmation, 82\u201346, Univ. Paris VII"},{"key":"13_CR18","unstructured":"Karlsson, K. and Petersson, K., (eds) (1983), \"Workshop on Semantics of Programming Languages\", CTH"},{"key":"13_CR19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BFb0073965","volume":"274","author":"J. Lambek","year":"1972","unstructured":"Lambek, J. (1972), \"Deductive Systems and Categories III\", Proceedings Dalhousie Conference on Toposes, Algebraic Geometry and Logic, Lecture Notes in Mathematics 274, Springer-Verlag, pp 57\u201382","journal-title":"Proceedings Dalhousie Conference on Toposes, Algebraic Geometry and Logic, Lecture Notes in Mathematics"},{"key":"13_CR20","unstructured":"Lambek, J. (1980), \"From Lambda-Calculus to Cartesian Closed Categories\", in To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J.P. Seldin and J.R. Hindley (eds.), pp 376\u2013402"},{"key":"13_CR21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0022-4049(80)90102-4","volume":"19","author":"J. Lambek","year":"1980","unstructured":"Lambek, J. and Scott, P.J. (1980), \"Intuitionist Type Theory and the Free Topos\", Journal of Pure and Applied Algebra 19, pp 215\u2013257","journal-title":"Journal of Pure and Applied Algebra"},{"key":"13_CR22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01752392","volume":"14","author":"D. J. Lehmann","year":"1981","unstructured":"Lehmann, D.J. and Smyth, M.B. (1981), \"Algebraic Specification of Data Types: A Synthetic Approach\", Mathematical Systems Theory 14, pp 97\u2013139","journal-title":"Mathematical Systems Theory"},{"key":"13_CR23","volume-title":"Categories for the Working Mathematician","author":"S. MacLane","year":"1971","unstructured":"MacLane, S. (1971), \"Categories for the Working Mathematician\", Springer-Verlag, Berlin"},{"key":"13_CR24","volume-title":"6th International Congress for Logic","author":"P. Martin-L\u00f6f","year":"1979","unstructured":"Martin-L\u00f6f, P. (1979), \"Constructive Mathematics and Computer Programming\", 6th International Congress for Logic, Methodology and Philosophy of Science, Hannover"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of FCT","author":"J. Meseguer","year":"1977","unstructured":"Meseguer, J. (1977) \"On Order-Complete Universal Algebra and Enriched Functorial Semantics\", Proceedings of FCT, Lecture Notes in Computer Science 56 (Springer-Verlag, Berlin)"},{"key":"13_CR26","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1145\/322154.322167","volume":"26","author":"R. Milner","year":"1979","unstructured":"Milner, R. (1979), \"Flow Graphs and Flow Algebras\", JACM 26, pp 794\u2013818","journal-title":"JACM"},{"key":"13_CR27","unstructured":"Milner, R., Morris, L., Newey, M. (1975), \"A Logic for Computable Functions with Reflexive and Polymorphic Types\", Proc. Conference on Proving and Improving Programs, Arc-et-Senans"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Morris, F.L. (1973), \"Advice on Structuring Compilers and Proving them Correct\", Proceedings, ACM Symposium on Principles of Programming Languages, Boston, pp 144\u2013152","DOI":"10.1145\/512927.512941"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Mosses, P.D. (1982), \"Abstract Semantic Algebras!\", DAIMI Report PB-145, Computer Science Department, Aarhus University","DOI":"10.7146\/dpb.v11i145.6543"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of FCT","author":"A. Obtu\u0142owicz","year":"1977","unstructured":"Obtu\u0142owicz, A. (1977), \"Functorial Semantics of the \u03bb-\u03b2\u03b7-calculus\" in Proceedings of FCT, Lecture Notes in Computer Science 56 (Springer-Verlag, Berlin)"},{"key":"13_CR31","unstructured":"Parsaye-Ghomi, K. (1982), \"Higher Order Abstract Data Types\", Ph.D. thesis, Department of Computer Science, UCLA"},{"key":"13_CR32","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. D. Plotkin","year":"1976","unstructured":"Plotkin, G.D. (1976), \"LCF Considered as a Programming Language\", Theoretical Computer Science 5, pp 223\u2013256","journal-title":"Theoretical Computer Science"},{"key":"13_CR33","unstructured":"Plotkin, G.D. (1980), \"Domains\", Edinburgh CS Dept, lecture notes."},{"key":"13_CR34","unstructured":"Poigne, A. (1983), \"On Semantic Algebras Higher Order Structures\", Forschungsbericht 156, Abt. Informatik, Universitat Dortmund"},{"key":"13_CR35","unstructured":"Scott, D.S. (1980), \"Relating Theories of the Lambda-Calculus\", in To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J.P. Seldin and J.R. Hindley (eds), pp 404\u2013450"},{"key":"13_CR36","unstructured":"Scott, D.S. (1981), \"Lectures on a Mathematical Theory of Computation\", Technical Monograph PRG-19, Oxford University Computing Laboratory"},{"key":"13_CR37","doi-asserted-by":"crossref","unstructured":"Scott, D.S. (1982), \"Domains for Denotational Semantics\", Proceedings 9th International Colloquium on Automata, Languages and Programming, Aarhus, Springer-Verlag Lecture Notes in Computer Science, pp 577\u2013613","DOI":"10.1007\/BFb0012801"},{"key":"13_CR38","doi-asserted-by":"crossref","unstructured":"Smyth, M.B. (1978), \"Effectively Given Domains\", Theoretical Computer Science 5","DOI":"10.1016\/0304-3975(77)90045-7"},{"key":"13_CR39","unstructured":"Smyth, M.B. (1982), \"The Largest Cartesian Closed Category of Domains\", Report CSR 108\u201382, Computer Science Department, University of Edinburgh"},{"key":"13_CR40","doi-asserted-by":"crossref","unstructured":"Smyth, M.B. and Plotkin, G.D. (1982), \"The Category Theoretic Solution of Recursive Domain Equations\", SIAM Journal on Computing 11","DOI":"10.1137\/0211062"},{"key":"13_CR41","unstructured":"Streicher, T. (1983), \"Definability in Scott Domains\", in Proc. Workshop on Semantics of Programming Languages, CTH"},{"key":"13_CR42","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(81)90080-3","volume":"15","author":"J. W. Thatcher","year":"1981","unstructured":"Thatcher, J.W., Wagner, E.G., Wright, J.B. (1981), \"More on Advice on Structuring Compilers and Proving them Correct\", Theoretical Computer Science 15, pp 223\u2013249","journal-title":"Theoretical Computer Science"},{"key":"13_CR43","unstructured":"Wand, M. (1977), \"Fixed-Point Constructions in Order-Enriched Categories\", Technical Report 23, Computer Science Department, Indiana University, Bloomington"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:11Z","timestamp":1605643631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}