1445 search results - page 230 / 289 » Uniformly Hard Languages |
147
click to vote
RULES
1993
Springer
15 years 10 months ago
1993
Springer
There have been many recent research efforts on temporal databases for managing current and historical data and on active databases for monitoring real-world events as well as dat...
148
click to vote
PODS
1994
ACM
15 years 10 months ago
1994
ACM
We present a typed polymorphic calculus that supports a general mechanism for view definition and object sharing among classes. In this calculus, a class can contain inclusion spe...
162
click to vote
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
183
click to vote
CASC
2006
Springer
15 years 9 months ago
2006
Springer
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
202
click to vote
FLOPS
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...