91 search results - page 11 / 19 » The Second Calculus of Binary Relations |
115
click to vote
PPDP
2010
Springer
14 years 10 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
88
Voted
LICS
2002
IEEE
15 years 4 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
103
click to vote
ICFP
2010
ACM
15 years 23 days ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
LREC
2010
15 years 1 months ago
2010
In the first part of this paper, we present a framework for enriching arbitrary upper or domain-specific ontologies with a concept of time. To do so, we need the notion of a time ...
ADBIS
2000
Springer
15 years 4 months ago
2000
Springer
The majority of database benchmarks currently in use in the industry were designed for relational databases. A different class of benchmarks became required for object oriented dat...