Accattoli, Dal Lago, and Vanoni have recently proved that the space used by the Space
KAM, a variant of the Krivine abstract machine, is a reasonable space cost model for the λ …

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 λ …

We first develop a (semantical) characterization of call-by-need normalization by means of
typability, ie we show that a term is normalizing in call-by-need if and only if it is typable in a …

Many different systems with explicit substitutions have been proposed to implement a large
class of higher-order languages. Motivations and challenges that guided the development of …

We define two non-idempotent intersection type systems for the linear substitution calculus,
a calculus with partial substitutions acting at a distance that is a computational interpretation …

Calculi with explicit substitutions (ES) are widely used in different areas of computer science.
Complex systems with ES were developed these last 15 years to capture the good …

We present a simple term calculus with an explicit control of erasure and duplication of
substitutions, enjoying a sound and complete correspondence with the intuitionistic fragment …

We present the syntax and reduction rules for χ, an untyped language that is well suited to
describe structures which we call “circuits” and which are made of parts that are connected …

is an untyped continuation-style formal language with a typed subset that provides a Curry–
Howard isomorphism for a sequent calculus for implicative classical logic. can also be …

We present a simple term language with explicit operators for erasure, duplication and
substitution enjoying a sound and complete correspondence with the intuitionistic fragment …