{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:09:22Z","timestamp":1742962162399,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022609"},{"type":"electronic","value":"9783642022616"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02261-6_5","type":"book-chapter","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T04:28:49Z","timestamp":1244262529000},"page":"48-60","source":"Crossref","is-referenced-by-count":13,"title":["Recognizability in the Simply Typed Lambda-Calculus"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Salvati","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"de Groote, P.: Towards abstract categorial grammars. In: Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter, Proceedings of the Conference, pp. 148\u2013155 (2001)","DOI":"10.3115\/1073012.1073045"},{"key":"5_CR2","volume-title":"Formal Philosophy: Selected Papers of Richard Montague","author":"R. Montague","year":"1974","unstructured":"Montague, R.: Formal Philosophy: Selected Papers of Richard Montague. Yale University Press, New Haven (1974)"},{"key":"5_CR3","unstructured":"Salvati, S.: On the membership problem for Non-linear Abstract Categorial Grammars. In: Muskens, R. (ed.) Proceedings of the Workshop on New Directions in Type-theoretic Grammars (NDTTG 2007), Dublin, Ireland, Foundation of Logic, Language and Information (FoLLI), August 2007, pp. 43\u201350 (2007)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J. Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly\u00a065, 154\u2013170 (1958)","journal-title":"American Mathematical Monthly"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Moortgat, M.: Categorial Investigations: Logical & Linguistic Aspects of the Lambek Calculus. Foris Pubns USA (1988)","DOI":"10.1515\/9783112329580"},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.2307\/2586625","volume":"64","author":"P. Urzyczyn","year":"1999","unstructured":"Urzyczyn, P.: The emptiness problem for intersection types. J. Symb. Log.\u00a064(3), 1195\u20131215 (1999)","journal-title":"J. Symb. Log."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-94-010-0526-5_15","volume-title":"Logic, Meaning and Computation: Essays in memory of Alonzo Church","author":"R. Loader","year":"2001","unstructured":"Loader, R.: The undecidability of \u03bb-definability. In: Anderson, C.A., Zeleny, M. (eds.) Logic, Meaning and Computation: Essays in memory of Alonzo Church, pp. 331\u2013342. Kluwer, Dordrecht (2001)"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.2307\/2273377","volume":"47","author":"R. Statman","year":"1982","unstructured":"Statman, R.: Completeness, invariance and \u03bb-definability. Journal of Symbolic Logic\u00a047(1), 17\u201326 (1982)","journal-title":"Journal of Symbolic Logic"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Statman, R., Dowek, G.: On statman\u2019s finite completeness theorem. Technical Report CMU-CS-92-152, University of Carnegie Mellon (1992)","DOI":"10.21236\/ADA256233"},{"key":"5_CR10","unstructured":"Myhill, J.: Finite automata and the representation of events. Technical Report WADC TR-57-624, Wright Patterson Air Force Base, Ohio, USA (1957)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Nerode, A.: Linear automaton transformations. In: Proceedings of the American Mathematical Society, vol.\u00a09, pp. 541\u2013544. American Mathematical Society (1958)","DOI":"10.1090\/S0002-9939-1958-0135681-9"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"Mezei, J., Wright, J.: Algebraic automata and context-free sets. Information and Control\u00a011, 3\u201329 (1967)","journal-title":"Information and Control"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Dezani-Ciancaglini, M., Giovannetti, E., de\u2019 Liguoro, U.: Intersection Types, Lambda-models and B\u00f6hm Trees. In: MSJ-Memoir. Theories of Types and Proofs, vol.\u00a02, pp. 45\u201397. Mathematical Society of Japan (1998)","DOI":"10.2969\/msjmemoirs\/00201C020"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Babaev, A.A., Soloviev, S.V.: Coherence theorem for canonical maps in cartesian closed categories. Journal of Soviet Mathematics 20 (1982)","DOI":"10.1007\/BF01629434"},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s10849-004-2114-x","volume":"13","author":"P. Groote de","year":"2005","unstructured":"de Groote, P., Pogodalla, S.: On the expressive power of abstract categorial grammars: Representing context-free formalisms. Journal of Logic, Language and Information\u00a013(4), 421\u2013438 (2005)","journal-title":"Journal of Logic, Language and Information"},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J.W. Thatcher","year":"1967","unstructured":"Thatcher, J.W.: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences\u00a01(4), 317\u2013322 (1967)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-540-45085-6_41","volume-title":"Automated Deduction \u2013 CADE-19","author":"M. Schmidt-Schau\u00df","year":"2003","unstructured":"Schmidt-Schau\u00df, M.: Decidability of arity-bounded higher-order matching. In: Baader, F. (ed.) CADE 2003. LNCS, vol.\u00a02741, pp. 488\u2013502. Springer, Heidelberg (2003)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Comon, H., Jurski, Y.: Higher-order matching and tree automata. In: CSL, pp. 157\u2013176 (1997)","DOI":"10.1007\/BFb0028013"},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1093\/jigpal\/11.1.51","volume":"11","author":"R. Loader","year":"2003","unstructured":"Loader, R.: Higher order \u03b2 matching is undecidable. Logic Journal of the IGPL\u00a011(1), 51\u201368 (2003)","journal-title":"Logic Journal of the IGPL"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/11787006_30","volume-title":"Automata, Languages and Programming","author":"C. Stirling","year":"2006","unstructured":"Stirling, C.: A game-theoretic approach to deciding higher-order matching. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 348\u2013359. Springer, Heidelberg (2006)"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. v. excluding a planar graph. J. Comb. Theory, Ser. B\u00a041(1), 92\u2013114 (1986)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"5_CR22","first-page":"81","volume-title":"LICS","author":"C.H.L. Ong","year":"2006","unstructured":"Ong, C.H.L.: On model-checking trees generated by higher-order recursion schemes. In: LICS, pp. 81\u201390. IEEE Computer Society Press, Los Alamitos (2006)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02261-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T01:40:08Z","timestamp":1633570808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02261-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022609","9783642022616"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02261-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}