Type class polymorphism in an institutional framework

Lecture Notes in Computer Science

Volumn 3423, Issue , 2005, Pages 234-251

  Schröder, Lutz ^a   Mossakowski, Till ^a   Lüth, Christoph ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; INFORMATION SCIENCE; MATHEMATICAL OPERATORS; SEMANTICS;

AXIOMS; HIGHER-ORDER LOGIC; INSTITUTIONAL FRAMEWORK; POLYMORPHISM;

FORMAL LOGIC;

EID: 24344436013     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31959-7_14     Document Type: Conference Paper

References (38)

1. J. Adámek, H. Herrlich, and G. E. Strecker, Abstract and concrete categories, Wiley Interscience, 1990.
2. J. Barwise, Axioms for abstract model theory, Ann. Math. Logic 7 (1974), 221-265.
3. H. Baumeister, An institution for SB-CASL, talk presented at the 15th International Workshop on Algebraic Development Techniques, Genova, 2001.
4. H. Baumeister and A. Zamulin, State-based extension of CASL, Integrated Formal Methods, LNCS, vol. 1945, Springer, 2000, pp. 3-24.
5. M. Bidoit and R. Hennicker, On the integration of observability and reachability concepts, Foundations of Software Science and Computation Structures, LNCS, vol. 2303, Springer, 2002, pp. 21-36.
6. M. Bidoit and P. D. Mosses, CASL user manual, LNCS, vol. 2900, Springer, 2004.
7. T. Borzyszkowski, Higher-order logic and theorem proving for structured specifications, Recent Trends in Algebraic Development Techniques, (WADT 99), LNCS, vol. 1827, Springer, 2000, pp. 401-418.
8. A. Bossi, R. Focardi, C. Piazza, and S. Rossi, Refinement operators and information flow security, Software Engineering and Formal Methods, IEEE Computer Society Press, 2003, pp. 44-53.
9. M. Cerioli and G. Reggio, Very abstract specifications: a formalism independent approach, Math. Struct. Comput. Sci. 8 (1998), 17-66.
10. T. Coquand, An analysis of Girard's paradox, Logic in Computer Science, IEEE, 1986, pp. 227-236.
11. R. Diaconescu, J. Goguen, and P. Stefaneas, Logical support for modularisation, Workshop on Logical Frameworks, Programming Research Group, Oxford University, 1991.
12. F. Durán and J. Meseguer, Structured theories and institutions, Category Theory and Computer Science, ENTCS, vol. 29, 1999.
13. H. Ehrig and B. Mahr, Fundamentals of algebraic specification 2, Springer, 1990.
14. C. George, P. Haff, K. Havelund, A. E. Haxthausen, R. Milne, C. Bendix Nielson, S. Prehn, and K. R. Wagner, The Raise Specification Language, Prentice Hall, 1992.
15. J. Goguen and R. Burstall, Institutions: Abstract model theory for specification and programming, J. ACM 39 (1992), 95-146.
16. J. Goguen and G. Malcolm, A hidden agenda, Theoret. Comput. Sci. 245 (2000), 55-101.
17. J. Goguen and G. Rosu, Institution morphisms, Formal aspects of computing 13 (2002), 274-307.
18. J. Goguen and W. Tracz, An implementation-oriented semantics for module composition, Foundations of Component-Based Systems, Cambridge, 2000, pp. 231-263.
19. R. Kubiak, A. Borzyszkowski, and S. Sokolowski, A set-theoretic model for a typed polymorphic lambda calculus - a contribution to MetaSoft, VDM: The Way Ahead, LNCS, vol. 328, Springer, 1988, pp. 267-298.
20. A. Kurz, Logics for coalgebras and applications to computer science, Ph.D. thesis, Universität München, 2000.
21. J. Meseguer, General logics, Logic Colloquium 87, North Holland, 1989, pp. 275-329.
22. I. Moerdijk and E. Palmgren, Wellfounded trees in categories, Ann. Pure Appl. Logic 104 (2000), 189-218.
23. p-calculus, Category Theory and Computer Programming, LNCS, vol. 240, Springer, 1986, pp. 242-251.
24. T. Mossakowski, Representations, hierarchies and graphs of institutions, Ph.D. thesis, Universität Bremen, 1996, also: Logos-Verlag, 2001.
25. _, Foundations of heterogeneous specification, Recent Trends in Algebraic Development Techniques (WADT 02), LNCS, vol. 2755, Springer, 2003, pp. 359-375.
26. _, HETCASL - heterogeneous specification. Language summary, 2004, http://www.tzi.de/cofi/hetcasl.
27. P. D. Mosses (ed.), CASL reference manual, LNCS, vol. 2960, Springer, 2004.
28. M. Nielsen and U. Pletat, Polymorphism in an institutional framework, Tech. report, Technical University of Denmark, 1986.
29. T. Nipkow, L. C. Paulson, and M. Wenzel, Isabelle/HOL - a proof assistant for higher-order logic, LNCS, vol. 2283, Springer, 2002.
30. P. Pepper, Transforming algebraic specifications - lessons learnt from an example, Constructing Programs from Specifications, Elsevier, 1991, pp. 1-27.
31. S. Peyton-Jones (ed.), Haskell 98 language and libraries - the revised report, Cambridge, 2003, also: J. Funct. Programming 13 (2003).
32. A. Salibra and G. Scollo, A soft stairway to institutions, Recent Trends in Data Type Specification (WADT 91), LNCS, vol. 655, Springer, 1993, pp. 310-329.
33. D. Sannella and A. Tarlecki, Specifications in an arbitrary institution, Information and Computation 76 (1988), 165-210.
34. L. Schröder, The HAsCASL prologue: categorical syntax and semantics of the partial λ-calculus, available as http://www.informatik.uni-bremen.de/~lschrode/hascasl/plam.ps
35. L. Schröder and T. Mossakowski, HASCASL: Towards integrated specification and development of functional programs, Algebraic Methodology And Software Technology, LNCS, vol. 2422, Springer, 2002, pp. 99-116.
36. L. Schröder, T. Mossakowski, and C. Maeder, HASCASL - Integrated functional specification and programming. Language summary, available under http://www.informatik.uni-bremen.de/agbkb/forschung/formal_methods/CoFI/HasCASL
37. A. Tarlecki, Quasi-varieties in abstract algebraic institutions, J. Comput. System Sci. 33 (1986), 333-360.
38. M. Wenzel, Type classes and overloading in higher-order logic, Theorem Proving in Higher Order Logics, LNCS, vol. 1275, Springer, 1997, pp. 307-322.