97 search results - page 5 / 20 » A 'Natural Logic' inference system using the Lambek calculus |
TCS
2008
13 years 7 months ago
2008
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
AIML
2004
13 years 8 months ago
2004
The family of normal propositional modal logic systems are given a highly systematic organisation by their model theory. This model theory is generally given using Kripkean frame s...
PLILP
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
APLAS
2004
ACM
13 years 11 months ago
2004
ACM
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher-order programs. The ...
AIML
2006
13 years 8 months ago
2006
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference ...