Formal verification of monad transformers (abstract)

ACM SIGPLAN Notices

Volumn 47, Issue 9, 2012, Pages 15-16

  Huffman, Brian ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Denotational semantics; Monads; Polymorphism; Theorem proving; Type classes

Indexed keywords

CONSTRUCTOR CLASS; DATA TYPE; DATATYPES; DENOTATIONAL SEMANTICS; DOMAIN THEORY; DOMAIN-THEORETIC MODEL; FORMAL VERIFICATIONS; FUNCTORS; HASKELL; ISABELLE; MONAD TRANSFORMERS; MONADS; THEOREM PROVERS; TYPE CLASS; TYPE SYSTEMS;

COMPUTER PROGRAMMING; COMPUTER SCIENCE; POLYMORPHISM;

THEOREM PROVING;

EID: 84870462105     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2398856.2364532     Document Type: Conference Paper

References (10)

1. Roberto M. Amadio and Pierre-Louis Curien. Domains and Lambda- Calculi. Cambridge University Press, New York, NY, USA, 1998.
2. Brian Huffman. A purely definitional universal domain. In Stefan Berghofer, Tobias Nipkow, Christian Urban, and Makarius Wenzel, editors, Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (TPHOLs '09), volume 5674 of LNCS, pages 260-275. Springer, 2009.
3. Brian Huffman. HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs. Ph.D. thesis, Portland State University, 2012.
4. Brian Huffman. Type constructor classes and monad transformers. Archive of Formal Proofs, June 2012. http://afp.sf.net/entries/Tycon.shtml, Formal proof development.
5. Brian Huffman, John Matthews, and Peter White. Axiomatic constructor classes in Isabelle/HOLCF. In Joe Hurd and Tom Melham, editors, Proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics (TPHOLs '05), volume 3603 of LNCS, pages 147-162. Springer, 2005.
6. Mark P. Jones. Functional programming with overloading and higherorder polymorphism. In First International Spring School on Advanced Functional Programming Techniques, volume 925 of LNCS, Båstad, Sweden, May 1995. Springer-Verlag.
7. Olaf Müller, Tobias Nipkow, David von Oheimb, and Oskar Slotosch. HOLCF = HOL + LCF. Journal of Functional Programming, 9:191-223, 1999.
8. Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002.
9. Matthieu Sozeau and Nicolas Oury. First-class type classes. In Otmane Ait Mohamed, César Muñoz, and Sofìene Tahar, editors, Theorem Proving in Higher Order Logics, 21st International Conference (TPHOLs '08), volume 5170 of LNCS, pages 278-293. Springer, August 2008.
10. Philip Wadler. Theorems for free! In Functional Programming Languages and Computer Architecture, pages 347-359. ACM Press, 1989.