Coalgebras and monads in the semantics of Java

Theoretical Computer Science

Volumn 291, Issue 3, 2003, Pages 329-349

  Jacobs, Bart ^a   Poll, Erik ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Coalgebra; Java; Monad

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; FORMAL LOGIC; JAVA PROGRAMMING LANGUAGE;

COALGEBRAS;

SEMANTICS;

EID: 0037421052     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00366-3     Document Type: Conference Paper

References (49)

1. Alves-Foss J., Lam F.S. Dynamic denotational semantics of Java. Alves-Foss J. Formal Syntax and Semantics of Java, Lecture Notes in Computer Science. Vol. 1523:1998;201-240 Springer, Berlin.
2. Baltag A. A logic for coalgebraic simulation. Reichel H. Coalgebraic Methods in Computer Science, Electronic Notes in Theoretical Computer Science. Vol. 33:2000;Elsevier, Amsterdam.
3. Barr M., Wells Ch. Toposes, Triples and Theories. 1985;Springer, Berlin.
4. van den Berg J., Huisman M., Jacobs B., Poll E. A type-theoretic memory model for verification of sequential Java programs. Bert D., Choppy C., Mosses P. Recent Trends in Algebraic Development Techniques. Lecture Notes in Computer Science. Vol. 1827:2000;1-21 Springer, Berlin.
5. van den Berg J., Jacobs B. The LOOP compiler for Java and JML. Margaria T., Yi W. Tools and Algorithms for the Construction and Analysis of Software (TACAS), Lecture Notes in Computer Science. Vol. 2031:2001;299-312 Springer, Berlin.
6. van den Berg J., Jacobs B., Poll E. Formal specification and verification of JavaCard's application identifier class. Attali I., Jensen Th. Java on Smart Cards: Programming and Security, Lecture Notes in Computer Science. Vol. 2041:2001;137-150 Springer, Berlin.
7. Christian F. Correct and robust programs. IEEE Trans. Software Eng. 10(2):1984;163-174.
8. D.A. Espinosa, Semantic lego, Ph.D. Thesis, Colombia University, New York, 1995.
9. Fiore M.P. Axiomatic Domain Theory in Categories of Partial Maps. 1996;Cambridge University Press, Cambridge, MA.
10. R. Goldblatt, Logics of Time and Computation, 2nd ed., CSLI Lecture Notes, Vol. 7, Stanford University, Stanford, CA, 1992.
11. J. Gosling, B. Joy, G. Steele, G. Bracha, The Java Language Specification, 2nd ed., The Java Series, Addison-Wesley, Reading, MA, 2000.
12. M. Huisman, Reasoning about JAVA Programs in higher order logic with PVS and Isabelle, Ph.D. Thesis, University of Nijmegen, 2001.
13. Huisman M., Jacobs B. Java program verification via a Hoare logic with abrupt termination. Maibaum T. Fundamental Approaches to Software Engineering, Lecture Notes in Computer Science. Vol. 1783:2000;284-303 Springer, Berlin.
14. Huisman M., Jacobs B. Inheritance in higher order logic. modeling and reasoning Aagaard M., Harrison J. Theorem Proving in Higher Order Logics, Lecture Notes in Computer Science. Vol. 1869:2000;301-319 Springer, Berlin.
15. Huisman M., Jacobs B., van den Berg J. A case study in class library verification. Java's Vector class Internat. J. Software Tools Technol. Transfer. 3(3):2001;332-352.
16. Jacobs B. Objects and classes, co-algebraically. Freitag B., Jones C.B., Lengauer C., Schek H.-J. Object-Orientation with Parallelism and Persistence. 1996;83-103 Kluwer Academic Publishers, Dordrecht.
17. Jacobs B. Invariants, bisimulations and the correctness of coalgebraic refinements. Johnson M. Algebraic Methodology and Software Technology, Lecture Notes in Computer Science. Vol. 1349:1997;276-291 Springer, Berlin.
18. B. Jacobs, The temporal logic of coalgebras via Galois algebras, Technical Report CSI-R9906, Computer Science Institute, University of Nijmegen, Mathematical Structures in Computer Science, to appear.
19. Jacobs B. Towards a duality result in coalgebraic modal logic. Reichel H. Coalgebraic Methods in Computer Science, Electronic Notes in Theoretical Computer Science. Vol. 33:2000;Elsevier, Amsterdam.
20. Jacobs B. A formalisation of Java's exception mechanism. Sands D. Programming Languages and Systems (ESOP), Lecture Notes in Computer Science. Vol. 2028:2001;284-301 Springer, Berlin.
21. Jacobs B. Many-sorted coalgebraic modal logic. a model-theoretic study Inf. Théor. et Appl. 35(1):2001;31-59.
22. B. Jacobs, J. van den Berg, M. Huisman, M. van Berkum, U. Hensel, H. Tews, Reasoning about classes in Java (preliminary report), in: Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), ACM Press, New York, 1998, pp. 329-340.
23. Jacobs B., Poll E. A monad for basic Java semantics. Rus T. Algebraic Methodology and Software Technology, Lecture Notes in Computer Science. Vol. 1816:2000;150-164 Springer, Berlin.
24. Jacobs B., Poll E. A logic for the Java Modeling Language JML. Hussmann H. Fundamental Approaches to Software Engineering (FASE), Lecture Notes in Computer Science. Vol. 2029:2001;284-299 Springer, Berlin.
25. Jacobs B., Rutten J. A tutorial on (co)algebras and (co)induction. EATCS Bull. 62:1997;222-259.
26. Kock A. Strong functors and monoidal monads. Arch. Math. XXIII:1972;113-120.
27. Krstić S., Launchbury J., Pavlović D. Categories of processes enriched in final coalgebras. Honsell F., Miculan M. Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science. Vol. 2030:2001;303-317 Springer, Berlin.
28. Kurz A. Specifying coalgebras with modal logic. Theoret. Comput. Sci. 260(1-2):2001;119-138.
29. Leavens G.T., Baker A.L., Ruby C. JML. a notation for detailed design Kilov H., Rumpe B. Behavioral Specifications of Business and Systems. 1999;175-188 Kluwer Academic Publishers, Dordrecht.
30. G.T. Leavens, A.L. Baker, C. Ruby, Preliminary design of JML: a behavioral interface specification language for Java, Technical Report 98-06, Department of Computer Science, Iowa State University http://www.cs.iastate.edu/̃leavens/JML.html, 1999.
31. K.R.M. Leino, Toward reliable modular programs, Ph.D. Thesis, California Institute of Technology, CA, 1995.
32. Leino K.R.M., van de Snepscheut J.L.A. Semantics of exceptions. Olderog E.-R. Programming Concepts, Methods and Calculi. 1994;447-466 North-Holland, Amsterdam.
33. Liang S., Hudak P. Modular denotational semantics for compiler construction. ESOP'96: 6th European Symp. on Programming, Lecture Notes in Computer Science. Vol. 1058:1996;219-234 Springer, Berlin.
34. Loop Project, http://www.cs.kun.nl/̃bart/LOOP/.
35. Mac Lane S. Categories for the Working Mathematician. 1971;Springer, Berlin.
36. Manes E.G. Algebraic Theories. 1974;Springer, Berlin.
37. E. Moggi, An abstract view of programming languages, Technical Report LFCS-90-113, University of Edinburgh, 1990.
38. Moggi E. Notions of computation and monads. Inform. and Comput. 93(1):1991;55-92.
39. L.S. Moss, Coalgebraic logic, Ann. Pure Appl. Logic 96 (1-3) (1999) 277-317; Erratum, Ann. Pure Appl. Logic 99 (1-3) (1999) 241-259.
40. Owre S., Rushby J.M., Shankar N., von Henke F. Formal verification for fault-tolerant architectures. prolegomena to the design of PVS IEEE Trans. Software Eng. 21(2):1995;107-125.
41. Paulson L.C. Isabelle. the next 700 theorem provers Odifreddi P. Logic and Computer Science, The APIC Series. Vol. 31:1990;361-386 Academic Press, London.
42. Peyton Jones S.L., Wadler P. Imperative functional programming. Principles of Programming Languages. 1993;71-84 ACM Press, New York.
43. E. Poll, J. van den Berg, B. Jacobs, Specification of the JavaCard API in JML, in: J. Domingo-Ferrer, D. Chan, A. Watson (Eds.), Smart Card Research and Advanced Application, Kluwer Academic Publishers, Dordrecht, 2000, pp. 135-154.
44. Poll E., van den Berg J., Jacobs B. Formal specification of the JavaCard API in JML: the APDU class. Computer Networks. 36(4):2001;407-421.
45. Reichel H. An approach to object semantics based on terminal co-algebras. Math. Structures Comput. Sci. 5:1995;129-152.
46. Rößiger M. Coalgebras and modal logic. Reichel H. Coalgebraic Methods in Computer Science, Electronic Notes in Theoretical Computer Science. Vol. 33:2000;Elsevier, Amsterdam.
47. Rößiger M. From modal logic to terminal coalgebras. Theoret. Comput. Sci. 260(1-2):2001;209-228.
48. Stoy J.E. Denotational Semantics: The Scott-Strachey Approach to Programming Language Semantics. 1977;MIT Press, Cambridge, MA.
49. Wadler P. Comprehending monads. Math. Structures Comput. Sci. 9:1992;461-493.