19 search results - page 1 / 4 » wollic 2009 |
122
Voted
WOLLIC
2009
Springer
15 years 9 months ago
2009
Springer
89
Voted
WOLLIC
2009
Springer
15 years 9 months ago
2009
Springer
WOLLIC
2009
Springer
15 years 9 months ago
2009
Springer
90
Voted
WOLLIC
2009
Springer
15 years 9 months ago
2009
Springer
129
Voted
WOLLIC
2009
Springer
15 years 9 months ago
2009
Springer
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 mo...