2009 | OriginalPaper | Buchkapitel
Recognizability in the Simply Typed Lambda-Calculus
verfasst von : Sylvain Salvati
Erschienen in: Logic, Language, Information and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.