Sciweavers

3319 search results - page 71 / 664
» Type Theoretical Databases
Sort
View
SAC
2009
ACM
15 years 2 months ago
SWOBE - embedding the semantic web languages RDF, SPARQL and SPARUL into java for guaranteeing type safety, for checking the sat
The Semantic Web and its technologies become increasingly important. As more and more Semantic Web applications are being used, developing more stable Semantic Web applications be...
Sven Groppe, Jana Neumann, Volker Linnemann
TLCA
2009
Springer
15 years 4 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey
TCS
1998
14 years 9 months ago
Unary PCF is Decidable
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
Ralph Loader
LICS
2009
IEEE
15 years 4 months ago
Indexed Containers
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
Thorsten Altenkirch, Peter Morris
EFDBS
2001
14 years 11 months ago
Using Stored Behaviour in Object-Oriented Databases
The existing standard for object-oriented databases (ODMG) provides no facility for storing behaviour. This lack of stored behaviour introduces problems for generic applications as...
Dalen Kambur, Mark Roantree