Sciweavers

1515 search results - page 5 / 303
» On the relation of aspects and monads
Sort
View
ICALP
2007
Springer
14 years 1 months ago
A Combinatorial Theorem for Trees
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...
Thomas Colcombet
RTA
2004
Springer
14 years 25 days ago
Querying Unranked Trees with Stepwise Tree Automata
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata c...
Julien Carme, Joachim Niehren, Marc Tommasi
LICS
1994
IEEE
13 years 11 months ago
A General Semantics for Evaluation Logic
The original semantics of Evaluation Logic in [Mog93] relies on additional properties of strong monads. This paper extends the original semantics by dropping all additional requir...
Eugenio Moggi
EMNLP
2007
13 years 9 months ago
Extracting Aspect-Evaluation and Aspect-Of Relations in Opinion Mining
The technology of opinion extraction allows users to retrieve and analyze people’s opinions scattered over Web documents. We define an opinion unit as a quadruple consisting of...
Nozomi Kobayashi, Kentaro Inui, Yuji Matsumoto
CIE
2007
Springer
14 years 1 months ago
Hierarchies in Fragments of Monadic Strict NP
We expose a strict hierarchy within monotone monadic strict NP without inequalities (MMSNP), based on the number of second-order monadic quantifiers. We do this by studying a fin...
Barnaby Martin, Florent R. Madelaine