Equational systems and free constructions

Authors:
Marcelo Fiore;Chung-Kil Hur
Affiliations:
Computer Laboratory, University of Cambridge;Computer Laboratory, University of Cambridge
Venue:
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Year:
2007

Citing 7
Cited 5

Domain theory

Handbook of logic in computer science (vol. 3)
A fully abstract model for the π-calculus

Information and Computation
Abstract Syntax and Variable Binding

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Dualising initial algebras

Mathematical Structures in Computer Science
Rewriting via coinserters

Nordic Journal of Computing
Computational Effects and Operations: An Overview

Electronic Notes in Theoretical Computer Science (ENTCS)
Free-algebra models for the π-calculus

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Functorial Coalgebraic Logic: The Case of Many-sorted Varieties

Electronic Notes in Theoretical Computer Science (ENTCS)
Term Equational Systems and Logics

Electronic Notes in Theoretical Computer Science (ENTCS)
On the construction of free algebras for equational systems

Theoretical Computer Science
Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names

Electronic Notes in Theoretical Computer Science (ENTCS)
Presenting functors on many-sorted varieties and applications

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this paper is threefold: to present a general abstract, yet practical, notion of equational system; to investigate and develop a theory of free constructions for such equational systems; and to illustrate the use of equational systems as needed in modern applications, specifically to the theory of substitution in the presence of variable binding and to models of name-passing process calculi.