HasCasl: Integrated higher-order specification and program development

Theoretical Computer Science

Volumn 410, Issue 12-13, 2009, Pages 1217-1260

  Schröder, Lutz ^a   Mossakowski, Till ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

Algebraic specification; Casl; Functional programming; Higher order logic; Hoare logic; Monads; Polymorphism; Type classes

Indexed keywords

COMPUTER PROGRAMMING; LINGUISTICS; POLYMORPHISM; PROGRAMMING THEORY; QUERY LANGUAGES; SPECIFICATION LANGUAGES; SPECIFICATIONS; STANDARDIZATION;

ALGEBRAIC SPECIFICATION; CASL; HIGHER-ORDER LOGIC; HOARE LOGIC; MONADS; TYPE CLASSES;

FUNCTIONAL PROGRAMMING;

EID: 59749106377     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.11.020     Document Type: Article

References (82)

1. Abel A., and Mattes R. Fixed points of type constructors and primitive recursion. In: Marcinkowski J., and Tarlecki A. (Eds). Computer Science Logic. CSL 2004. Lect. Notes Comput. Sci. vol. 3210 (2004), Springer 190-204
2. Adámek J., Herrlich H., and Strecker G.E. Abstract and Concrete Categories (1990), Wiley Interscience
3. Astesiano E., and Cerioli M. Free objects and equational deduction for partial conditional specifications. Theoret. Comput. Sci. 152 (1995) 91-138
4. Bates J., and Constable R. Proofs as programs. ACM Trans. Prog. Lang. Systems 7 (1985) 113-136
5. Berghofer S., and Wenzel M. Inductive datatypes in HOL - lessons learned in formal-logic engineering. In: Bertot Y., Dowek G., Hirschowitz A., Paulin C., and Théry L. (Eds). Theorem Proving in Higher Order Logics. TPHOLs 1999. Lect. Notes Comput. Sci. vol. 1690 (1999), Springer 19-36
6. Bidoit M., and Mosses P.D. Casl User Manual. Lect. Notes Comput. Sci. vol. 2900 (2004), Springer
7. Birkedal L., and Møgelberg R.E. Categorical models for Abadi and Plotkin's logic for parametricity. Math. Struct. Comput. Sci. 15 (2005)
8. M. Broy, C. Facchi, R. Grosu, R. Hettler, H. Hussmann, D. Nazareth, F. Regensburger, K. Stølen, The requirement and design specification language Spectrum, an informal introduction, version 1.0, Technical Report, Institut für Informatik, Technische Universität München, Mar. 1993
9. G.M. Cabral, Developing a HasCasl library for the Haskell prelude, Master's Thesis, Institute of Computing, University of Campinas (in preparation)
10. ω, Unpublished notes, 1990
11. Cerioli M., and Meseguer J. May I borrow your logic? (transporting logical structures along maps). Theoret. Comput. Sci. 173 (1997) 311-347
12. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., and Talcott C. All About Maude - A High-Performance Logical Framework. How to Specify, Program, and Verify Systems in Rewriting Logic. Lect. Notes Comput. Sci. vol. 4350 (2007), Springer
13. CoFI, The Common Framework Initiative for algebraic specification and development. Electronic Archives under: www.cofi.info
14. Coquand T. An analysis of Girard's paradox. Logic in Computer Science. LICS 1986 (1986), IEEE 227-236
15. The Coq Development Team, The Coq Proof Assistant - Reference Manual, v8.1. INRIA, 2006, Available under: http://coq.inria.fr
16. Diaconescu R., and Futatsugi K. Cafeobj Report. AMAST Series (1998), World Scientific, Singapore
17. Dijkstra E.W. A Discipline of Programming (1976), Prentice Hall
18. Filliâtre J.-C. Proof of imperative programs in type theory. In: Altenkirch T., Naraschewski W., and Reus B. (Eds). Types for Proofs and Programs. TYPES 1998. Lect. Notes Comput. Sci. vol. 1657 (1999), Springer 78-92
19. Führmann C. Varieties of effects. In: Nielsen M., and Engberg U. (Eds). Foundations of Software Science and Computation Structures. FOSSACS 2002. Lect. Notes Comput. Sci. vol. 2303 (2002), Springer 144-158
20. Gabbay M.J., and Pitts A.M. A new approach to abstract syntax with variable binding. Formal Asp. Comput. 13 (2002) 341-363
21. George C., Haff P., Havelund K., Haxthausen A.E., Milne R., Nielson C.B., Prehn S., and Wagner K.R. The Raise Specification Language (1992), Prentice Hall, New York
22. Goguen J.A., and Rosu G. Institution morphisms. Formal Asp. Comput. 13 (2002) 274-307
23. Goguen J., and Burstall R. Institutions: Abstract model theory for specification and programming. J. ACM 39 (1992) 95-146
24. Goncharov S., Schröder L., and Mossakowski T. Completeness of global evaluation logic. In: Kralovic R., and Urzyczyn P. (Eds). Mathematical Foundations of Computer Science. MFCS 2006. Lect. Notes Comput. Sci. vol. 4162 (2006), Springer 447-458
25. Guttag J.V., Horning J.J., Garland S.J., Jones K.D., Modet A., and Wing J.M. Larch: Languages and Tools for Formal Specification (1993), Springer
26. Hallgren T. Haskell tools from the programatica project. In: Jeuring J. (Ed). Haskell Workshop. HASKELL 2003 (2003), ACM Press 103-106
27. Harrison W.L., and Kieburtz R.B. The logic of demand in Haskell. J. Funct. Program. 15 (2005) 837-891
28. Haxthausen A. Order-sorted algebraic specifications with higher-order functions. Theoret. Comput. Sci. 183 (1997) 157-185
29. Henkin L. The completeness of the first-order functional calculus. J. Symbolic Logic 14 (1949) 159-166
30. Herrlich H., Lowen-Colebunders E., and Schwarz F. Improving Top: PrTop and PsTop. In: Herrlich H., and Porst H.-E. (Eds). Category Theory at Work (1991), Heldermann, Berlin 21-34
31. Hutter D., Mantel H., Rock G., Stephan W., Wolpers A., Balser M., Reif W., Schellhorn G., and Stenzel K. VSE: Controlling the complexity in formal software developments. In: Hutter D., Stephan W., Traverso P., and Ullmann M. (Eds). Current Trends in Applied Formal Methods, FM-Trends 1998. Lect. Notes Comput. Sci. vol. 1641 (1999), Springer
32. Jones C.B. Systematic Software Development Using VDM (1990), Prentice Hall
33. Kahrs S., Sannella D., and Tarlecki A. The definition of extended ML: A gentle introduction. Theoret. Comput. Sci. 173 (1997) 445-484
34. Kahrs S., and Sannella D. Reflections on the design of a specification language. In: Nivat M. (Ed). Fundamental Approaches to Software Engineering. FOSSACS 1998. Lect. Notes Comput. Sci. vol. 1382 (1998), Springer 154-170
35. R.B. Kieburtz, P-logic: Property verification for Haskell programs, Unpublished manuscript, 2002
36. Lambek J., and Scott P.J. Introduction to Higher Order Categorical Logic (1986), Cambridge University Press
37. Läufer K. Type classes with existential types. J. Funct. Program. 6 (1996) 485-517
38. Liang S., Hudak P., and Jones M. Monad transformers and modular interpreters. Principles of Programming Languages. POPL 95 (1995), ACM Press 333-343
39. Mac Lane S. Categories for the Working Mathematician (1997), Springer
40. Martin-Löf P. Constructive mathematics and computer programming. Logic, Methodology, and Philosophy of Science. LMPS 1979 (1982), North-Holland 153-175
41. Meseguer J. General logics. Logic Colloquium. LC 1987 (1989), North Holland 275-329
42. Mints G. A Short Introduction to Intuitionistic Logic (2000), Kluwer
43. Mitchell J.C., and Scott P.J. Typed lambda models and cartesian closed categories. In: Gray J., and Scedrov A. (Eds). Categories in Computer Science and Logic. Contemp. Math. vol. 92 (1989), Amer. Math. Soc. 301-316
44. p-calculus. In: Pitt D.H., Abramsky S., Poigné A., and Rydeheard D.E. (Eds). Category Theory and Computer Programming. Lect. Notes Comput. Sci. vol. 240 (1986), Springer 242-251
45. E. Moggi, The partial lambda calculus, Ph.D. Thesis, University of Edinburgh, 1988
46. Moggi E. Notions of computation and monads. Inform. Comput. 93 (1991) 55-92
47. Moggi E. A semantics for evaluation logic. Fund. Inform. 22 (1995) 117-152
48. Mossakowski T., Maeder C., and Lüttich K. The heterogeneous tool set. In: Grumberg O., and Huth M. (Eds). Tools and Algorithms for the Construction and Analysis of Systems. TACAS 07. Lect. Notes Comput. Sci. vol. 4424 (2007), Springer 519-522
49. Mossakowski T., Sannella D., and Tarlecki A. A simple refinement language for CASL. In: Fiadeiro J.L. (Ed). Recent Developments in Algebraic Development Techniques, 17th International Workshop. WADT 2004. Lect. Notes Comput. Sci. vol. 3423 (2005), Springer 162-185
50. Mossakowski T., Schröder L., and Goncharov S. A generic complete dynamic logic for reasoning about purity and effects. In: Fiadeiro J., and Inverardi P. (Eds). Fundamental Approaches to Software Engineering. FASE 2008. Lect. Notes Comput. Sci. vol. 4961 (2008), Springer 199-214
51. Mossakowski T. Relating Casl with other specification languages: The institution level. Theoret. Comput. Sci. 286 (2002) 367-475
52. T. Mossakowski, Heterogeneous specification and the heterogeneous tool set, Habilitation Thesis, Universität Bremen, 2005
53. In: Mosses P.D. (Ed). Casl Reference Manual. Lect. Notes Comput. Sci. vol. 2960 (2004), Springer
54. Nipkow T., Paulson L.C., and Wenzel M. Isabelle/HOL-A Proof Assistant for Higher-order Logic. Lect. Notes Comput. Sci. vol. 2283 (2002), Springer
55. Nordlander J. Polymorphic subtyping in O'Haskell. Sci. Comput. Program. 43 2-3 (2002) 93-127
56. Owre S., Shankar N., Rushby J.M., and Stringer-Calvert D.W.J. PVS Language Reference, Version 2.4 (2001), SRI International, Menlo Park
57. Paulson L.C. Mechanizing coinduction and corecursion in higher-order logic. J. Log. Comput 7 (1997) 175-204
58. Peyton Jones S., Vytiniotis D., Weirich S., and Shields M. Practical type inference for arbitrary-rank types. J. Funct. Program. 17 (2007) 1-82
59. S. Peyton Jones (Ed.), Haskell 98 language and libraries - the revised report, Cambridge, 2003. Also: J. Funct. Program. 13 (2003)
60. W. Phoa, 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
61. Pierce B. Types and Programming Languages (2002), MIT Press
62. Pitts A.M. Polymorphism is set-theoretic, constructively. Category Theory and Computer Science. Lect. Notes Comput. Sci. vol. 283 (1987), Springer 12-39
63. Pitts A. Evaluation logic. In: Birtwhistle G. (Ed). Higher Order Workshop IV. Workshops in Computing (1991), Springer 162-189
64. Regensburger F. HOLCF: Higher order logic of computable functions. In: Schubert E.T., Windley P.J., and Alves-Foss J. (Eds). Theorem Proving in Higher Order Logics. TPHOLS 1995. Lect. Notes Comput. Sci. vol. 971 (1995) 293-307
65. Rosolini G., and Streicher T. Comparing models of higher type computation. Realizability Semantics and Applications. Electron. Notes Theoret. Comput. Sci. vol. 23 (1999)
66. G. Rosolini, Continuity and effectiveness in topoi, Ph.D. Thesis, University of Oxford, 1986
67. Sannella D., and Tarlecki A. Toward formal development of programs from algebraic specifications: Implementations revisited. Acta Inf. 25 (1988) 233-281
68. Sannella D., and Tarlecki A. Algebraic methods for specification and formal development of programs. ACM Comput. Surveys 31 (1999)
69. D. Sannella, A. Tarlecki, Foundations of algebraic specifications and formal program development (in preparation). Preliminary version available under http://homepages.inf.ed.ac.uk/dts/book
70. Schröder L., Mossakowski T., and Lüth C. Type class polymorphism in an institutional framework. In: Fiadeiro J. (Ed). Recent Developments in Algebraic Development Techniques, 17th International Workshop. WADT 04. Lect. Notes Comput. Sci. vol. 3423 (2004), Springer 234-248
71. Schröder L., Mossakowski T., Tarlecki A., Hoffman P., and Klin B. Semantics of architectural specifications in Casl. In: Hußmann H. (Ed). Fundamental Approaches to Software Engineering. FASE 2001. Lect. Notes Comput. Sci. vol. 2029 (2001), Springer 253-268
72. Schröder L., and Mossakowski T. HasCasl: Towards integrated specification and development of Haskell programs. In: Kirchner H., and Ringeissen C. (Eds). Algebraic Methodology and Software Technology. AMAST 2002. Lect. Notes Comput. Sci. vol. 2422 (2002), Springer 99-116
73. Schröder L., and Mossakowski T. Monad-independent Hoare logic in HasCasl. In: Pezzè M. (Ed). Fundamental Approaches to Software Engineering. FASE 2003. Lect. Notes Comput. Sci. vol. 2621 (2003), Springer 261-277
74. Schröder L., and Mossakowski T. Monad-independent dynamic logic in HasCasl. J. Logic Comput. 14 (2004) 571-619
75. Schröder L. The logic of the partial λ-calculus with equality. In: Marcinkowski J., and Tarlecki A. (Eds). Computer Science Logic. CSL 2004. Lect. Notes Comput. Sci. vol. 3210 (2004), Springer 385-399
76. Schröder L. The HasCasl prologue-categorical syntax and semantics of the partial λ-calculus. Theoret. Comput. Sci. 353 (2006) 1-25
77. Schröder L. Bootstrapping types and cotypes in HasCasl. In: Mossakowski T., and Montanari U. (Eds). Algebra and Coalgebra in Computer Science. CALCO 2007. Lect. Notes Comput. Sci. vol. 4624 (2007), Springer 447-462 Full version to appear in Log. Methods Comput. Sci.
78. Spivey M. The Z Notation: A Reference Manual. 2nd ed. (1992), Prentice Hall
79. H. Thielecke, Categorical structure of continuation passing style, Ph.D. Thesis, University of Edinburgh, 1997
80. Wadler P. How to declare an imperative. ACM Comput. Surveys 29 (1997) 240-263
81. Wölfl S., Mossakowski T., and Schröder L. Qualitative constraint calculi: Heterogeneous verification of composition tables. In: Wilson D.C., and Sutcliffe G.C.J. (Eds). 20th International FLAIRS Conference (2007), AAAI Press 665-670
82. Wyler O. Lecture Notes on Topoi and Quasitopoi (1991), World Scientific