{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:22Z","timestamp":1725665002988},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626886"},{"type":"electronic","value":"9783540684381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62688-3_41","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:49:00Z","timestamp":1330278540000},"page":"267-283","source":"Crossref","is-referenced-by-count":0,"title":["Schwichtenberg-style lambda definability is undecidable"],"prefix":"10.1007","author":[{"given":"Jan","family":"Ma\u0142olepszy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ma\u0142gorzata","family":"Moczurad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Zaionc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"17_CR1","unstructured":"K. Govindarajan. A note on Polynomials with Non-negative Integer Coefficients. Private communication; to appear in the American Mathematical Monthly."},{"key":"17_CR2","first-page":"541","volume-title":"Interactive Synthesis of Definite Clause Grammars","author":"J. Haas","year":"1992","unstructured":"J. Haas and B. Jayaraman. Interactive Synthesis of Definite Clause Grammars. In: K.R. Apt (ed.) Proc. Joint International Conference and Symposium on Logic Programming, Washington DC, MIT Press, November 1992, 541\u2013555."},{"key":"17_CR3","unstructured":"J. Haas and B. Jayaraman. From Context-Pree to Definite-Clause Grammars: A Type-Theoretic Approach. Journal of Logic Programming, accepted to appear."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"M. Hagiya. From Programming by Example to Proving by Example. In: T. Ito and A. R. Meyer (eds.), Proc. Intl. Conf. on Theoret. Aspects of Comp. Software, 387\u2013419, Springer-Verlag LNCS 526.","DOI":"10.1007\/3-540-54415-1_56"},{"key":"17_CR5","series-title":"LNAI 449","first-page":"588","volume-title":"Proc. 10th CADE","author":"M. Hagiya","year":"1990","unstructured":"M. Hagiya. Programming by Example and Proving by Example using Higher-order Unification. In: M. E. Stickel (ed.) Proc. 10th CADE, Kaiserslautern, Springer-Verlag LNAI 449, July 1990, 588\u2013602."},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0304-3975(93)90092-8","volume":"121","author":"D. Leivant","year":"1993","unstructured":"D. Leivant. Functions over free algebras definable in the simple typed lambda calculus. Theoretical Computer Science 121 (1993), 309\u2013321.","journal-title":"Theoretical Computer Science"},{"key":"17_CR7","unstructured":"R. Loader. The Undecidability of \u03bb-Definability. Private communication; will be published in forthcoming Alonzo Church Festschrift book."},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02276799","volume":"17","author":"H. Schwichtenberg","year":"1975\/76","unstructured":"H. Schwichtenberg. Definierbare Funktionen in \u03bb-Kalkuli mit Typen. Arch. Math. Logik Grundlagenforsch. 17 (1975\/76), 113\u2013144.","journal-title":"Arch. Math. Logik Grundlagenforsch."},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(79)90007-0","volume":"9","author":"R. Statman","year":"1979","unstructured":"R. Statman. The typed \u03bb-calculus is not elementary recursive. Theoretical Computer Science 9 (1979), 73\u201381.","journal-title":"Theoretical Computer Science"},{"key":"17_CR10","volume-title":"To H. B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"R. Statman","year":"1980","unstructured":"R. Statman. On the existence of closed terms in the typed \u03bb-calculus. In: R. Hindley and J. Seldin, eds. To H. B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, London and New York, 1980."},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0049-237X(09)70166-1","volume-title":"Harvey Friedman's Research on the Foundations of Mathematics","author":"R. Statman","year":"1985","unstructured":"R. Statman. Equality of functionals revisited. In: L.A. Harrington et al. (Eds.), Harvey Friedman's Research on the Foundations of Mathematics, North-Holland, Amsterdam, (1985), 331\u2013338."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"D.A. Wolfram. The Clausual Theory of Types, Cambridge Tracts in Theoretical Computer Science 21, Cambridge University Press 1993.","DOI":"10.1017\/CBO9780511569906"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"181","DOI":"10.3233\/FI-1989-12205","volume":"XII","author":"M. Zaionc","year":"1989","unstructured":"M. Zaionc. On the \u03bb-definable higher order Boolean operations. Fundamenta Informatic\u00e6 XII (1989), 181\u2013190.","journal-title":"Fundamenta Informatic\u00e6"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0168-0072(91)90019-I","volume":"51","author":"M. Zaionc","year":"1991","unstructured":"M. Zaionc. \u03bb-definability on free algebras. Annals of Pure and Applied Logic 51 (1991), 279\u2013300.","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62688-3_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T06:20:50Z","timestamp":1640931650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62688-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626886","9783540684381"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-62688-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}