This paper presents a new Lambda-Boolean reduction machine for Lambda-Boolean and Lambda-Beta Boolean reductions in the context of Lambda Calculus and introduces the role of Churc...
Abstract We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.
We present a procedure for computing normal forms of terms in Abadi and Cardelli’s functional object calculus. Even when equipped with simple types, terms of this calculus are no...
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
We study the resource calculus – the non-lazy version of Boudol’s λ-calculus with resources. In such a calculus arguments may be finitely available and mixed, giving rise to ...