19 search results - page 1 / 4 » wollic 2009 |
99
Voted
WOLLIC
2009
Springer
15 years 7 months ago
2009
Springer
WOLLIC
2009
Springer
15 years 7 months ago
2009
Springer
70
Voted
WOLLIC
2009
Springer
15 years 7 months ago
2009
Springer
70
Voted
WOLLIC
2009
Springer
15 years 7 months ago
2009
Springer
105
Voted
WOLLIC
2009
Springer
15 years 7 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...