Sciweavers

1445 search results - page 60 / 289
» Uniformly Hard Languages
Sort
View
ECOOPW
1998
Springer
14 years 2 months ago
Replication as an Aspect
We have performed an experiment in writing an aspect language for replication. This experiment has shown that although at rst sight replication could easily be described as an asp...
Johan Fabry
RR
2010
Springer
13 years 8 months ago
A RESTful SWRL Rule Editor
The sparse application of the Semantic Web Rule Language is partly caused by a lack of intuitive rule editors. This applies both from a human user’s, as well as from a software i...
Carsten Keßler
MFCS
2005
Springer
14 years 3 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
ENTCS
2007
98views more  ENTCS 2007»
13 years 10 months ago
Type Systems for Optimizing Stack-based Code
We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness...
Ando Saabas, Tarmo Uustalu
IANDC
2007
81views more  IANDC 2007»
13 years 10 months ago
Some natural conditions on incremental learning
The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requirements s...
Sanjay Jain, Steffen Lange, Sandra Zilles