Results 1 
3 of
3
An OutputBased Semantics of Λµ with Explicit Substitution
 in the πcalculus. IFIPTCS’12, LNCS 7604
, 2012
"... We study the Λµcalculus, extended with explicit substitution, and define a compositional outputbased translation into a variant of the πcalculus with pairing. We show that this translation preserves singlestep explicit head reduction with respect to contextual equivalence. We use this result to ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study the Λµcalculus, extended with explicit substitution, and define a compositional outputbased translation into a variant of the πcalculus with pairing. We show that this translation preserves singlestep explicit head reduction with respect to contextual equivalence. We use this result to show operational soundness for head reduction, adequacy, and operational completeness. Using a notion of implicative typecontext assignment for the πcalculus, we also show that assignable types are preserved by the translation. We finish by showing that termination is preserved.
Semantic Types and Approximation for Featherweight Java
"... We consider semantics for the classbased objectoriented calculus Featherweight Java based upon approximation. We also define an intersection type assignment systems for this calculus and show that it is sound and complete, i.e. types are preserved under conversion. We establish the link with betwe ..."
Abstract
 Add to MetaCart
We consider semantics for the classbased objectoriented calculus Featherweight Java based upon approximation. We also define an intersection type assignment systems for this calculus and show that it is sound and complete, i.e. types are preserved under conversion. We establish the link with between type assignment and the approximation semantics by showing an approximation result, which leads to a sufficient condition for headnormalisation and termination. We show the expressivity of our predicate system by defining an encoding of Combinatory Logic into our calculus. We show that this encoding preserves predicateability and also that our system characterises the normalising and strongly normalising terms for this encoding. We thus demonstrate that the great analytic capabilities of intersection types can be applied to the context of classbased object orientation.
Functional Type Assignment for Featherweight Java To Rinus Plasmeijer, in honour of his 61st birthday
"... We consider functional type assignment for the classbased objectoriented calculus Featherweight Java. We start with an intersection type assignment systems for this calculus for which types are preserved under conversion. We then define a variant for which type assignment is decidable, and define ..."
Abstract
 Add to MetaCart
We consider functional type assignment for the classbased objectoriented calculus Featherweight Java. We start with an intersection type assignment systems for this calculus for which types are preserved under conversion. We then define a variant for which type assignment is decidable, and define a notion of unification as well as a principal typeing algorithm. We show the expressivity of both our calculus and our type system by defining an encoding of Combinatory Logic into our calculus and showing that this encoding preserves typeability. We thus demonstrate that the great capabilities of functional types can be applied to the context of classbased object orientated programming.