Based on our experience with modelling and verifying microarchitectural designs within
Haskell, this paper examines our use of Haskell as host for an embedded language. In …

Invariance of interpretation by β-conversion is one of the minimal requirements for any
standard model for the λ-calculus. With the intersection-type systems being a general …

A unification method based on the λs e-style of explicit substitution is proposed. This method
together with appropriate translations, provide a Higher Order Unification (HOU) procedure …

The aim of this article is to compare two styles of Explicit Substitutions: the λσ-and λ s-styles.
We start by introducing a criterion of adequacy to simulate β-reduction in calculi of explicit …

We investigate finite-rank intersection type systems, analyzing the complexity of their type
inference problems and their relation to the problem of recognizing semantically equivalent …

Postponement of βΚ-contractions and the conservation theorem do not hold for ordinary β
but have been established by de Groote for a mixture of β with another reduction relation. In …

We introduce λε, a simply typed calculus with environments as first class values. As well as
the usual constructs of λ and application, we have e [a] which evaluates term a in an …

The past decade has seen an explosion of work on calculi of explicit substitutions.
Numerous works have illustrated the usefulness of these calculi for practical notions like the …

In this paper, a notation influenced by de Bruijn's syntax of the λ-calculus is used to describe
canonical forms of terms and an equivalence relation which divides terms into classes …

We define an extension of pure type systems with explicit substitution. We show that the type
systems with explicit substitution are strongly normalizing iff their ordinary counterparts are …