Free Book Online
P. X.: A Computational Logic (Foundations of Computing Series)


P. X.: A Computational Logic (Foundations of Computing Series)

2.2 (1138)

Log in to rate this item

    Available in PDF Format | P. X.: A Computational Logic (Foundations of Computing Series).pdf | English
    S Hayashi (Author)
The computational logic PX (Program eXtractor) is used to verify programs, extract programs from constructive proofs, and give foundations to type theories. While it is well known theoretically that programs can be extracted from constructive proofs, this study shows how it can be done in practice. The authors give a precise description of the formal theory of PX, its semantics, the mathematical foundation of program extraction using PX, and several methodologies and their theories of program extraction. They also describe an experimental implementation of PX. Contents: Introduction. Formal System. Realizability. Writing Programs via proofs. PX as a foundation of type theories. Semantics. Implementing PX. Susumu Hayashi is a research associate and Hiroshi Nakano a graduate student, both at the Research Institute of Mathematical Sciences at Kyoto University. PX: A Computational Logic is included in the Foundations of Computing series edited by Michael Garey and Albert Meyer.
2.2 (3366)
  • Pdf

*An electronic version of a printed book that can be read on a computer or handheld device designed specifically for this purpose.

Formats for this Ebook

Required Software Any PDF Reader, Apple Preview
Supported Devices Windows PC/PocketPC, Mac OS, Linux OS, Apple iPhone/iPod Touch.
# of Devices Unlimited
Flowing Text / Pages Pages
Printable? Yes

Book details

  • PDF | 216 pages
  • S Hayashi (Author)
  • MIT Press (1 Jan. 1988)
  • English
  • 2
  • Science Nature
Read online or download a free book: P. X.: A Computational Logic (Foundations of Computing Series)

Review Text

The message text:

Other Ebook