Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Recognizability in the Simply Typed Lambda-Calculus

Sylvain Salvati 1 
1 SIGNES - Linguistic signs, grammar and meaning: computational logic for natural language
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : We define a notion of recognizable sets of simply typed λ-terms that extends the notion of recognizable sets of strings or trees. This definition is based on finite models. Using intersection types, we generalize the notions of automata for strings and trees so as to grasp recognizability for λ-terms. We then expose the closure properties of this notion and present some of its applications.
Document type :
Conference papers
Complete list of metadata
Contributor : Sylvain Salvati Connect in order to contact the contributor
Submitted on : Wednesday, September 2, 2009 - 2:16:19 PM
Last modification on : Saturday, June 25, 2022 - 10:31:51 AM


  • HAL Id : inria-00412654, version 1



Sylvain Salvati. Recognizability in the Simply Typed Lambda-Calculus. 16th Workshop on Logic, Language, Information and Computation, 2009, Tokyo, Japan. ⟨inria-00412654⟩



Record views