—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Abstract. In this paper, we present a logic-based model for an accurate generation of intensional responses within a cooperative questionanswering framework. We develop several cat...
We present a calculus of mobile processes without prefix or summation, and using two different encodings we show that it can express both action prefix and guarded summation. O...
We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as good as seems possible th...
This paper describes howautomated deduction methods for natural language processing can be applied moreefficiently by encodingcontext in a moreelaborate way. Our workis based on f...