Bootstrapping types and cotypes in HASCASL

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

Volumn 4624 LNCS, Issue , 2007, Pages 447-461

  Schröder, Lutz ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY; POLYNOMIALS; TREES (MATHEMATICS);

CATEGORICAL TERMINOLOGY; TOPOS THEORY;

DATA STRUCTURES;

EID: 38049014504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73859-6_30     Document Type: Conference Paper

References (25)

1. Adámek, J., Herrlich, H., Strecker, G.E.: Abstract and Concrete Categories. Wiley Interscience, Chichester (1990)
2. Berghofer, S., Wenzel, M.: Inductive datatypes in HOL - lessons learned in formallogic engineering. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) TPHOLs 1999. LNCS, vol. 1690, pp. 19-36. Springer, Heidelberg (1999)
3. Bidoit, M., Mosses, P.D. (eds.): CASL User Manual. LNCS, vol. 2900. Springer, Heidelberg (2004)
4. Birkedal, L., Møgelberg, R.E.: Categorical models for Abadi and Plotkin's logic for parametricity. Math. Struct. Comput. Sci. 15 (2005)
5. Gunter, E.L.: A broader class of trees for recursive type definitions for HOL. In: Joyce, J.J., Seger, C.-J.H. (eds.) HUG 1993. LNCS, vol. 780, pp. 141-154. Springer, Heidelberg (1994)
6. Kiselyov, O., Lämmel, R., Schupke, K.: Strongly typed heterogeneous collections. In: Nilsson, H. (ed.) Haskell Workshop, pp. 96-107. ACM Press, New York (2004)
7. Lambek, J., Scott, P.J.: Introduction to Higher-Order Categorical Logic. Cambridge (1986)
8. Moerdijk, I., Palmgren, E.: Wellfounded trees in categories. Ann. Pure Appl. Logic 104, 189-218 (2000)
9. p- calculus. In: Poigné, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol. 240, pp. 242-251. Springer, Heidelberg (1986)
10. Mossakowski, T., Maeder, C., Lüttich, K.: The Heterogeneous Tool Set. In: Grumberg, O., Huth, M. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. LNCS, vol. 4424, pp. 519-522. Springer, Heidelberg (2007)
11. Mossakowski, T., Schröder, L., Roggenbach, M., Reichel, H.: Algebraic-co-algebraic specification in CoCASL. J. Logic Algebraic Programming 67, 146-197 (2006)
12. Mosses, P.D. (ed.): CASL Reference Manual. LNCS, vol. 2960. Springer, Heidelberg (2004)
13. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL - A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002)
14. Paulson, L.C.: Mechanizing coinduction and corecursion in higher-order logic. J. Log. Comput. 7, 175-204 (1997)
15. Phoa, W.: An introduction to fibrations, topos theory, the effective topos and modest sets. Research report ECS-LFCS-92-208, Lab. for Foundations of Computer Science, University of Edinburgh (1992)
16. Rosolini, G., Streicher, T.: Comparing models of higher type computation. In: Realizability Semantics and Applications. In: Birkdedal, L., van Oosten, J., Rosolini, G., Scott, D.S. (eds.) ENTCS, vol. 23 (1999)
17. Schröder, L.: The logic of the partial λ-calculus with equality. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 385-399. Springer, Heidelberg (2004)
18. Schröder, L.: The HasCASL prologue - categorical syntax and semantics of the partial A-calculus. Theoret. Comput. Sci. 353, 1-25 (2006)
19. Schröder, L., Mossakowski, T.: HasCASL: Towards integrated specification and development of functional programs. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol. 2422, pp. 99-116. Springer, Heidelberg (2002)
20. Schröder, L., Mossakowski, T.: Monad-independent Hoare logic in HasCASL. In: Pezzè, M. (ed.) FASE 2003. LNCS, vol. 2621, pp. 261-277. Springer, Heidelberg (2003)
21. Schröder, L., Mossakowski, T.: Generic exception handling and the Java monad. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 443-459. Springer, Heidelberg (2004)
22. Schröder, L., Mossakowski, T.: Monad-independent dynamic logic in HasCASL. J. Logic Comput. 14, 571-619 (2004)
23. Schröder, L., Mossakowski, T., Lüth, C.: Type class polymorphism in an institutional framework. In: Fiadeiro, J.L., Mosses, P.D., Orejas, F. (eds.) WADT 2004. LNCS, vol. 3423, pp. 234-248. Springer, Heidelberg (2005)
24. Schröder, L., Mossakowski, T., Maeder, C.: HasCASL - Integrated functional specification and programming. Language summary. Available under http://www.informatik.uni-bremen.de/agbkb/forschung/formal_methods/CoFI/HasCASL
25. Walter, D., Schröder, L., Mossakowski, T.: Parametrized exceptions. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 424-438. Springer, Heidelberg (2005)