Recursive function definition over coinductive types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1690, Issue , 1999, Pages 73-90

  Matthews, John ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; THEOREM PROVING;

COINDUCTIVE TYPES; ISABELLE; RECURSIONS; THEOREM PROVERS;

RECURSIVE FUNCTIONS;

EID: 84957798227     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48256-3_6     Document Type: Conference Paper

References (15)

1. Buskes, G., and van Rooij, A. Topological Spaces: from distance to neighbor-hood. UTM Series. Springer, New York, 1997.
2. Devillers, M., Griffioen, D., and Müller, O. Possibly infinite sequences in theorem provers: A comparative study. In Theorem Proving in Higher Order Logics: 10th International Conference, TPHOLs '97 (Murray Hill, NJ, Aug. 1997), vol. 1275 of LNCS, Springer-Verlag, pp. 89-104.
3. Gordon, M. J. C., and Melham, T. F. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
4. Gunter, C. A. Semantics of Programming Languages: Structures and Tech-niques. Foundations of Computing Science. The MIT Press, 1992.
5. Matthews, J., and Launchbury, J. Elementary microarchitecture algebra. To appear in CAV99, International Conference on Computer Aided Verification, July 1999.
6. Matthews, J., Launchbury, J., and Cook, B. Specifying microprocessors in Hawk. In IEEE International Conference on Computer Languages (Chicago, Illinois, May 1998), pp. 90-101.
7. Miner, P. Hardware Verification Using Coinductive Assertions. PhD thesis, Indiana University, 1998.
8. Müller, O., Nipkow, T. v., Oheimb, D., and Slotosch, O. HOLCF = HOL + LCF. To appear in Journal of Functional Programming, 1999.
9. Paulson, L. Isabelle: A Generic Theorem Prover. Springer-Verlag, 1994.
10. Paulson, L. C. Mechanizing coinduction and corecursion in higher-order logic. Journal of Logic and Computation 7, 2 (Apr. 1997), 175-204.
11. Rudin, W. Principles of Mathematical Analysis, 3 ed. McGraw-Hill, 1976.
12. Rushby, J., and Stringer-Calvert, D. W. J. A less elementary tutorial for the PVS specification and verification system. Tech. Rep. SRI-CSL-95-10, SRI International, Menlo Park, CA, June 1995. Revised, July 1996.
13. Slind, K. Function definition in higher order logic. In Ninth international Con-ference on Theorem Proving in Higher Order Logics TPHOL (Turku, Finland, Aug. 1996), J. Von Wright, J. Grundy, and J. Harrison, Eds., vol. 1125 of Lecture Notes in Computer Science, Springer Verlag, pp. 381-398.
14. Slind, K. Derivation and use of induction schemes in higher-order logic. Lecture Notes in Computer Science 1275 (1997), 275-290.
15. Tennent, R. D. Semantics of Programming Languages. Prentice Hall, New York, 1991.