2152 search results - page 189 / 431 » On Automating the Calculus of Relations |
151
click to vote
TACS
1991
Springer
15 years 10 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
157
click to vote
VLDB
1991
ACM
15 years 10 months ago
1991
ACM
A model capturing the data manipulation capabilities of a large class of methods in ohjectoriented databases is proposed and investsigated. The model uses a deterministic, paralle...
174
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
169
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semi...
170
click to vote
KI
2002
Springer
15 years 6 months ago
2002
Springer
In many approaches for qualitative spatial reasoning, navigation of an agent in a more or less static environment is considered (e.g. in the double-cross calculus [12]). However, i...