1321 search results - page 47 / 265 » Subtyping in Logical Form |
101
click to vote
LICS
1994
IEEE
15 years 4 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
128
click to vote
AC
1992
Springer
15 years 3 months ago
1992
Springer
Logic and databases have gone a long way together since the advent of relational databases. Already the rst basic query languages for relational databases beside relational algebra...
CF
2005
ACM
15 years 1 months ago
2005
ACM
This paper is about making reversible logic a reality for supercomputing. Reversible logic offers a way to exceed certain basic limits on the performance of computers, yet a power...
103
click to vote
IANDC
2007
14 years 11 months ago
2007
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
179
click to vote
POPL
2004
ACM
16 years 4 days ago
2004
ACM
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...