Axiomatic Constructor Classes in Isabelle/HOLCF

We have definitionally extended Isabelle/HOLCF to support axiomatic Haskell-style constructor classes. We have subsequently defined the functor and monad classes, together with their laws, and implemented state and resumption monad transformers as generic constructor class instances. This is a step towards our goal of giving modular denotational semantics for concurrent lazy functional programming languages, such as GHC Haskell.

[1]  Dragan Macos,et al.  A study of evaluation order semantics in expressions with side effects , 2000, J. Funct. Program..

[2]  Lawrence Charles Paulson,et al.  Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .

[3]  Einar Broch Johnsen,et al.  Theorem Reuse by Proof Term Transformation , 2004, TPHOLs.

[4]  William M. Farmer,et al.  IMPS: An Updated System Description , 1996, CADE.

[5]  David von Oheimb.  Information Flow Control Revisited: Noninfluence = Noninterference + Nonleakage , 2004, ESORICS.

[6]  William L. Harrison,et al.  Domain Separation by Construction , 2003 .

[7]  William M. Farmer.  An Infrastructure for Intertheory Reasoning , 2000, CADE.

[8]  Pierre Castéran,et al.  Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.

[9]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[10]  Graham Collins.  A Proof Tool for Reasoning About Functional Programs , 1996, TPHOLs.

[11]  Clemens Ballarin.  Locales and Locale Expressions in Isabelle/Isar , 2003, TYPES.

[12]  Dusko Pavlovic,et al.  Colimits for Concurrent Collectors , 2003, Verification: Theory and Practice.

[13]  Nikolaos Papaspyrou,et al.  A Formal Semantics for the C Programming Language , 2000 .

[14]  Tobias Nipkow,et al.  Order-sorted polymorphism in Isabelle , 1993 .

[15]  Markus Wenzel,et al.  Type Classes and Overloading in Higher-Order Logic , 1997, TPHOLs.

[16]  Franz Regensburger,et al.  HOLCF: Higher Order Logic of Computable Functions , 1995, TPHOLs.

[17]  Florian Kammüller,et al.  Locales - A Sectioning Concept for Isabelle , 1999, TPHOLs.

[18]  Carl A. Gunter,et al.  Semantic Domains , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[19]  Thomas F. Melham.  The HOL logic extended with quantification over type variables , 1993, Formal Methods Syst. Des..

[20]  John Rushby,et al.  Noninterference, Transitivity, and Channel-Control Security Policies 1 , 2005 .

[21]  Xin Yu,et al.  MetaPRL - A Modular Logical Environment , 2003, TPHOLs.

[22]  Roberto M. Amadio,et al.  Domains and lambda-calculi , 1998, Cambridge tracts in theoretical computer science.

[23]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[24]  Tobias Nipkow,et al.  HOLCF = HOL + LCF , 1999, Journal of Functional Programming.

[25]  Owre Sam,et al.  Theory Interpretations in PVS , 2001 .

[26]  Tobias Nipkow,et al.  A Proof Assistant for Higher-Order Logic , 2002 .