Using proofs by coinduction to find "traditional" proofs

Lecture Notes in Computer Science

Volumn 3629, Issue , 2005, Pages 175-193

  Grabmayer, Clemens ^a  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC;

CONDUCTIVE ARGUMENTATION; PROOF SYSTEMS; PROOF-THEORETIC METHODS; REASONING;

THEOREM PROVING;

EID: 26944480363     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11548133_12     Document Type: Conference Paper

References (8)

1. Brandt, M., Henglein, F.: "Coinductive axiomatization of recursive type equality arid subtyping", Fundamenta Informaticae 33 (1998) 1-30.
2. Brzozowski, J.A.: "Derivatives of regular expressions", Journal of the ACM 11 (1964) 481-494.
3. Conway, J.H.: Regular Algebra and Finite Machines, Chapman and Hall (1971).
4. Hiittel, H., Stirling, C.: "Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes", Journ. of Logic and Computation 8:4 (1998) 485-509.
5. Grabmayer, C.: Relating Proof Systems for Recursive Types, PhD thesis, Vrije Universiteit Amsterdam (2005) http://www.cs.vu.al/~clemens/proefschrift. pdf.
6. Rutten, J.J.M.M.: "Automata and Coinduction (an Exercise in Coinduction)", Proceedings of CONCUR '98, LNCS 1466, Springer (1998) 194-218.
7. Salomaa, A.: "Two complete axiom systems for the algebra of regular events", Journal of the ACM 13:1 (1966) 158-169.
8. Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory, Cambridge University Press (1996, 2000).