# PX, a computational logic

Format
Post in Computer
BY **Hiroshi Nakano, Susumu Hayashi**

0262081741 Shared By Guest

**PX, a computational logic** Hiroshi Nakano, Susumu Hayashi is available to download <table><tr><td colspan="2"><strong style="font-size:1.This material is available do download at niSearch.com on **Hiroshi Nakano, Susumu Hayashi**'s eBooks, 2em;">PX, a computational logic</strong><br/>Hiroshi Nakano, Susumu Hayashi</td></tr> <tr> <td><b>Type:</b></td> <td>eBook</td> </tr> <tr> <td><b>Released:</b></td> <td>1988</td> </tr> <tr> <td><b>Publisher:</b></td> <td>The MIT Press</td> </tr> <tr> <td><b>Page Count:</b></td> <td>205</td> </tr> <tr> <td><b>Format:</b></td> <td>pdf</td> </tr> <tr> <td><b>Language:</b></td> <td>English</td> </tr> <tr> <td><b>ISBN-10:</b></td> <td>0262081741</td> </tr> <tr> <td><b>ISBN-13:</b></td> <td>9780262081740</td> </tr> </table>
The computational logic PX (Program eXtractor) is used to verify programs, extract programs from constructive proofs, and give foundations to type theories.*PX, a computational logic* Textbook 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.

## Comments (0)