2962 search results - page 231 / 593 » Reasoning on Association Rules |
155
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a new approach to introducing an extensional propositional equality in Intensional Type Theory. Our construction is based on the observation that there is a sound, inte...
176
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
169
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
: We give a semantics for a typed object calculus, an extension of System F with object subsumption and method override. We interpret the calculus in a per model, proving the sound...
148
click to vote
CSL
1994
Springer
15 years 10 months ago
1994
Springer
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
135
click to vote
LICS
1987
IEEE
15 years 10 months ago
1987
IEEE
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus ...