J. S. Moore. A mechanical proof of the termination of Takeuchi's function. Information Processing Letters, 9:176-181, 1979. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Proving Program Termination in Higher Order Logic - Krstic, Matthews (2002) (Correct)
Knuth's Generalization of Takeuchi's Tarai Function.. - Bailey, Cowles (2000) (Correct)
On Automatically Generating and Using Examples in a Computational.. - Kim (Correct)
Checking Termination of Queries to Logic Programs - Lindenstrauss, Sagiv (1996) (Correct)
Inductive Invariants for Nested Recursion - Krstic, Matthews (2003) (Correct)
Proving Program Termination in Higher Order Logic - Krstic, Matthew (2002) (Correct)
Proving Termination of Normalization Functions for - Conditional Expressions.. Self-citation (Moore) (Correct)
Proof Checking the RSA Public Key Encryption Algorithm - Boyer, Moore (1984) (10 citations) Self-citation (Moore) (Correct)
Integrating Decision Procedures into Heuristic Theorem.. - Boyer, Moore (1985) (95 citations) Self-citation (Moore) (Correct)
Proof Checking the RSA Public Key Encryption Algorithm - Boyer, Moore (1984) (10 citations) Self-citation (Moore) (Correct)
The Boyer-Moore Theorem Prover and Its Interactive Enhancement - Boyer, Kaufmann, Moore (1995) (19 citations) Self-citation (Moore) (Correct)
Program Verification - Boyer, Moore (1985) Self-citation (Moore) (Correct)
A Theorem Prover for a Computational Logic - Boyer, Moore (1990) (22 citations) Self-citation (Moore) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC