3319 search results - page 53 / 664 » Type Theoretical Databases |
136
click to vote
TLCA
1997
Springer
15 years 5 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
97
Voted
DEBU
1999
15 years 14 days ago
1999
WOL is a Horn-clause language for specifying transformations involving complex types and recursive data-structures. Its declarative syntax makes programs easy to modify in respons...
106
click to vote
TLCA
2007
Springer
15 years 7 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
104
Voted
OOPSLA
1989
Springer
15 years 4 months ago
1989
Springer
Method inheritance and data abstraction are central features of objectoriented programming that are attained through a hierarchical organization of classes. Recent studies have sh...
115
Voted
SIGMOD
2000
ACM
15 years 5 months ago
2000
ACM
We consider spatio-temporal databases supporting spatial objects with continuously changing position and extent, termed moving objects databases. We formally define a data model f...