Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Term rewriting with variable binding: an initial algebra approach
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
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
A formal calculus for informal equality with binding
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
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
Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names
Electronic Notes in Theoretical Computer Science (ENTCS)
On universal algebra over nominal sets
Mathematical Structures in Computer Science
Second-order algebraic theories
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Completeness for algebraic theories of local state
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Generalised name abstraction for nominal sets
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Instances of Computational Effects: An Algebraic Perspective
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |
We introduce an abstract general notion of system of equations between terms, called Term Equational System, and develop a sound logical deduction system, called Term Equational Logic, for equational reasoning. Further, we give an analysis of algebraic free constructions that together with an internal completeness result may be used to synthesise complete equational logics. Indeed, as an application, we synthesise a sound and complete nominal equational logic, called Synthetic Nominal Equational Logic, based on the category of Nominal Sets.