We introduce a simply-typed λ-calculus (λ→ exn ) featuring an ML-like exception handling mechanism. This calculus, whose type system corresponds to classical logic through the ...
Abstract. The paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised throu...
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...