{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:45Z","timestamp":1725663405241},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540190271"},{"type":"electronic","value":"9783540389415"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19027-9_5","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:56:51Z","timestamp":1330199811000},"page":"64-78","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Implementation of modular algebraic specifications"],"prefix":"10.1007","author":[{"given":"N. W. P.","family":"van Diepen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"5_CR1","unstructured":"R.C. Backhouse (1986). Program Construction and Verification, Prentice-Hall."},{"issue":"1","key":"5_CR2","first-page":"5","volume":"6","author":"C. Baker-Finch","year":"1984","unstructured":"C. Baker-Finch (1984). \u201cAcceptable models of algebraic semantics,\u201d Australian Computer Science Communications, vol. 6, no. 1, pp. 5\u20131\/10, Proceedings of the Seventh Australian Computer Science Conference, Adelaide, ed. C.J. Barter.","journal-title":"Australian Computer Science Communications"},{"key":"5_CR3","volume-title":"\u201cAlgebraic definition of a simple programming language,\u201d Report CS-R8504","author":"J.A. Bergstra","year":"1985","unstructured":"J.A. Bergstra, J. Heering, and P. Klint (1985). \u201cAlgebraic definition of a simple programming language,\u201d Report CS-R8504, Centre for Mathematics and Computer Science, Amsterdam."},{"key":"5_CR4","volume-title":"\u201cModule algebra,\u201d Report CS-R8617","author":"J.A. Bergstra","year":"1986","unstructured":"J.A. Bergstra, J. Heering, and P. Klint (1986). \u201cModule algebra,\u201d Report CS-R8617, Centre for Mathematics and Computer Science, Amsterdam."},{"key":"5_CR5","volume-title":"\u201cASF \u2014 an algebraic specification formalism,\u201d Report CS-R8705","author":"J.A. Bergstra","year":"1987","unstructured":"J.A. Bergstra, J. Heering, and P. Klint (1987). \u201cASF \u2014 an algebraic specification formalism,\u201d Report CS-R8705, Centre for Mathematics and Computer Science, Amsterdam."},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","volume":"32","author":"J.A. Bergstra","year":"1986","unstructured":"J.A. Bergstra and J.W. Klop (1986). \u201cConditional rewrite rules: confluence and termination,\u201d Journal of Computer and System Sciences, vol. 32, no. 3, pp. 323\u2013362.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"5_CR7","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(82)80021-1","volume":"54","author":"J.A. Bergstra","year":"1982","unstructured":"J.A. Bergstra and J.V. Tucker (1982). \u201cThe completeness of the algebraic specification methods for computable data types,\u201d Information and Control, vol. 54, no. 3, pp. 186\u2013200.","journal-title":"Information and Control"},{"issue":"2","key":"5_CR8","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1137\/0212024","volume":"12","author":"J.A. Bergstra","year":"1983","unstructured":"J.A. Bergstra and J.V. Tucker (1983). \u201cInitial and final algebra semantics for data type specifications: two characterization theorems,\u201d SIAM Journal on Computing, vol. 12, no. 2, pp. 366\u2013387.","journal-title":"SIAM Journal on Computing"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"M. Broy, W. Dosch, B. M\u00f6ller, and M. Wirsing (1981). \u201cGOTOs \u2014 a study in the algebraic specification of programming languages,\u201d in GI-11. Jahrestagung, ed. W. Brauer, Informatik-Fachberichte, vol. 50, pp. 109\u2013121, Springer-Verlag.","DOI":"10.1007\/978-3-662-01089-1_13"},{"key":"5_CR10","volume-title":"\u201cA study in algebraic specification: a language with goto-statements,\u201d Report CS-R8627","author":"N.W.P. Diepen van","year":"1986","unstructured":"N.W.P. van Diepen (1986). \u201cA study in algebraic specification: a language with goto-statements,\u201d Report CS-R8627, Centre for Mathematics and Computer Science, Amsterdam."},{"key":"5_CR11","unstructured":"K. Drosten and H.-D. Ehrich (1984). \u201cTranslating algebraic specifications to Prolog programs,\u201d Informatik-Bericht Nr. 84-08, Technische Universit\u00e4t Braunschweig."},{"key":"5_CR12","unstructured":"K. Futatsugi, J.A. Goguen, J.-P. Jouannaud and J. Meseguer (1985). \u201cPrinciples of OBJ2\u201d, in Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pp. 52\u201366, ACM."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"J.A. Goguen and J. Meseguer (1982), \u201cUniversal realization, persistent interconnection and implementation of abstract modules,\u201d in Proceedings 9th International Conference on Automata, Languages and Programming, eds. M. Nielsen & E.M. Schmidt, Lecture Notes in Computer Science, vol. 140, pp. 265\u2013281, Springer-Verlag.","DOI":"10.1007\/BFb0012775"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0743-1066(84)90004-9","volume":"2","author":"J.A. Goguen","year":"1984","unstructured":"J.A. Goguen and J. Meseguer (1984). \u201cEquality, types, modules, and (why not?) generics for logic programming,\u201d Journal of Logic Programming, vol. 2, pp. 179\u2013210.","journal-title":"Journal of Logic Programming"},{"key":"5_CR15","unstructured":"J.A. Goguen, J. Meseguer and D. Plaisted (1983). \u201cProgramming with parameterized abstract objects in OBJ\u201d, in Theory and Practice of Software Technology, eds. D. Ferrari, M. Bolognani & J.A. Goguen, pp. 163\u2013193, North-Holland."},{"key":"5_CR16","unstructured":"G. Huet and D.C. Oppen (1980). \u201cEquations and rewrite rules: a survey,\u201d in Formal Language Theory, Perspectives and Open Problems, ed. R.V. Book, pp. 349\u2013405, Academic Press."},{"key":"5_CR17","unstructured":"K. Jensen and N. Wirth (1978). Pascal: User Manual and Report (second edition), Springer-Verlag."},{"key":"5_CR18","unstructured":"C.B. Jones (1980). Software Development: a Rigorous Approach, Prentice-Hall."},{"issue":"1","key":"5_CR19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/357195.357202","volume":"5","author":"S. Kamin","year":"1983","unstructured":"S. Kamin (1983). \u201cFinal data types and their specification,\u201d ACM Transactions on Programming Languages and Systems, vol. 5, no. 1, pp. 97\u2013123.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"5_CR20","unstructured":"J. Loeckx and K. Sieber (1984). The Foundation of Program Verification, Wiley-Teubner."},{"key":"5_CR21","unstructured":"J. Meseguer and J.A. Goguen (1985). \u201cInitiality, induction, and computability,\u201d in Algebraic Methods in Semantics, eds. M. Nivat & J.C. Reynolds, pp. 459\u2013541, Cambridge University Press."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"M.J. O'Donnell (1985). Equational Logic as a Programming Language, MIT Press.","DOI":"10.1007\/3-540-15648-8_20"},{"key":"5_CR23","unstructured":"D. Sannella and A. Tarlecki (1985). \u201cOn observational equivalence and algebraic specification,\u201d in Mathematical Foundations of Software Development. Proceedings International Joint Conference on Theory and Practice of Software Development, TAPSOFT '85, eds. H. Ehrig, C. Floyd, M. Nivat & J. Thatcher, Lecture Notes in Computer Science, vol. 185, pp. 308\u2013322, Springer-Verlag."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0022-0000(79)90011-4","volume":"19","author":"M. Wand","year":"1979","unstructured":"M. Wand (1979). \u201cFinal algebra semantics and data type extensions,\u201d Journal of Computer and System Sciences, vol. 19, pp. 27\u201344.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","ESOP '88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19027-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:31:50Z","timestamp":1578526310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19027-9_5"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540190271","9783540389415"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-19027-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}