
Factorization in CallbyName and CallbyValue Calculi via Linear Logic (long version)
In each variant of the lambdacalculus, factorization and normalization ...
read it

Explicit Auditing
The Calculus of Audited Units (CAU) is a typed lambda calculus resulting...
read it

Lambda Calculus and Probabilistic Computation
We introduce two extensions of λcalculus with a probabilistic choice op...
read it

Separating Sessions Smoothly
This paper introduces Hypersequent GV (HGV), a modular and extensible co...
read it

A Symmetric LambdaCalculus Corresponding to the NegationFree Bilateral Natural Deduction
Filinski constructed a symmetric lambdacalculus consisting of expressio...
read it

Abstract categorial grammars with island constraints and effective decidability
A wellknown approach to treating syntactic island constraints in the se...
read it

Decomposing Probabilistic Lambdacalculi
A notion of probabilistic lambdacalculus usually comes with a prescribe...
read it
The Bang Calculus and the Two Girard's Translations
We study the two Girard's translations of intuitionistic implication into linear logic by exploiting the bang calculus, a paradigmatic functional language with an explicit boxoperator that allows both callbyname and callbyvalue lambdacalculi to be encoded in. We investigate how the bang calculus subsumes both callbyname and callbyvalue lambdacalculi from a syntactic and a semantic viewpoint.
READ FULL TEXT
Comments
There are no comments yet.