Access Restriction

Author Manna, Zohar ♦ Ness, Stephen ♦ Vuillemin, Jean
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format HTM / HTML
Language English
Subject Keyword Least fixedpoint ♦ Structural induction ♦ Computational induction ♦ Recursive programs
Abstract There are two main purposes in this paper: first, clarification and extension of known results about computation of recursive programs, with emphasis on the difference between the theoretical and practical approaches; second, presentation and examination of various known methods for proving properties of recursive programs. Discussed in detail are two powerful inductive methods, computational induction and structural induction, including examples of their applications.
Description Affiliation: Stanford Univ., Stanford, CA (Manna, Zohar; Ness, Stephen; Vuillemin, Jean)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 16
Issue Number 8
Page Count 12
Starting Page 491
Ending Page 502

Open content in new tab

   Open content in new tab
Source: ACM Digital Library