Proof pearl: Defining functions over finite sets

Lecture Notes in Computer Science

Volumn 3603, Issue , 2005, Pages 385-396

  Nipkow, Tobias ^a   Paulson, Lawrence C ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; SET THEORY;

ISABELLE/HOL; STRUCTURAL RECURSION; SUMMATION;

THEOREM PROVING;

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

References (13)

1. C. Ballarin. Locales and locale expressions in Isabelle/Isar. In S. Berardi, M. Coppo, and F. Damiani, editors, International Workshop TYPES 2003, LNCS 3085, pages 34-50. Springer, 2004.
2. V. Breazu-Tannen and R. Subrahmanyam. Logical and computational aspects of programming with sets/bags/lists. In J. L. Albert, B. Monien, and M. Rodríguez-Artalejo, editors, Automata, Languages and Programming (ICALP91), volume 510 of LNCS, pages 60-75. Springer, 1991.
3. C.-T. Chou. Generalizing an associative and commutative operation with identity to finite sets, ftp://ftp.cl.cam.ac.uk/hvg/hol88/contrib/aci/, 1992. HOL88 formal development.
4. B. Davey and H. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
5. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2001.
6. J. Gibbons, G. Hutton, and T. Altenkirch. When is a Function a Fold or an Unfold? In Proc. 4th International Workshop on Coalgebraic Methods in Computer Science, volume 44.1 of Electronic Notes in Theoretical Computer Science, 2001.
7. The HOL4 Theorem Prover. http://hol.sf.net.
8. G. Hutton. A tutorial on the universality and expressiveness of fold. Journal of Functional Programming, 9(4):355-372, July 1999.
9. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic. Springer, 2002. LNCS Tutorial 2283.
10. A. Ohori, P. Buneman, and V. Tannen. Database programming in machiavelli - a polymorphic language with static type inference. In J. Clifford, B. Lindsay, and D. Maier, editors, Proc. 1989 ACM SIGMOD Intl. Conf. Management of Data, pages 46-57. ACM Press, 1989.
11. L. C. Paulson. Defining functions on equivalence classes. ACM Transactions on Computational Logic, in press.
12. L. C. Paulson. Organizing numerical theories using axiomatic type classes. Journal of Automated Reasoning, 2005. in press.
13. PVS Specification and Verification System, http://pvs.csl.sri.com/.