Sciweavers

813 search results - page 55 / 163
» Languages for Relational Databases over Interpreted Structur...
Sort
View
FOSSACS
2009
Springer
14 years 3 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
IR
2006
13 years 8 months ago
A relatedness analysis of government regulations using domain knowledge and structural organization
The complexity and diversity of government regulations make understanding and retrieval of regulations a non-trivial task. One of the issues is the existence of multiple sources o...
Gloria T. Lau, Kincho H. Law, Gio Wiederhold
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 8 months ago
An Evidential Path Logic for Multi-Relational Networks
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
Marko A. Rodriguez, Joe Geldart
BIRTHDAY
2010
Springer
13 years 5 months ago
Database Theory, Yuri, and Me
Yuri Gurevich made many varied and deep contributions to logic for computer science. Logic provides also the theoretical foundation of database systems. Hence, it is almost unavoid...
Jan Van den Bussche
IANDC
2010
125views more  IANDC 2010»
13 years 7 months ago
Continuation semantics for the Lambek-Grishin calculus
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
Raffaella Bernardi, Michael Moortgat