On the construction of free algebras for equational systems

Theoretical Computer Science

Volumn 410, Issue 18, 2009, Pages 1704-1729

  Fiore, Marcelo ^a   Hur, Chung Kil ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Algebra; Equational system; Free construction; Monad

Indexed keywords

EQUATIONAL SYSTEM; FREE ALGEBRAS; FREE CONSTRUCTION; MODERN APPLICATIONS; MONAD;

ALGEBRA;

EID: 62249123956     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.12.052     Document Type: Article

References (33)

1. Abramsky S., and Jung A. Domain theory. In: Abramsky S., Gabbay D.M., and Maibaum T.S.E. (Eds). Handbook of Logic in Computer Science (1994), Oxford University Press 1-168
2. Adámek J. Free algebras and automata realizations in the language of categories. Commentationes Mathematicae Universitatis Carolinae 15 (1974) 589-602
3. Adámek J., and Trnková V. Automata and Algebras in Categories (1990), Kluwer Academic Publishers
4. Barr M., and Wells C. Toposes, Triples and Theories (1985), Springer-Verlag
5. Borceux F. Handbook of Categorical Algebra~2: Categories and Structures (1994), Cambridge University Press
6. Cîrstea C. An algebra-coalgebra framework for system specification. 3rd International Workshop on Coalgebraic Methods in Computer Science. Elsevier ENTCS vol.~33 (2000) 80-110
7. Clouston R., and Pitts A. Nominal equational logic. In: Cardelli L., Fiore M., and Winskel G. (Eds). Computation, Meaning and Logic: Articles dedicated to Gordon Plotkin. Elsevier ENTCS vol. 172 (2007) 223-257
8. Crole R. Categories for Types (1994), Cambridge University Press
9. Day B. On closed categories of functors. Reports of the Midwest Category Seminar IV. Springer LNM vol. 137 (1970) 1-38
10. Fiore M. Second-order and dependently-sorted abstract syntax. 23rd Symp. on Logic in Computer Science (2008), IEEE, Computer Society Press
11. M. Fiore, C.-K. Hur, Equational systems and free constructions, in: 34th International Colloquium on Automata, Languages and Programming, in: Springer LNCS, vol. 4596, 2007, pp. 607-618
12. Fiore M., Moggi E., and Sangiorgi D. A fully abstract model for the π-calculus. Information and Computation 179 1 (2002) 76-117
13. Fiore M., Plotkin G., and Turi D. Abstract syntax and variable binding. 14th Symp. on Logic in Computer Science (1999), IEEE, Computer Society Press 193-202
14. Fokkinga M. Datatype laws without signatures. Mathematical Structures in Computer Science 6 1 (1996) 1-32
15. Gabbay M.J., and Mathijssen A. A formal calculus for informal equality with binding. Workshop on Logic, Language, Information and Computation. WoLLIC'07 (2007), Springer-Verlag
16. Gabbay M.J., and Pitts A. A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 (2001) 341-363
17. Ghani N., and Lüth C. Rewriting via coinserters. Nordic Journal of Computing 10 4 (2003) 290-312
18. Ghani N., Lüth C., De Marchi F., and Power A.J. Dualising initial algebras. Mathematical Structures in Computer Science 13 2 (2003) 349-370
19. Goguen J., Thatcher J., and Wagner E. An initial algebra approach to the specification, correctness and implementation of abstract data types. In: Yeh R. (Ed). Current Trends in Programming Methodology: Software Specification and Design, vol.~IV (1978), Prentice Hall 80-149 (Chapter~5)
20. Hamana M. Free Σ-monoids: A higher-order syntax with metavariables. 2nd Asian Symp. on Programming Languages and Systems. Springer LNCS vol. 3302 (2004) 348-363
21. Hennessy M., and Plotkin G. Full abstraction for a simple parallel programming language. Mathematical Foundations of Computer Science. Springer LNCS vol. 74 (1979) 108-120
22. Janelidze G., and Kelly G.M. A note on actions of a monoidal category. Theory and Applications of Categories 9 4 (2001) 61-91
23. Kelly G.M., and Power A.J. Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads. Journal of Pure and Applied Algebra 89 (1993) 163-179
24. Kock A. Strong functors and monoidal monads. Archiv der Mathematik 23 (1972)
25. Mac~Lane S. Categories for the Working Mathematician (1971), Springer-Verlag
26. Plotkin G. Domains. Pisa Notes on Domain Theory (1983)
27. Plotkin G., and Power A.J. Algebraic operations and generic effects. Applied Categorical Structures 11 1 (2003) 69-94
28. Plotkin G., and Power A.J. Computational effects and operations: An overview. Workshop on Domains VI. Elsevier ENTCS vol.~73 (2004) 149-163
29. Power A.J. Enriched Lawvere theories. Theory and Applications of Categories 6 (1999) 83-93
30. Pym D. The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logic Series vol.~26 (2002), Kluwer Academic Publishers
31. Robinson E. Variations on algebra: Monadicity and generalisations of equational theories. Formal Aspects of Computing 13 3-5 (2002) 308-326
32. Stark I. Free-algebra models for the π-calculus. Foundations of Software Science and Computation Structures. Springer LNCS vol. 3441 (2005) 155-169
33. Worrell J. Terminal sequences for accessible endofunctors. 2nd International Workshop on Coalgebraic Methods in Computer Science. Elsevier ENTCS vol.~19 (1999)