Emmanuel Beffara

According to our database, Emmanuel Beffara authored at least 16 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

L'algorithme: pourquoi et comment le définir pour l'enseigner.

Emmanuel Beffara

CoRR, 2024

2023

Concurrent Realizability on Conjunctive Structures.

Emmanuel Beffara, Félix Castro, Mauricio Guillermo, Étienne Miquey

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2021

Concurrent Realizability on Conjunctive Structures.

Emmanuel Beffara, Félix Castro, Mauricio Guillermo

CoRR, 2021

2018

Order algebras: a quantitative model of interaction.

Emmanuel Beffara

Math. Struct. Comput. Sci., 2018

2015

Unifying type systems for mobile processes.

Emmanuel Beffara

CoRR, 2015

2014

A logical view on scheduling in concurrency.

Emmanuel Beffara

Proceedings of the Proceedings Fifth International Workshop on Classical Logic and Computation, 2014

2012

Proofs as Executions.

Emmanuel Beffara, Virgile Mogbil

Proceedings of the Theoretical Computer Science, 2012

2011

Functions as proofs as processes

Emmanuel Beffara

CoRR, 2011

2009

Linear combinations of orders

Emmanuel Beffara

CoRR, 2009

Quantitative testing semantics for non-interleaving

Emmanuel Beffara

CoRR, 2009

2008

An Algebraic Process Calculus.

Emmanuel Beffara

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2006

Concurrent nets: A study of prefixing in process calculi.

Emmanuel Beffara, François Maurel

Theor. Comput. Sci., 2006

2005

Logique, Réalisabilité et Concurrence. (Logic, Realisability and Concurrency).

Emmanuel Beffara

PhD thesis, 2005

A Concurrent Model for Linear Logic.

Emmanuel Beffara

Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

2003

Disjunctive normal forms and local exceptions.

Emmanuel Beffara, Vincent Danos

Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

2001

Verification of Timed Automata Using Rewrite Rules and Strategies

Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner

CoRR, 2001