{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:09Z","timestamp":1725456069330},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055789X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023772","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:11:10Z","timestamp":1132395070000},"page":"257-271","source":"Crossref","is-referenced-by-count":2,"title":["Equational specification of abstract types and combinators"],"prefix":"10.1007","author":[{"given":"Karl","family":"Meinke","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Category Theory for Computing Science","author":"M. Barr","year":"1990","unstructured":"M. Barr and C. Wells, Category Theory for Computing Science, Prentice Hall, Englewood Cliffs, 1990."},{"key":"19_CR2","volume-title":"Combinatory Logic, Vol. I","author":"H.B. Curry","year":"1958","unstructured":"H.B. Curry and R. Feys, Combinatory Logic, Vol. I, North Holland, Amsterdam, 1958."},{"key":"19_CR3","volume-title":"Combinatory Logic, Vol. II","author":"H.B. Curry","year":"1972","unstructured":"H.B. Curry, J.R. Hindley and J.P. Seldin, Combinatory Logic, Vol. II, North Holland, Amsterdam, 1972."},{"key":"19_CR4","volume-title":"Proofs and Types","author":"J-Y. Girard","year":"1989","unstructured":"J-Y. Girard, Y. Lafont and P. Taylor, Proofs and Types, Cambridge University Press, Cambridge, 1989."},{"key":"19_CR5","volume-title":"Introduction to Combinators and \u03bb-Calculus","author":"J.R. Hindley","year":"1986","unstructured":"J.R. Hindley and J.P. Seldin, Introduction to Combinators and \u03bb-Calculus, Cambridge University Press, Cambridge, 1986."},{"key":"19_CR6","unstructured":"K. Meinke, Universal algebra in higher types, Report CSR 12-90, Dept. of Computer Science, University College Swansea, to appear in Theoretical Computer Science, Volume 99, 1990."},{"key":"19_CR7","unstructured":"K. Meinke, Subdirect representation of higher type algebras, to appear in K. Meinke and J.V. Tucker (eds), Many-Sorted Logic and its Applications, John Wiley, 1992."},{"key":"19_CR8","unstructured":"K. Meinke, A recursive second order initial algebra specification of primitive recursion, Report CSR 8-91, Department of Computer Science, University College of Swansea,1991."},{"key":"19_CR9","volume-title":"Handbook of Logic in Computer Science","author":"K. Meinke","year":"1992","unstructured":"K. Meinke and J.V. Tucker, Universal algebra, to appear in: S. Abramsky, D. Gabbay and T.S.E. Maibaum, (eds) Handbook of Logic in Computer Science, Oxford University Press, Oxford, 1992."},{"key":"19_CR10","unstructured":"K. Meinke and E. Wagner, Algebraic specification of types and combinators, IBM research report, in preparation, 1992."},{"key":"19_CR11","volume-title":"Handbook of Theoretical Computer Science, Volume B","author":"J.C. Mitchell","year":"1990","unstructured":"J.C. Mitchell, Type systems for programming languages, in: J. van Leeuwen (ed), Handbook of Theoretical Computer Science, Volume B, Elsevier, Amsterdam, 1990."},{"key":"19_CR12","unstructured":"B. M\u00f6ller, Higher-order algebraic specifications, Facult\u00e4t f\u00fcr Mathematik und Informatik, Technische Universit\u00e4t M\u00fcnchen, Habilitationsschrift, 1987b."},{"volume-title":"Algebraic Methods in Semantics","year":"1985","key":"19_CR13","unstructured":"M. Nivat, J. Reynolds (eds), Algebraic Methods in Semantics, Cambridge University Press, Cambridge, 1985."},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(86)80027-4","volume":"68","author":"A. Poign\u00e9","year":"1986","unstructured":"A. Poign\u00e9, On specifications, theories and models with higher types, Information and Control 68, (1986) 1\u201346.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023772.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:33Z","timestamp":1607550633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023772"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055789X"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0023772","relation":{},"subject":[]}}