Axiomatic constructor classes in Isabelle/HOLCF

Lecture Notes in Computer Science

Volumn 3603, Issue , 2005, Pages 147-162

  Huffman, Brian ^a   Matthews, John ^a   White, Peter ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; SEMANTICS;

CONSTRUCTOR CLASSES; DENOTATIONAL SEMANTICS; HASKELL-STYLE CONSTRUCTORS; MONAD TRANSFORMERS;

THEOREM PROVING;

EID: 26844476419     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11541868_10     Document Type: Conference Paper

References (21)

1. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Clarendon Press, 1994.
2. Roberto M. Amadio and Pierre-Louis Curien. Domains and Lambda Calculi, volume 46 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1998.
3. Clemens Ballarin. Locales and locale expressions in Isabelle/Isar. In Types for Proof and Programs, Intl. Workshop TYPES 2003, volume 3085 of Lecture Notes in Computer Science, pages 34-50. Springer, 2003.
4. Yves Bertot and Pierre Castéran. Interactive theorem proving and program development. Coq'Art: The calculus of inductive constructions. Texts in Theoretical Computer Science, page 492, 2004.
5. W. M. Farmer. An infrastructure for intertheory reasoning. In D. McAllester, editor, Automated Deduction-CADE-17, volume 1831 of Lecture Notes in Computer Science, pages 115-131. Springer-Verlag, 2000.
6. W. M. Farmer, J. D. Guttman, and F. J. Thayer Fábrega. IMPS: An updated system description. In M. McRobbie and J. Slaney, editors, Automated Deduction-CADE-13, volume 1104 of Lecture Notes in Computer Science, pages 298-302. Springer-Verlag, 1996.
7. C. A. Gunter and D. S. Scott. Semantic domains. In Handbook of theoretical computer science (vol. B): formal models and semantics, pages 633-674. MIT Press, 1990.
8. Jason Hickey, Aleksey Nogin, Robert L. Constable, Brian E. Aydemir, Eli Barzilay, Yegor Bryukhov, Richard Eaton, Adam Granicz, Alexei Kopylov, Christoph Kreitz, Vladimir N. Krupski, Lori Lorigo, Stephan Schmitt, Carl Witty, and Xin Yu. MetaPRL - A modular logical environment, pages 287-303.
9. Einar Broch Johnsen and Christoph Lüth. Theorem reuse by proof term transformation. In Konrad Slind, Annette Bunker, and Ganesh Gopalakrishnan, editors, International Conference on Theorem Proving in Higher-Order Logics TPHOLs 2004, volume 3223 of Lecture Notes in Computer Science, pages 152-167. Springer, September 2004.
10. Mark P. Jones. Programatica web page, 2005. http://www.cse.ogi.edu/ PacSoft/projects/programatica.
11. Simon Peyton Jones. Haskell98 Language and Libraries, Revised Report, December 2002.
12. Florian Kammüller, Markus Wenzel, and Lawrence C. Paulson. Locales - A sectioning concept for Isabelle. In Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Thery, editors, 12th International Conference on Theorem Proving in Higher-Order Logics TPHOLs'99, volume 1690 of Lecture Notes in Computer Science. Springer, September 1999.
13. Thomas F. Melham. The HOL logic extended with quantification over type variables. In HOL'92: Proceedings of the IFIP TC10/WG10.2 Workshop on Higher Order Logic Theorem Proving and its Applications, pages 3-17. North-Holland/Elsevier, 1993.
14. Olaf Müller, Tobias Nipkow, David Von Oheimb, and Oscar Slotosch. HOLCF = HOL + LCF. Journal of Functional Programming, 9(2):191-223, 1999.
15. Tobias Nipkow. Order-sorted polymorphism in Isabelle. In Gérard Huet and Gordon Plotkin, editors, Logical Environments, pages 164-188. Cambridge University Press, 1993.
16. Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel. Isabelle/HOL, A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002.
17. S. Owre and N. Shankar. Theory interpretations in PVS. Technical Report SRI-CSL-01-01, Computer Science Laboratory, SRI International, Menlo Park, CA, April 2001.
18. N.S. Papaspyrou. A formal semantics for the C programming language. PhD thesis, National Technical University of Athens, Department of Electrical and Computer Engineering, Software Engineering Laboratory, February 1998.
19. N.S. Papaspyrou and D. Macos. A study of evaluation order semantics in expressions with side effects. Journal of Functional Programming, 10(3):227-244, May 2000.
20. Franz Regensburger. HOLCF: Higher order logic of computable functions. In Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications, pages 293-307. Springer-Verlag, 1995.
21. Markus Wenzel. Type classes and overloading in higher-order logic. In TPHOLs'97: Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics, pages 307-322. Springer-Verlag, 1997.