Theorem Proving in Higher Order Logics 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Boulton, Richard J. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Jackson, Paul B. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2152
• Θέματα: Programming languages (Electronic computers).; Computers.; Artificial intelligence.; Mathematical logic.; Computer logic.; Software engineering.; Programming Languages, Compilers, Interpreters.; Theory of Computation.; Artificial Intelligence.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Software Engineering.

This volume constitutes the proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2001) held 3-6 September 2001 in Edinburgh, Scotland. TPHOLs covers all aspects of theorem proving in higher order logics, as well as related topics in theorem proving and v...

Πίνακας περιεχομένων:

• Invited Talks
• JavaCard Program Verification
• View from the Fringe of the Fringe
• Using Decision Procedures with a Higher-Order Logic
• Regular Contributions
• Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS
• An Irrational Construction of ? from ?
• HELM and the Semantic Math-Web
• Calculational Reasoning Revisited An Isabelle/Isar Experience
• Mechanical Proofs about a Non-repudiation Protocol
• Proving Hybrid Protocols Correct
• Nested General Recursion and Partiality in Type Theory
• A Higher-Order Calculus for Categories
• Certifying the Fast Fourier Transform with Coq
• A Generic Library for Floating-Point Numbers and Its Application to Exact Computing
• Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain
• Abstraction and Refinement in Higher Order Logic
• A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL
• Representing Hierarchical Automata in Interactive Theorem Provers
• Refinement Calculus for Logic Programming in Isabelle/HOL
• Predicate Subtyping with Predicate Sets
• A Structural Embedding of Ocsid in PVS
• A Certified Polynomial-Based Decision Procedure for Propositional Logic
• Finite Set Theory in ACL2
• The HOL/NuPRL Proof Translator
• Formalizing Convex Hull Algorithms
• Experiments with Finite Tree Automata in Coq
• Mizar Light for HOL Light.