11 citations · 27 across the 11 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.PL2011★ 1 cited
Certifying and reasoning about cost annotations of functional programs
Roberto M. Amadio, Yann Regis-Gianas
We present a so-called labelling method to insert cost annotations in a higher-order functional program, to certify their correctness with respect to a standard compilation chain t…
cs.PL2011★ 7 cited
A decompilation of the pi-calculus and its application to termination
Roberto Amadio
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.
cs.PL2011
Elementary affine -calculus with multithreading and side effects
Antoine Madet, Roberto M. Amadio
Linear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this framework to programs with multithreading and side…