Type algebras, functor categories and block structure
Algebraic methods in semantics
Process algebra
Notions of computation and monads
Information and Computation
A fully abstract denotational model for higher-order processes
Information and Computation
Algebraic theories for name-passing calculi
Information and Computation
Handbook of logic in computer science (vol. 3)
Pi-calculus, dialogue games and full abstraction PCF
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
CPO Models for a Class of GSOS Languages
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Pi-I: A Symmetric Calculus Based on Internal Mobility
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A domain equation for bisimulation
Information and Computation
Combinatory formulations of concurrent languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
A fully abstract denotational semantics for the π-calculus
Theoretical Computer Science
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A pi-calculus Process Semantics of Concurrent Idealised ALGOL
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Notions of Computation Determine Monads
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
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A semantic theory for value-passing processes based on the late approach
Information and Computation
Term rewriting with variable binding: an initial algebra approach
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A filter model for mobile processes
Mathematical Structures in Computer Science
Models for name-passing processes: interleaving and causal
Information and Computation
A fully abstract may testing semantics for concurrent objects
Theoretical Computer Science
A game semantics of the asynchronous π-calculus
CONCUR 2005 - Concurrency Theory
Consistency of the theory of contexts
Journal of Functional Programming
ACM SIGACT News
An initial algebra approach to term rewriting systems with variable binders
Higher-Order and Symbolic Computation
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
Structured coalgebras and minimal HD-automata for the π-calculus
Theoretical Computer Science - Mathematical foundations of computer science 2000
Relationally Staged Computations in Calculi of Mobile Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak bisimilarity coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Families of Symmetries as Efficient Models of Resource Binding
Electronic Notes in Theoretical Computer Science (ENTCS)
Freshness and name-restriction in sets of traces with names
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
A Resource Analysis of the π-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Object connectivity and full abstraction for a concurrent calculus of classes
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Java JR: fully abstract trace semantics for a core java language
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Mathematical models of computational and combinatorial structures
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A Denotational Semantics for the π-Calculus
IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
| Hi-index | 0.00 |