{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:06:50Z","timestamp":1725667610067},"publisher-location":"Wiesbaden","reference-count":15,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"type":"print","value":"9783519026501"},{"type":"electronic","value":"9783322848239"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-322-84823-9_9","type":"book-chapter","created":{"date-parts":[[2012,3,10]],"date-time":"2012-03-10T09:25:18Z","timestamp":1331371518000},"page":"94-105","source":"Crossref","is-referenced-by-count":0,"title":["Definitions- und Beweisprinzipien f\u00fcr Daten und Prozesse"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Hensel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"P. Aczel. Non-well-founded sets. CSLI Lecture Notes 14, Stanford, 1988."},{"key":"9_CR2","unstructured":"J.R.B. Cockett and D. Spencer. Strong categorical datatypes I. In R.A.G. Seely, editor, Category Theory 1991, number 13 in CMS Conference Proceedings, pages 141\u2013169, 1992."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00099-5","volume":"139","author":"JRB Cockett","year":"1995","unstructured":"J.R.B. Cockett and D. Spencer. Strong categorical datatypes ii: A term logic for categorical programming. Theoretical Computer Science, 139:69\u2013113, 1995.","journal-title":"Theoretical Computer Science"},{"key":"9_CR4","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69962-7","volume-title":"Fundamentals of Algebraic Specification 1: Equations and Initial Semantics","author":"H Ehrig","year":"1985","unstructured":"Hartmut Ehrig and Bernd Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, New York, N.Y., 1985."},{"key":"9_CR5","unstructured":"T. Hagino. A categorical programming language. PhD thesis, Univ. Edinburgh, 1987. Techn. Rep. 87\/38."},{"key":"9_CR6","unstructured":"Ulrich Hensel. Definition and Proof Principles for Data and Processes. PhD thesis, Univerisity of Technology Dresden, 1999."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BFb0053566","volume":"1381","author":"U Hensel","year":"1998","unstructured":"U. Hensel, M. Huisman, B. Jacobs, and H. Tews. Reasoning about classes in object-oriented languages: Logical models and tools. Lecture Notes in Computer Science, 1381:105\u2013121, 1998.","journal-title":"Lecture Notes in Computer Science"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/BFb0022272","volume-title":"Computer Science Logic 1994","author":"C Hermida","year":"1995","unstructured":"C. Hermida and B. Jacobs. An algebraic view of structural induction. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic 1994, number 933 in Lect. Notes Comp. Sci., pages 412\u2013426. Springer, Berlin, 1995."},{"key":"9_CR9","series-title":"volume 1290 of Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/BFb0026991","volume-title":"Category Theory and Computer Science","author":"U Hensel","year":"1997","unstructured":"Ulrich Hensel and Bart Jacobs. Proof principles for datatypes with iterated recursion. In Eugenio Moggi and Giuseppe Rosolini, editors, Category Theory and Computer Science, volume 1290 of Lecture Notes in Computer Science, pages 220\u2013241, Santa Margherita Ligure, Italy, September 1997. Springer-Verlag."},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1093\/logcom\/9.4.463","volume":"9","author":"U Hensel","year":"1999","unstructured":"U. Hensel and B Jacobs. Coalgebraic theories of sequences in pvs. Journal of Logic and Computation, 9(4):463\u2013500, 1999.","journal-title":"Journal of Logic and Computation"},{"key":"9_CR11","unstructured":"B. Jacobs. Categorical Logic and Type Theory. Elsevier Science, 1999."},{"key":"9_CR12","series-title":"volume 33, 10 of ACM SIGPLAN Notices","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/286936.286973","volume-title":"Proceedings of the 13th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA-98)","author":"B Jacobs","year":"1998","unstructured":"Bart Jacobs, Joachim van den Berg, Marieke Huisman, Martijn van Berkum, Ulrich Hensel, and Hendrik Tews. Reasoning about Java classes. In Proceedings of the 13th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA-98), volume 33, 10 of ACM SIGPLAN Notices, pages 329\u2013340, New York, October 18\u201322 1998. ACM Press."},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-3975(94)90014-0","volume":"124","author":"AM Pitts","year":"1994","unstructured":"A.M. Pitts. A co-induction principle for recursively defined domains. Theor. Comp. Sci., 124(2):195\u2013219, 1994.","journal-title":"Theor. Comp. Sci."},{"key":"9_CR14","series-title":"Lect. Notes Comp. Sci.","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/3-540-58043-3_28","volume-title":"A Decade of Concurrency","author":"J Rutten","year":"1994","unstructured":"J. Rutten and D. Turi. Initial algebra and final coalgebra semantics for concurrency. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, A Decade of Concurrency, number 803 in Lect. Notes Comp. Sci., pages 530\u2013582. Springer, Berlin, 1994."},{"key":"9_CR15","first-page":"675","volume-title":"Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics","author":"M Wirsing","year":"1990","unstructured":"Martin Wirsing. Algebraic specification. In J. van Leewen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 13, pages 675\u2013788. The MIT Press, New York, N.Y., 1990."}],"container-title":["Ausgezeichnete Informatikdissertationen 1999"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-84823-9_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T17:41:08Z","timestamp":1619977268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-322-84823-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783519026501","9783322848239"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-84823-9_9","relation":{},"subject":[],"published":{"date-parts":[[2000]]}}}