top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Theorem Proving in Higher Order Logics [[electronic resource] ] : 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001. Proceedings / / edited by Richard J. Boulton, Paul B. Jackson
Theorem Proving in Higher Order Logics [[electronic resource] ] : 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001. Proceedings / / edited by Richard J. Boulton, Paul B. Jackson
Edizione [1st ed. 2001.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Descrizione fisica 1 online resource (X, 402 p.)
Disciplina 004/.01/51
Collana Lecture Notes in Computer Science
Soggetto topico 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
ISBN 3-540-44755-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 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.
Record Nr. UNISA-996465875103316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Theorem Proving in Higher Order Logics : 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001. Proceedings / / edited by Richard J. Boulton, Paul B. Jackson
Theorem Proving in Higher Order Logics : 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001. Proceedings / / edited by Richard J. Boulton, Paul B. Jackson
Edizione [1st ed. 2001.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Descrizione fisica 1 online resource (X, 402 p.)
Disciplina 004/.01/51
Collana Lecture Notes in Computer Science
Soggetto topico 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
ISBN 3-540-44755-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 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.
Record Nr. UNINA-9910767574603321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui