|
||||
|
Vollständiges Skriptum (350 Seiten) | |||||
Kapitel 1: Einführung
|
PS | PS (2:1) | |||
Kapitel 2: Formalisierung von Logik, Berechenbarkeit und Typdisziplin
|
PS | PS (2:1) | |||
Kapitel 3: Die Intuitionistische Typentheorie
|
PS | PS (2:1) | |||
Kapitel 4: Automatisierung des formalen Schliessens
|
PS | PS (2:1) | |||
Kapitel 5: Automatisierte Softwareentwicklung
|
PS | PS (2:1) | |||
Anhang A: Typentheorie: Syntax, Semantik, Inferenzregeln
|
PS | PS (2:1) | |||
Anhang B: Konservative Erweiterungen der Typentheorie und ihre Gesetze
|
PS | PS (2:1) | |||
Literaturverzeichnis
|
PS | PS (2:1) | |||
Derivation of a Fast Integer Square Root Algorithm
|
PS | ||||
Formal Derivation of an Algorithm for the Stamps Problem
|
PS | ||||
Connection-based Theorem Proving in Classical and Non-classical Logics
|
PS | ||||
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style
Systems
|
PS | ||||
JProver: Integrating Connection-based Theorem Proving into
Interactive Proof Assistants
|
PS | ||||
Program Synthesis
|
PS | ||||
The Nuprl Theory of Lists
|
PS | ||||
Building Reliable, High-Performance Networks
with the Nuprl Proof Development System
|
PS | ||||
Das NuPRL System (Installationspaket 92 MegaByte!) | |||||
Die Quellen (cd <fdlhome>; cd .. ; tar zxf ../source.tgz) | |||||
The Nuprl Proof Development System, Version 5:
Reference Manual and User's Guide |
|||||
Individual Chapters |
|
||||
Chapter 1:
Introduction
|
PS | PS (2:1) | |||
Chapter 2:
A quick overview
|
PS | PS (2:1) | |||
Chapter 3:
Running Nuprl
|
PS | PS (2:1) | |||
Chapter 4:
The Navigator and the Top Loops
|
PS | PS (2:1) | |||
Chapter 5:
Editing Terms
|
PS | PS (2:1) | |||
Chapter 6:
Interactive Proof Development
|
PS | PS (2:1) | |||
Chapter 7:
Definition and Presentation of Terms
|
PS | PS (2:1) | |||
Chapter 8:
Rules and Tactics
|
PS | PS (2:1) | |||
Appendix A:
The Basic Nuprl Type Theory
|
PS | PS (2:1) | |||
Appendix B:
Introduction to Nuprl ML
|
PS | PS (2:1) |