Sciweavers

230 search results - page 2 / 46
» Type inference for datalog with complex type hierarchies
Sort
View
ICFP
2005
ACM
14 years 5 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
PVLDB
2008
121views more  PVLDB 2008»
13 years 4 months ago
Type inference and type checking for queries on execution traces
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe exec...
Daniel Deutch, Tova Milo
DOOD
1993
Springer
135views Database» more  DOOD 1993»
13 years 9 months ago
A Deductive and Typed Object-Oriented Language
In this paper we introduce a logical query language extended with object-oriented typing facilities. This language, called DTL (from DataTypeLog), can be seen as an extension of Da...
René Bal, Herman Balsters
TGC
2007
Springer
13 years 11 months ago
On the Complexity of Termination Inference for Processes
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
Romain Demangeon, Daniel Hirschkoff, Naoki Kobayas...
CIE
2006
Springer
13 years 9 months ago
Complexity-Theoretic Hierarchies
We introduce two hierarchies of unknown ordinal height. The hierarchies are induced by natural fragments of a calculus based on finite types and G
Lars Kristiansen