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.
Type de document :
Communication dans un congrès
16th Workshop on Logic, Language, Information and Computation, 2009, Tokyo, Japan. 2009
Liste complète des métadonnées

https://hal.inria.fr/inria-00412654
Contributeur : Sylvain Salvati <>
Soumis le : mercredi 2 septembre 2009 - 14:16:19
Dernière modification le : jeudi 11 janvier 2018 - 06:22:12

Identifiants

  • HAL Id : inria-00412654, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

134