1438 search results - page 73 / 288 » An Expressive Extension of TLC |
103
click to vote
ICALP
2009
Springer
15 years 5 months ago
2009
Springer
We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
102
Voted
LICS
1999
IEEE
15 years 5 months ago
1999
IEEE
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
100
click to vote
ADC
1994
Springer
15 years 4 months ago
1994
Springer
We present a proposed query language for extended entity relationship schemas. The language improves on previous proposals by using only concepts explicitly in a given schema. It ...
CSL
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. The linear lambda calculus is very weak in terms of expressive power: in particular, all functions terminate in linear time. In this paper we consider a simple extension ...
116
Voted
SFP
2003
15 years 2 months ago
2003
: Static single information form is a natural extension of the well-known static single assignment form. It is a program intermediate representation used in optimising compilers fo...