Completeness of global evaluation logic

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

Volumn 4162 LNCS, Issue , 2006, Pages 447-458

  Goncharov, Sergey ^a   Schröder, Lutz ^a,b   Mossakowski, Till ^a,b  

^a UNIVERSITY OF BREMEN   (Germany)

^b GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; SEMANTICS;

ABSTRACT ENCAPSULATION; CARTESIAN CATEGORY; GLOBAL EVALUATION LOGIC; HEYTING ALGEBRA;

FORMAL LOGIC;

EID: 33750082022     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11821069_39     Document Type: Conference Paper

References (16)

1. N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Comm. ACM, 22:465-476, 1979.
2. M. Fluet and G. Morrisett. Monadic regions. In International Conference on Functional Programming, pages 103-114. ACM, 2004.
3. G. Hutton and E. Meijer. Monadic Parsing in Haskell. J. Functional Programming, 8:437-444, 1998.
4. B. Jacobs and E. Poll. Coalgebras and Monads in the Semantics of Java. Theoret. Comput. Sci., 291:329-349, 2003.
5. J. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1-117. Oxford, 1992.
6. S. Mac Lane. Categories for the Working Mathematician. Springer, 1997.
7. E. Moggi. Notions of computation and monads. Inform. and Comput., 93:55-92, 1991.
8. E. Moggi. A semantics for evaluation logic. Fund. Inform., 22:117-152, 1995.
9. E. Moggi and A. Sabry. Monadic encapsulation of effects: A revised approach (extended version). J. Fund. Programming, 11:591-627, 2001.
10. T. Mossakowski, L. Schröder, and S. Goncharov. Completeness of monad-based dynamic logic. Technical report, University of Bremen, 2006.
11. S. Peyton-Jones, editor. Haskell 98 Language and Libraries - The Revised Report. Cambridge, 2003.
12. Also: J. Funct. Programming 13 (2003).
13. A. Pitts. Evaluation logic. In Higher Order Workshop, Workshops in Computing, pages 162-189. Springer, 1991.
14. L. Schröder and T. Mossakowski. Monad-independent Hoare logic in HASCASL. In Fundamental Aspects of Software Engineering, volume 2621 of LNCS, pages 261-277, 2003.
15. L. Schröder and T. Mossakowski. Monad-independent dynamic logic in HASCASL. J. Logic Comput., 14:571-619, 2004.
16. M. R. Shinwell and A. M. Pitts. On a monadic semantics for freshness. Theoret. Comput. Sci., 342:28-55, 2005.