1 option
Theorem Proving in Higher Order Logics : 12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings / edited by Yves Bertot, Gilles Dowek, Andre Hirschowitz, Christine Paulin, Laurent Thery.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1690.
- Lecture Notes in Computer Science, 0302-9743 ; 1690
- Language:
- English
- Subjects (All):
- Applied mathematics.
- Engineering mathematics.
- Computer software.
- Logic, Symbolic and mathematical.
- Computer logic.
- Artificial intelligence.
- Software engineering.
- Applications of Mathematics.
- Mathematical Software.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Artificial Intelligence.
- Software Engineering.
- Local Subjects:
- Applications of Mathematics.
- Mathematical Software.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Artificial Intelligence.
- Software Engineering.
- Physical Description:
- 1 online resource (VIII, 364 pages).
- Edition:
- First edition 1999.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
- System Details:
- text file PDF
- Contents:
- Recent Advancements in Hardware Verification - How to Make Theorem Proving Fit for an Industrial Usage
- Disjoint Sums over Type Classes in HOL
- Inductive Datatypes in HOL - Lessons Learned in Formal-Logic Engineering
- Isomorphisms - A Link Between the Shallow and the Deep
- Polytypic Proof Construction
- Recursive Function Definition over Coinductive Types
- Hardware Verification Using Co-induction in COQ
- Connecting Proof Checkers and Computer Algebra Using OpenMath
- A Machine-Checked Theory of Floating Point Arithmetic
- Universal Algebra in Type Theory
- Locales A Sectioning Concept for Isabelle
- Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
- On the Implementation of an Extensible Declarative Proof Language
- Three Tactic Theorem Proving
- Mechanized Operational Semantics via (Co)Induction
- Representing WP Semantics in Isabelle/ZF
- A HOL Conversion for Translating Linear Time Temporal Logic to ?-Automata
- From I/O Automata to Timed I/O Automata
- Formal Methods and Security Evaluation
- Importing MDG Verification Results into HOL
- Integrating Gandalf and HOL
- Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
- Symbolic Functional Evaluation.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-48256-7
- 9783540482567
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.