6 citations · 25 across the 9 of their papers we have counts for
9 papers
Adding Negation to Lambda Mu
Steffen van Bakel
We present , an extension of Parigot's -calculus by adding negation as a type constructor, together with syntactic constructs that represent negation introduction and e…
Intersection Types for the lambda-mu Calculus
Steffen van Bakel, Franco Barbanera, Ugo de'Liguoro
We introduce an intersection type system for the lambda-mu calculus that is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus…
Orchestrated Session Compliance
Franco Barbanera, Steffen van Bakel, Ugo de'Liguoro
We investigate the notion of orchestrated compliance for client/server interactions in the context of session contracts. Devising the notion of orchestrator in such a context makes…
A fully-abstract semantics of lambda-mu in the pi-calculus
Steffen van Bakel, Maria Grazia Vigliotti
We study the lambda-mu-calculus, extended with explicit substitution, and define a compositional output-based interpretation into a variant of the pi-calculus with pairing that pre…
Characterisation of Strongly Normalising lambda-mu-Terms
Steffen van Bakel, Franco Barbanera, Ugo de'Liguoro
We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types. The presence of the latter…
Note on a simple type system for non-interference
Steffen van Bakel, Maria Grazia Vigliotti
We consider CCS with value passing and elaborate a notion of noninterference for the process calculi, which matches closely that of the programming language. The idea is to view ch…