Sciweavers

1019 search results - page 9 / 204
» Uniform Functors on Sets
Sort
View
TOCL
2008
46views more  TOCL 2008»
15 years 1 months ago
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
Agostino Dovier, Carla Piazza, Gianfranco Rossi
101
Voted
CTCS
1989
Springer
15 years 5 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
EACL
1989
ACL Anthology
15 years 2 months ago
French Order Without Order
To account for the semi-freeword order ofFrench, Unification Categorial Grammar is extended in two ways. First, verbal valencies are contained in a set rather than in a list. Seco...
Gabriel G. Bès, Claire Gardent
IFIPTCS
2010
14 years 11 months ago
A Logic on Subobjects and Recognizability
We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expres...
Harrie Jan Sander Bruggink, Barbara König
GG
2008
Springer
15 years 2 months ago
On the Recognizability of Arrow and Graph Languages
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which ...
Harrie Jan Sander Bruggink, Barbara König