{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:45:58Z","timestamp":1747579558137},"reference-count":31,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T00:00:00Z","timestamp":1236124800000},"content-version":"unspecified","delay-in-days":5025,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[1995,6]]},"abstract":"<jats:p>In this paper we continue previous work by Sannella, Sokolowski and Tarlecki on parameterization in specification languages. Within the loose approach, we define specification and model level semantics for two kinds of parameterizations (parameterized specifications and specifications of parameterized data types) and describe, in a compositional manner, parameter passing at both levels. Moreover, the specification and the model level semantics of parameter passing are shown to be compatible. We also show that the results obtained do not only apply to the loose approach but can also be directly applicable to the initial framework, and in general to any other kind of monomorphic framework (<jats:italic>i.e<\/jats:italic>., a framework where all specifications are monomorphic). In particular, the results obtained generalize and extend previous results for the initial approach. Finally, to obtain our results, new categorical constructions of multiple pushouts, amalgamations and extensions, which generalize standard notions of pushouts, amalgamations and extensions, had to be introduced.<\/jats:p>","DOI":"10.1017\/s0960129500000748","type":"journal-article","created":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T04:00:54Z","timestamp":1236139254000},"page":"283-314","source":"Crossref","is-referenced-by-count":3,"title":["Compositionality and compatibility of parameterization and parameter passing in specification languages"],"prefix":"10.1017","volume":"5","author":[{"given":"Rosa M.","family":"Jim\u00e9nez","sequence":"first","affiliation":[]},{"given":"Fernando","family":"Orejas","sequence":"additional","affiliation":[]},{"given":"Hartmut","family":"Ehrig","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2009,3,4]]},"reference":[{"key":"S0960129500000748_ref031","first-page":"675","volume-title":"Handbook of Theoretical Computer Science, Vol. 2: Formal Models and Semantics","author":"Wirsing","year":"1990"},{"key":"S0960129500000748_ref029","doi-asserted-by":"publisher","DOI":"10.1145\/69622.357192"},{"key":"S0960129500000748_ref028","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-12689-9_122"},{"key":"S0960129500000748_ref027","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0012793"},{"key":"S0960129500000748_ref026","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-50940-2_48"},{"key":"S0960129500000748_ref016","unstructured":"Ehrig H. , Wagner E. G. and Thatcher J. W. (1982) Algebraic constraints for specifications and canonical form results, Inst. f\u00fcr Software und Theor. Informatik, T.U. Berlin Bericht Nr. 82\u201309."},{"key":"S0960129500000748_ref011","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90065-8"},{"key":"S0960129500000748_ref010","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56610-4_54"},{"key":"S0960129500000748_ref022","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54496-8_12"},{"key":"S0960129500000748_ref013","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61284-8"},{"key":"S0960129500000748_ref009","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51722-7_1"},{"key":"S0960129500000748_ref008","unstructured":"Ehrig H. , Baldamus M. , Cornelius F. , Orejas F. (1991) Theory of Algebraic Module Specifications including Behavioural Semantics and Constraints. Proceedings AM AST \u201891."},{"key":"S0960129500000748_ref005","first-page":"209","article-title":"On the theory of specification, implementation and parameterization of abstract data types","volume":"29","author":"Enrich","year":"1982","journal-title":"Journal of the ACM"},{"key":"S0960129500000748_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10007-5_41"},{"key":"S0960129500000748_ref002","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77621"},{"key":"S0960129500000748_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53982-4_7"},{"key":"S0960129500000748_ref015","unstructured":"Ehrig H. , Thatcher J. W. , Lucas P. and Zilles S. N. (1982) Denotational and initial algebra semantics of the algebraic specification language LOOK, Draft Report, IBM Research."},{"key":"S0960129500000748_ref019","doi-asserted-by":"publisher","DOI":"10.1145\/147508.147524"},{"key":"S0960129500000748_ref024","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022528"},{"key":"S0960129500000748_ref030","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90051-4"},{"key":"S0960129500000748_ref023","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51722-7_7"},{"key":"S0960129500000748_ref025","doi-asserted-by":"crossref","unstructured":"Sannella D. , Sokolowski S. and Tarlecki A. (1991) Toward formal development of programs from algebraic specifications: parameterisation revisited. To appear in Acta Informatica.","DOI":"10.1007\/BF01191893"},{"key":"S0960129500000748_ref020","unstructured":"Goguen J. A. , Thatcher J. W. and Wagner E. G. (1978) An initial algebra approach to the specification, correctness and implementation of abstract data types. IBM Report RC-6487, IBM T. J. Watson Research Center, Yorktown Heights. Also in: Yeh R.T. , (ed.) Current Trends in Programming Methodology, Vol. 4: Data Structuring, Prentice Hall 80\u2013149."},{"key":"S0960129500000748_ref012","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69962-7"},{"key":"S0960129500000748_ref007","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10828-9_51"},{"key":"S0960129500000748_ref006","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19740590107"},{"key":"S0960129500000748_ref014","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0035766"},{"key":"S0960129500000748_ref021","unstructured":"Lipeck U. (1983) Ein algebraischer Kalk\u00fcl f\u00fcr einen strukturierten Entwurf von Datenabstraktionen, Dissertation, Report 148, Univ. Dortmund."},{"key":"S0960129500000748_ref018","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-12896-4_366"},{"key":"S0960129500000748_ref017","doi-asserted-by":"publisher","DOI":"10.1145\/2166.357212"},{"key":"S0960129500000748_ref004","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(91)90085-G","article-title":"Some Fundmental Algebraic Tools for the Semantics of Computation, Part 3: Indexed Categories","volume":"91","author":"Burstall","year":"1991","journal-title":"Theor. Comp. Sci"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129500000748","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:43:36Z","timestamp":1557769416000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129500000748\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["S0960129500000748"],"URL":"https:\/\/doi.org\/10.1017\/s0960129500000748","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}