2152 search results - page 47 / 431 » On Automating the Calculus of Relations |
141
click to vote
TLCA
2007
Springer
15 years 10 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
235
click to vote
POPL
2004
ACM
16 years 4 months 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...
132
click to vote
LICS
2002
IEEE
15 years 9 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...
146
click to vote
LFCS
1994
Springer
15 years 8 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
149
click to vote
IJAR
2008
15 years 4 months ago
2008
Qualitative spatial information plays a key role in many applications. While it is well-recognized that all but a few of these applications deal with spatial information that is a...