| Publication | Date of Publication | Type |
|---|
| A linear time process algebra | 2024-04-29 | Paper |
On thin air reads: towards an event structures model of relaxed memory
Logical Methods in Computer Science | 2019-05-17 | Paper |
Functional reactive types
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
On thin air reads towards an event structures model of relaxed memory
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
A theory of weak bisimulation for core CML
Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 | 2016-09-01 | Paper |
An extensible approach to session polymorphism
Mathematical Structures in Computer Science | 2016-07-28 | Paper |
| Contextual equivalence for higher-order \(\pi\)-calculus revisited | 2016-05-03 | Paper |
Functional reactive programming with liveness guarantees
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming | 2015-03-30 | Paper |
Typing Correspondence Assertions for Communication Protocols
Electronic Notes in Theoretical Computer Science | 2013-04-26 | Paper |
| The lax braided structure of streaming I/O | 2012-09-18 | Paper |
Lambda-RBAC: Programming with Role-Based Access Control
Logical Methods in Computer Science | 2008-08-07 | Paper |
Efficient and Expressive Tree Filters
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Full abstraction for polymorphic \(\pi \)-calculus
Theoretical Computer Science | 2008-03-05 | Paper |
Contextual equivalence for higher-order pi-calculus revisited
Logical Methods in Computer Science | 2007-10-11 | Paper |
λ-RBAC: Programming with Role-Based Access Control
Automata, Languages and Programming | 2007-09-11 | Paper |
Typed parametric polymorphism for aspects
Science of Computer Programming | 2006-12-14 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Pattern-matching spi-calculus
Information and Computation | 2006-08-17 | Paper |
Foundations of Software Science and Computational Structures
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2005-09-13 | Paper |
CONCUR 2004 - Concurrency Theory
Lecture Notes in Computer Science | 2005-08-23 | Paper |
A fully abstract may testing semantics for concurrent objects
Theoretical Computer Science | 2005-06-30 | Paper |
A theory of bisimulation for a fragment of concurrent ML with local names
Theoretical Computer Science | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 1962753 (Why is no real title available?) | 2003-08-11 | Paper |
Typing correspondence assertions for communication protocols
Theoretical Computer Science | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1832233 (Why is no real title available?) | 2002-11-19 | Paper |
| Semantics for core Concurrent ML using computation types | 2001-07-08 | Paper |
| scientific article; zbMATH DE number 1499084 (Why is no real title available?) | 2000-09-03 | Paper |
A fully abstract semantics for a higher-order functional language with nondeterministic computation
Theoretical Computer Science | 2000-08-23 | Paper |
A theory of weak bisimulation for Core CML
Journal of Functional Programming | 1999-03-28 | Paper |
| scientific article; zbMATH DE number 1231608 (Why is no real title available?) | 1999-01-06 | Paper |
| scientific article; zbMATH DE number 1231463 (Why is no real title available?) | 1998-12-10 | Paper |
A complete axiomatization of timed bisimulation for a class of timed regular behaviours
Theoretical Computer Science | 1997-02-27 | Paper |
