Sciweavers

1193 search results - page 135 / 239
» Database Query Languages and Functional Logic Programming
Sort
View
TCS
2011
14 years 9 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
SEMWEB
2009
Springer
15 years 9 months ago
Dynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes
RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently ...
Giovambattista Ianni, Thomas Krennwallner, Alessan...
POPL
1997
ACM
15 years 6 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
JCSS
2002
114views more  JCSS 2002»
15 years 2 months ago
Polymorphic Type Inference for the Relational Algebra
A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and ...
Jan Van den Bussche, Emmanuel Waller
ISI
2003
Springer
15 years 7 months ago
Active Database Systems for Monitoring and Surveillance
In many intelligence and security tasks it is necessary to monitor data in database in order to detect certain events or changes. Currently, database systems offer triggers to pro...
Antonio Badia