Model-checking is one of the most powerful techniques for verifying syst...
We introduce contextual behavioural metrics (CBMs) as a novel way of
mea...
In this paper we are concerned with understanding the nature of program
...
This note modifies the reference encoding of Turing machines in the
λ-ca...
We introduce a new bounded theory RS^1_2 and show that the functions whi...
We introduce a variation on Barthe et al.'s higher-order logic in which
...
We study the nature of applicative bisimilarity in λ-calculi endowed
wit...
Accattoli, Dal Lago, and Vanoni have recently proved that the space used...
A system of session types is introduced as induced by a Curry Howard
cor...
We explore the possibility of extending Mardare et al. quantitative alge...
We study the algebraic effects and handlers as a way to support
decision...
We show that an intuitionistic version of counting propositional logic
c...
Can the λ-calculus be considered as a reasonable computational model?
Ca...
In the realm of quantum computing, circuit description languages represe...
This volume contains a selection of papers presented at Linearity TLLA...
We investigate program equivalence for linear higher-order(sequential)
l...
The space complexity of functional programs is not well understood. In
p...
We study the logic obtained by endowing the language of first-order
arit...
We study counting propositional logic as an extension of propositional l...
Graded modal types systems and coeffects are becoming a standard formali...
Evaluating higher-order functional programs through abstract machines
in...
Randomized higher-order computation can be seen as being captured by a l...
Logical relations are one of the most powerful techniques in the theory ...
A notion of probabilistic lambda-calculus usually comes with a prescribe...
Type-two constructions abound in cryptography: adversaries for encryptio...
This paper revisits the Interaction Abstract Machine (IAM), a machine ba...
We introduce a new, diagrammatic notation for representing the result of...
We introduce a new form of logical relation which, in the spirit of metr...
We generalise Ehrhard and Regnier's Taylor expansion from pure to
probab...
We give a geometry of interaction model for a typed lambda-calculus endo...
In the last two decades, there has been much progress on model checking ...
In this work we introduce randomised reduction strategies, a notion alre...
We study the termination problem for probabilistic term rewrite systems....
This note is about encoding Turing machines into the lambda-calculus....