A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Term rewriting with variable binding: an initial algebra approach
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A framework for typed HOAS and semantics
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Explicit substitutions and higher-order syntax
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Models for name-passing processes: interleaving and causal
Information and Computation
Category theory for operational semantics
Theoretical Computer Science - Selected papers of CMCS'03
Consistency of the theory of contexts
Journal of Functional Programming
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
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
Explicit substitutions and higher-order syntax
Higher-Order and Symbolic Computation
Coalgebraic Modal Logic Beyond Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Bialgebraic Methods in Structural Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Recursively defined metric spaces without contraction
Theoretical Computer Science
A Well-behaved LTS for the Pi-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Free-algebra models for the π -calculus
Theoretical Computer Science
A Category of Explicit Fusions
Concurrency, Graphs and Models
A Categorical Model of the Fusion Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
Theoretical Computer Science
A congruence rule format for name-passing process calculi
Information and Computation
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
Comparing Operational Models of Name-Passing Process Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Relationally Staged Computations in Calculi of Mobile Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Some Characterization Results for Permutation Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Modules over monads and initial semantics
Information and Computation
Modules over monads and linearity
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi
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)
Symmetries, local names and dynamic (de)-allocation of names
Information and Computation
Modularity and Implementation of Mathematical Operational Semantics
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
Mathematical models of computational and combinatorial structures
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A unifying model of variables and names
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Modalities in the Stone age: A comparison of coalgebraic logics
Theoretical Computer Science
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
Theoretical Computer Science
A Presheaf Environment for the Explicit Fusion Calculus
Journal of Automated Reasoning
Network Conscious π-calculus: A Concurrent Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Coinductive Predicates and Final Sequences in a Fibration
Electronic Notes in Theoretical Computer Science (ENTCS)
Instances of Computational Effects: An Algebraic Perspective
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |
Abstract: We provide a semantic framework for (first order) message-passing process calculi by combining categorical theories of abstract syntax with binding and operational semantics. In particular, we obtain abstract rule formats for name and value passing with both late and early interpretations. These formats induce an initial-algebra/final-coalgebra semantics that is compositional, respects substitution, and is fully abstract for late and early congruence. We exemplify the theory with the p-calculus and value-passing CCS.