Recognizability in the Simply Typed Lambda-Calculus
SALVATI, Sylvain
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
SALVATI, Sylvain
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
< Reduce
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
Language
en
Communication dans un congrès
This item was published in
16th Workshop on Logic, Language, Information and Computation, 2009, Tokyo. 2009
English 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 ...Read more >
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.Read less <
Origin
Hal imported