19 search results - page 1 / 4 » wollic 2009 |
158
Voted
WOLLIC
2009
Springer
16 years 12 days ago
2009
Springer
118
Voted
WOLLIC
2009
Springer
16 years 12 days ago
2009
Springer
133
Voted
WOLLIC
2009
Springer
16 years 12 days ago
2009
Springer
169
click to vote
WOLLIC
2009
Springer
16 years 12 days 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...