We study the correspondence between a concurrent lambda-calculus in administrative, continuation passing style and a pi-calculus and we derive a termination result for the latter
International audienceWe present a method for ensuring termination of lambda- calculi with reference...
We present a type system to guarantee termination of pi-calculus processes that exploits input/outpu...
International audienceThe relations between the pi-calculus and logic have been less extensively stu...
International audienceWe present a type system to guarantee termination of pi-calculus processes tha...
We study termination of programs in concurrent higher-order languages. A higher-order concurrent...
AbstractWe study termination of programs in concurrent higher-order languages. A higher-order concur...
The the lambda mu mu~ - calculus is a variant of the lambda-calculus with significant differences, i...
none3We study termination of programs in concurrent higher-order languages. A higher-order concurren...
Cette thèse propose une étude de la terminaison dans les systèmes concurrents. La terminaison est un...
none3siWe present a method for ensuring termination of lambda-calculi with references. This method m...
International audienceWe present a method for ensuring termination of lambda- calculi with reference...
We present a type system to guarantee termination of pi-calculus processes that exploits input/outpu...
International audienceThe relations between the pi-calculus and logic have been less extensively stu...
International audienceWe present a type system to guarantee termination of pi-calculus processes tha...
We study termination of programs in concurrent higher-order languages. A higher-order concurrent...
AbstractWe study termination of programs in concurrent higher-order languages. A higher-order concur...
The the lambda mu mu~ - calculus is a variant of the lambda-calculus with significant differences, i...
none3We study termination of programs in concurrent higher-order languages. A higher-order concurren...
Cette thèse propose une étude de la terminaison dans les systèmes concurrents. La terminaison est un...
none3siWe present a method for ensuring termination of lambda-calculi with references. This method m...
International audienceWe present a method for ensuring termination of lambda- calculi with reference...
We present a type system to guarantee termination of pi-calculus processes that exploits input/outpu...
International audienceThe relations between the pi-calculus and logic have been less extensively stu...