Recognizability in the Simply Typed Lambda-Calculus
Idioma
en
Communication dans un congrès
Este ítem está publicado en
16th Workshop on Logic, Language, Information and Computation, 2009, Tokyo. 2009
Resumen en inglés
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 ...Leer más >