8 citations · 18 across the 6 of their papers we have counts for
8 papers
Concurrent Realizability on Conjunctive Structures
Emmanuel Beffara, Félix Castro, Mauricio Guillermo
The point of this work is to explore axiomatisations of concurrent computation using the technology of proof theory and realizability. To deal with this problem, we redefine the Co…
Unifying type systems for mobile processes
Emmanuel Beffara
We present a unifying framework for type systems for process calculi. The core of the system provides an accurate correspondence between essentially functional processes and linear…
A proof-theoretic view on scheduling in concurrency
Emmanuel Beffara
This paper elaborates on a new approach of the question of the proof-theoretic study of concurrent interaction called "proofs as schedules". Observing that proof theory is well sui…
Functions as proofs as processes
Emmanuel Beffara
This paper presents a logical approach to the translation of functional calculi into concurrent process calculi. The starting point is a type system for the π-calculus closely rela…
Order algebras: a quantitative model of interaction
Emmanuel Beffara
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that repre…
Verification of Timed Automata Using Rewrite Rules and Strategies
Emmanuel Beffara, Olivier Bournez, Hassen Kacem +1
ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. Timed automata is a clas…