PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Structured operational semantics and bisimulation as a congruence
Information and Computation
A calculus of mobile processes, I
Information and Computation
Journal of the ACM (JACM)
Proving congruence of bisimulation in functional programming languages
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Foundational aspects of syntax
ACM Computing Surveys (CSUR)
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
Encoding transition systems in sequent calculus
Theoretical Computer Science - Linear logic
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
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
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Proof Theory for Generic Judgments: An extended abstract
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A logical framework for reasoning about logical specifications
A logical framework for reasoning about logical specifications
A proof theory for generic judgments
ACM Transactions on Computational Logic (TOCL)
Model checking for π-calculus using proof search
CONCUR 2005 - Concurrency Theory
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Theoretical Computer Science
A Well-behaved LTS for the Pi-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A congruence rule format for name-passing process calculi
Information and Computation
Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof search specifications of bisimulation and modal logics for the π-calculus
ACM Transactions on Computational Logic (TOCL)
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
Information and Computation
Characterizing contextual equivalence in calculi with passivation
Information and Computation
Representing and reasoning with operational semantics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We define and use a SOS-based framework to specify the transition systems of calculi with name-passing properties. This setting uses proof-theoretic tools to take care of some of the difficulties specific to name-binding and make them easier to handle in proofs. The contribution of this paper is the presentation of a format that ensures that open bisimilarity is a congruence for calculi specified within this framework, extending the well-known tyft/tyxt format to the case of name-binding and name-passing. We apply this result to the @p-calculus in both its late and early semantics.