Types for Proofs and Programs
Springer Berlin (Verlag)
978-3-540-31428-8 (ISBN)
Formalized Metatheory with Terms Represented by an Indexed Family of Types.- A Content Based Mathematical Search Engine: Whelp.- A Machine-Checked Formalization of the Random Oracle Model.- Extracting a Normalization Algorithm in Isabelle/HOL.- A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis.- Formalising Bitonic Sort in Type Theory.- A Semi-reflexive Tactic for (Sub-)Equational Reasoning.- A Uniform and Certified Approach for Two Static Analyses.- Solving Two Problems in General Topology Via Types.- A Tool for Automated Theorem Proving in Agda.- Surreal Numbers in Coq.- A Few Constructions on Constructors.- Tactic-Based Optimized Compilation of Functional Programs.- Interfaces as Games, Programs as Strategies.- ?Z: Zermelo's Set Theory as a PTS with 4 Sorts.- Exploring the Regular Tree Types.- On Constructive Existence.
| Erscheint lt. Verlag | 25.1.2006 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | VIII, 280 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 910 g |
| Themenwelt | Informatik ► Theorie / Studium ► Compilerbau |
| Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
| Schlagworte | algorithm • Calculus • Coq • formal methods • Formal Reasoning • Formal Verification • Optimization • programming • Programming language • Programming Theory • Proof theory • proving • Rewriting Systems • subtyping • theorem proving |
| ISBN-10 | 3-540-31428-8 / 3540314288 |
| ISBN-13 | 978-3-540-31428-8 / 9783540314288 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
