Structured operational semantics and bisimulation as a congruence
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
The lazy Lambda calculus in a concurrency scenario
Information and Computation
A theory of higher order communicating systems
Information and Computation
Structural operational semantics for weak bisimulations
Theoretical Computer Science
Proving congruence of bisimulation in functional programming languages
Information and Computation
Ntyft/ntyxt rules reduce to ntree rules
Information and Computation
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
Bisimulation for higher-order process calculi
Information and Computation
From SOS rules to proof principles: an operational metatheory for functional languages
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A conservative look at operational semantics with variable binding
Information and Computation
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
Generalized Bisimulation in Relational Specifications
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Towards a Lambda-Calculus for Concurrent and Communicating Systems
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
A format for semantic equivalence comparison
Theoretical Computer Science
A Sequent Calculus for Nominal Logic
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
On Well-Foundedness and Expressiveness of Promoted Tyft
Electronic Notes in Theoretical Computer Science (ENTCS)
Howe's Method for Calculi with Passivation
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Prototyping SOS Meta-theory in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
A thread calculus with molecular dynamics
Information and Computation
Characterizing contextual equivalence in calculi with passivation
Information and Computation
Foundational aspects of multiscale modeling of biological systems with process algebras
Theoretical Computer Science
Modular bisimulation theory for computations and values
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We lay the foundations for a Structural Operational Semantics (SOS) framework for higher order processes. Then, we propose a number of extensions to Bernstein's promoted tyft/tyxt format which aims at proving congruence of strong bisimilarity for higher order processes. The extended format is called promoted PANTH. This format is easier to apply and strictly more expressive than the promoted tyft/tyxt format. Furthermore, we propose and prove a congruence format for a notion of higher order bisimilarity arising naturally from our SOS framework. To illustrate our formats, we apply them to Thomsen's Calculus of Higher Order Communicating Systems (CHOCS).