{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:29Z","timestamp":1725663209228},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514862"},{"type":"electronic","value":"9783540481768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_102","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:59:43Z","timestamp":1330203583000},"page":"566-576","source":"Crossref","is-referenced-by-count":0,"title":["How to define functionals on free structures in typed \u03bb calculus"],"prefix":"10.1007","author":[{"given":"Marek","family":"Zaionc","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"50_CR1","unstructured":"H. P. BerendregtThe Lambda Calculus Studies in Logic and the foundations of Mathematics, North-Holland 1981."},{"key":"50_CR2","unstructured":"Coguand T, Huet G., A theory of Constructions, Eurocal 85, Linz, Austria (1985)."},{"issue":"1","key":"50_CR3","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"A. ChurchA formulation of the simple theory of types, Journal of Symbolic Logic 5(1) 56\u201368 (1940).","journal-title":"Journal of Symbolic Logic"},{"key":"50_CR4","volume-title":"The Calculi of Lambda-Conversion","author":"A. Church","year":"1941","unstructured":"A. ChurchThe Calculi of Lambda-Conversion. Princeton University Press, Princeton, N.J., 1941."},{"key":"50_CR5","volume-title":"Combinatory logic vol 1","author":"H. B. Curry","year":"1968","unstructured":"H. B. Curry, R. FeysCombinatory logicvol 1, North-Holland, Amsterdam 1968."},{"key":"50_CR6","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/BFb0064870","volume":"453","author":"H. Friedman","year":"1975","unstructured":"H. FriedmanEquality between functionals, Lecture Notes in Mathematics vol. 453, 1975, 22\u201337.","journal-title":"Lecture Notes in Mathematics"},{"key":"50_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G. Huet","year":"1975","unstructured":"G. HuetA unification algorithm for typed \u03bb-calculus, Theoretical Computer Science 1, 1975, 27\u201358.","journal-title":"Theoretical Computer Science"},{"key":"50_CR8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02276799","volume":"17","author":"H. Schwichtenberg","year":"1975","unstructured":"Schwichtenberg H., Definierbare Functionen im \u03bb-Kalkuli mit Typen, Arch Math. Logic Grundlagenforsch 17 (1975\u201376) pp 113\u2013114.","journal-title":"Arch Math. Logic Grundlagenforsch"},{"key":"50_CR9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(79)90007-0","volume":"9","author":"R. Statman","year":"1979","unstructured":"Statman R.The Typed \u03bb Calculus is Not Elementary RecursiveTheoretical Computer Science 9, (1979) pp. 73\u201381.","journal-title":"Theoretical Computer Science"},{"key":"50_CR10","volume-title":"Combinatory logic, lambda calculus, and formal systems","author":"R. Statman","year":"1980","unstructured":"R. StatmanOn the existence of closed terms in the typed \u03bbcalculus I, In: Hindley, R., Seldin, J. (eds): Combinatory logic, lambda calculus, and formal systems. New York: Academic Press 1980."},{"key":"50_CR11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02023009","volume":"23","author":"R. Statman","year":"1983","unstructured":"Statman R.\u03bb-Definable Functionals and \u03b2\u03bd ConversionsArch. Math. Logic 23 (1983) pp. 21\u201326.","journal-title":"Arch. Math. Logic"},{"key":"50_CR12","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/3-540-15976-2_23","volume":"202","author":"M. Zaionc","year":"1985","unstructured":"M. ZaioncThe set of unifiers in typed \u03bb calculus as regular expression. Lecture Notes in Computer Science 202, 1985, 430\u2013440.","journal-title":"Lecture Notes in Computer Science"},{"key":"50_CR13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.3233\/FI-1987-10304","volume":"X","author":"M. Zaionc","year":"1987","unstructured":"M. ZaioncThe Regular Expression Description of Unifier Set in the Typed \u03bb Calculus, Fundamenta Informaticae X (1987) 309\u2013322.","journal-title":"Fundamenta Informaticae"},{"key":"50_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90077-6","volume":"52","author":"M. Zaionc","year":"1987","unstructured":"Zaionc M.Word operations definable in the typed \u03bb calculusTheoretical Computer Science 52 (1987) pp. 1\u201314.","journal-title":"Theoretical Computer Science"},{"key":"50_CR15","unstructured":"Zaionc M.A Characteristic of \u03bb definable Tree Operations, Submitted to Information & Computation"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_102.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:55:12Z","timestamp":1640919312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_102","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}