Sciweavers

Share
WOLLIC
2009
Springer

Recognizability in the Simply Typed Lambda-Calculus

9 years 22 days ago
Recognizability in the Simply Typed Lambda-Calculus
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.
Sylvain Salvati
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where WOLLIC
Authors Sylvain Salvati
Comments (0)
books