This paper provides foundations for strong (that is, possibly under
abst...
We investigate non-wellfounded proof systems based on parsimonious logic...
The denotational semantics of the untyped lambda-calculus is a well deve...
We present a technique to study normalizing strategies when termination ...
This paper provides a characterization of call-by-value solvability usin...
Differential linear logic (DiLL) provides a fine analysis of resource
co...
This paper explores two topics at once: the use of denotational semantic...
We study the reduction in a lambda-calculus derived from Moggi's
computa...
In each variant of the lambda-calculus, factorization and normalization ...
A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be
...
We present a new technique for proving factorization theorems for compou...
A notion of probabilistic lambda-calculus usually comes with a prescribe...
A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be
...
Lambda-calculi come with no fixed evaluation strategy. Different strateg...
Extending the lambda-calculus with a construct for sharing, such as let
...
We investigate the possibility of a semantic account of the execution ti...
We study the two Girard's translations of intuitionistic implication int...
A cornerstone of the theory of lambda-calculus is that intersection type...
We investigate the possibility of a semantic account of the execution ti...
The good properties of Plotkin's call-by-value lambda-calculus crucially...