This article explores the use of non-idempotent intersection types in the framework of the λ-
calculus. Different topics are presented in a uniform framework: head normalization, weak …

This article will show the usefulness and elegance of strict intersection types for the Lambda
Calculus, that are strict in the sense that they are the representatives of equivalence classes …

We propose a novel verification method for higher-order functional programs based on
higher-order model checking, or more precisely, model checking of higher-order recursion …

Let S be some type system. A ty** in S for a typable term M is the collection of all of the
information other than M which appears in the final judgement of a proof derivation showing …

Starting from an exact correspondence between linear approximations and non-idempotent
intersection types, we develop a general framework for building systems of intersection …

We present a ty** system with non-idempotent intersection types, ty** a term syntax
covering three different calculi: the pure λ-calculus, the calculus with explicit substitutions λ …

Consider the following problem: given a simply typed lambda term of Boolean type and of
order r, does it normalize to" true"? A related problem is: given a term M of word type and of …

Erlang is a functional programming language with dynamic ty**. The language offers
great flexibility for destructing values through pattern matching and dynamic type tests …

Type-free lazy λ-calculus is enriched with angelic parallelism and demonic nondeterminism.
Call-by-name and call-by-value abstractions are considered and the operational semantics …

We study the semantics of an untyped λ-calculus equipped with operators representing read
and write operations from and to a global store. We adopt the monadic approach to model …