19 search results - page 1 / 4 » wollic 2009 |
130
Voted
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
95
Voted
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
100
Voted
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
101
Voted
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
136
Voted
WOLLIC
2009
Springer
15 years 10 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...