Handbook of logic in computer science (vol. 3)
Automata and Algebras in Categories
Automata and Algebras in Categories
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
Mathematical Structures in Computer Science
Nordic Journal of Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
Second-Order and Dependently-Sorted Abstract Syntax
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Computational Effects and Operations: An Overview
Electronic Notes in Theoretical Computer Science (ENTCS)
A formal calculus for informal equality with binding
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Equational systems and free constructions
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Mathematical Synthesis of Equational Deduction Systems
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Monad transformers as monoid transformers
Theoretical Computer Science
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Discrete generalised polynomial functors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 5.23 |
The purpose of this paper is threefold: to present a general abstract, yet practical, notion of equational system; to investigate and develop the finitary and transfinite construction of free algebras for equational systems; and to illustrate the use of equational systems as needed in modern applications.