
Upward confluence in the interaction calculus
The lambda calculus is not upward confluent, one of counterexamples bein...
read it

Introduction to Judea Pearl's DoCalculus
This is a purely pedagogical paper with no new results. The goal of the ...
read it

Toward General Analysis of Recursive Probability Models
There is increasing interest within the research community in the design...
read it

On the Recognizing Power of the Lambek Calculus with Brackets
Every language recognized by the Lambek calculus with brackets is contex...
read it

A Bisimilarity Congruence for the Applied piCalculus Sufficiently Coarse to Verify Privacy Properties
This paper is the first thorough investigation into the coarsest notion ...
read it

On the relative power of algebraic approximations of graph isomorphism
We compare the capabilities of two approaches to approximating graph iso...
read it

Combinatorics of explicit substitutions
λυ is an extension of the λcalculus which internalises the calculus of ...
read it
Refining Properties of Filter Models: Sensibility, Approximability and Reducibility
In this paper, we study the tedious link between the properties of sensibility and approximability of models of untyped λcalculus. Approximability is known to be a slightly, but strictly stronger property that sensibility. However, we will see that so far, each and every (filter) model that have been proven sensible are in fact approximable. We explain this result as a weakness of the sole known approach of sensibility: the Tait reducibility candidates and its realizability variants. In fact, we will reduce the approximability of a filter model D for the λcalculus to the sensibility of D but for an extension of the λcalculus that we call λcalculus with Dtests. Then we show that traditional proofs of sensibility of D for the λcalculus are smoothly extendable for this λcalculus with Dtests.
READ FULL TEXT
Comments
There are no comments yet.