Some varieties of equational logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4060 LNCS, Issue , 2006, Pages 150-156

  Plotkin, Gordon ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; FORMAL LOGIC; PARAMETER ESTIMATION; VECTORS;

ALGEBRAIC DATATYPES; EQUATIONAL LOGIC; EQUATIONAL THEORIES; FIRST-ORDER SYNTAX;

ALGEBRA;

EID: 34047169544     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780274_8     Document Type: Conference Paper

References (23)

1. F. Baader & T. Nipkow, Term Rewriting and All That, Cambridge University Press, 1998.
2. N. Benton, J. Hughes & E. Moggi, Monads and Effects, Proc. APPSEM 2000, LNCS, 2395, 42-122, Springer-Verlag, 2002.
3. S. L. Bloom, Varieties of Ordered Algebras, J. Comput. Syst. Sci., 13(2), 200-212, 1976.
4. S. L. Bloom & Z. Esik, Iteration Theories: The Equational Logic of Iterative Processes, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1993.
5. M. Hennessy & G. D. Plotkin, Full Abstraction for a Simple Parallel Programming Language, Proc. 8th. MFCS (ed. J. Becvár), LNCS, 74, 108-120, Springer-Verlag, 1979.
6. J. M. E. Hyland, P. B. Levy, G. D. Plotkin & A. J. Power, Combining Continuations with Other Effects, Proc. 4th. ACM SIGPLAN Continuations Workshop, 45-47, University of Birmingham Report CSR-04-1, 2004.
7. J. M. E. Hyland, G. D. Plotkin & A. J. Power, Combining Effects: Sum and Tensor, Theoretical Computer Science, to appear, 2006.
8. A. J. C. Hurkens, M. McArthur, Y. N. Moschovakis, L. S. Moss & G. T. Whitney, The Logic Of Recursive Equations, JSL, 63(2), 451-478, 1998.
9. J-P. Jouannaud, Twenty Years Later, Proc. 16th. RTA (ed. J. Giesl), LNCS, 3467, 368-375, Springer-Verlag, 2005.
10. J. Meseguer, Varieties of Chain-Complete Algebras, JPAA, 19, 347-383, 1980.
11. E. Moggi, Computational Lambda-Calculus and Monads, Proc. 4th. LICS, 14-23, IEEE Press, 1989.
12. E. Moggi, Notions of Computation and Monads, Inf. & Comp., 93(1), 55-92, 1991.
13. G. D. Plotkin, A Domain-Theoretic Banach-Alaoglu Theorem, Festschrift for Klaus Keimel, MSCS, 16, 1-13, 2006.
14. G. D. Plotkin & A. J. Power, Adequacy for Algebraic Effects, Proc. 4th. FOSSACS (eds. F. Honsell & M. Miculan), LNCS, 2030, 1-24, Springer-Verlag, 2001.
15. G. D. Plotkin & A. J. Power, Notions of Computation Determine Monads, Proc. 5th. FOSSACS, LNCS, 2303, 342-356, Springer-Verlag, 2002.
16. G. D. Plotkin & A. J. Power, Algebraic Operations and Generic Effects, Applied Categorical Structures, 11(1), 69-94, 2003.
17. G. D. Plotkin & A. J. Power, Logic for Computational Effects: Work in Progress, Proc. 6th. IWFM (eds. J. M. Morris, B. Aziz & F. Oehl), Electronic workshops in computing, BCS, 2003.
18. G. D. Plotkin & A. J. Power, Computational Effects and Operations: an Overview, Proc. Domains VI, ENTCS, 73, 149-163, Elsevier, 2004.
19. A. J. Power, Enriched Lawvere Theories, Theory and Applications of Categories, 6, 83-93, 2000.
20. A. J. Power, Discrete Lawvere Theories, Proc. 1st. CALCO (eds. J. L. Fiadeira, N. Harman, M. Roggenbach & J. J. M. M. Rutten), LNCS, 3629, 348-363, Springer-Verlag, 2005.
21. A. Simpson & G. Plotkin, Complete Axioms for Categorical Fixed-point Operators, Proc. 15th. LICS, 30-41, IEEE Press, 2000.
22. R. Tix, K. Keimel and G. Plotkin, Semantic Domains for Combining Probability and Non-Determinism, ENTCS, Vol. 129, pp. 1-104, Amsterdam: Elsevier, 2005.
23. E. G. Wagner, J. B. Wright, J. A. Goguen & J. W. Thatcher, Some Fundamentals of Order-Algebraic Semantics, Proc. 5th. MFCS (ed. A. W. Mazurkiewicz), LNCS, 45, 153-168, Springer-Verlag, 1976.