A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable Names
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
A formalised first-order confluence proof for the λ-calculus using one-sorted variable names
Information and Computation - RTA 2001
Linking algebraic observational equivalence and bisimulation
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Hi-index | 0.00 |
By representing transition systems as coalgebras, the three main ingredients of their theory: coalgebra, homomorphism, and bisimulation, can be seen to be in a precise correspondence to the basic notions of universal algebra: Sigma-algebra, homomorphism, and substitutive relation (or congruence). In this paper, some standard results from universal algebra (such as the three isomorphism theorems and facts on the lattices of subalgebras and congruences) are reformulated (using the afore mentioned correspondence) and proved for transition systems.