Notions of computation and monads
Information and Computation
A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
Structured coalgebras and minimal HD-automata for the π-calculus
Theoretical Computer Science - Mathematical foundations of computer science 2000
Hi-index | 0.00 |