A system of linear dependent types for the lambda calculus with full higher-order recursion,
called dlPCF, is introduced and proved sound and relatively complete. Completeness holds …

Combinatory logic is one of the most versatile areas within logic that is tied to parts of
philosophical, mathematical, and computational logic. Functioning as a comprehensive …

Once upon a time, modal logic was castigated because it 'had no semantics.'Kripke,
Hintikka, Kanger, and others changed all that. In a similar way, when Relevant Logic was …

We define a notion of recognizable sets of simply typed λ-terms that extends the notion of
recognizable sets of strings or trees. This definition is based on finite models. Using …

In this paper, we present Λ∧ t, a fully typed λ-calculus based on the intersection-type system
discipline, which is a counterpart àla Church of the type assignment system as invented by …

Simply typed λ-calculus with fixpoint combinators, λY-calculus, offers an interesting method
for approximating program semantics. The Böhm tree of a λY-term represents the meaning …

Higher-order recursive schemes are an interesting method of approximating program
semantics. The semantics of a scheme is an infinite tree labeled with built-in constants. This …

In this paper we show that the membership problem for second order non-linear Abstract
Categorial Grammars is decidable. A consequence of that result is that Montague-like …

We give a simple characterization of convergent terms in Abadi and Cardelli untyped Object
Calculus (ς-calculus) via intersection types. We consider a λ-calculus with records and its …

We provide a new and elementary proof of strong normalization for the lambda calculus of
intersection types. It uses no strong method, like for instance Tait-Girard reducibility …