Defining functions on equivalence classes

ACM Transactions on Computational Logic

Volumn 7, Issue 4, 2006, Pages 658-675

  Paulson, Lawrence C ^a,b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b William Gates Building   (United Kingdom)

Author keywords

Equivalence classes; Quotients; Theorem proving

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; DATABASE SYSTEMS; NUMBER THEORY; THEOREM PROVING;

EQUATIONAL CONSTRAINTS; LEMMA LIBRARY; NATURAL NUMBERS; QUOTIENT CONSTRUCTION;

EQUIVALENCE CLASSES;

EID: 33750145458     PISSN: 15293785     EISSN: 15293785     Source Type: Journal    
DOI: 10.1145/1183278.1183280     Document Type: Article

References (11)

1. CROW, J., OWRE, S., RUSHBY, J., SHANKAR, N., AND SRIVAS, M. 1995. A tutorial introduction to PVS. Tech. Rep., Computer Science Laboratory, SRI International.
2. DE BHUIJN, N. G. 1972. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem. Ind. Math. 34, 381-892.
3. GEUVERS, H., POLLACK, R., WIEDIJK, F., AND ZWANENBURG, J. 2002. A constructive algebraic hierarchy in Coq. J. Symb. Comput. 34, 4, 271-286.
4. GORDON, M. J. C. AND MELHAM, T. F. 1998. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, Cambridge, MA.
5. HARRISON, J. 1994. Constructing the real numbers in HOL. Form. Meth. Syst. Des. 5, 35-59.
6. HOMEIER, P. V. 2001. Quotient types. In TPHOLs 2001: Supplemental Proceedings, R. J. Boulton and P. B. Jackson, Eds. Number EDI-INF-RR-0046 in Informatics Report Series. Division of Informatics, University of Edinburgh, 191-206. Online at http://www.informatics.ed.ac.uk/publications/report/0046. html.
7. KAUFMANN, M. AND MOORE, J. S. 2002. ACL2 Version 2.7. University of Texas at Austin, Austin, TX. (On the Internet at http://www.cs.utexas.edu/users/ moore/acl2/v2-7/.)
8. KOLMAN, B., BUSBY, R. C., AND Ross, S. C. 2000. Discrete Mathematical Structures, 4th ed. Prentice-Hall, Englewood Cliffs, NJ.
9. NIPKOW, T., PAULSON, L. C., AND WENZEL, M. 2002. Isabelle I HOL: A Proof Assistant for Higher-Order Logic. Lecture Notes in Computer Science, tutorial 2283. Springer-Verlag, New York.
10. SLOTOSCH, O. 1997. Higher order quotients and their implementation in Isabelle HOL. In Theorem Proving in Higher Order Logics: TPHOLs '97, E. L. Gunter and A. Felty, Eds. Lecture Notes in Computer Science, vol. 1275. Springer-Verlag, New York, 291-306.
11. TEWS, H. 2004. Predicate and relation lifting for parametric algebraic specifications. In CMCS 2004, 7th Workshop on Coalgebraic Methods in Computer Science, J. Adámek, Ed. Electronic Notes in Theoretical Computer Science. 361-378.