1 option
Types for Proofs and Programs : International Workshop TYPES'96, Aussois, France, December 15-19, 1996 Selected Papers / edited by Eduardo Gimenez, Christine Paulin-Mohring.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1512.
- Lecture Notes in Computer Science, 0302-9743 ; 1512
- Language:
- English
- Subjects (All):
- Software engineering.
- Computer logic.
- Logic, Symbolic and mathematical.
- Programming languages (Electronic computers).
- Artificial intelligence.
- Software Engineering/Programming and Operating Systems.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Programming Languages, Compilers, Interpreters.
- Artificial Intelligence.
- Local Subjects:
- Software Engineering/Programming and Operating Systems.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Programming Languages, Compilers, Interpreters.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (VIII, 380 pages).
- Edition:
- First edition 1998.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
- System Details:
- text file PDF
- Summary:
- This book constitutes the thoroughly revised post-workshop proceedings of the first annual workshop held under the auspices of the ESPRIT Working Group 21900 TYPES in Aussois, France in December 1996. The 18 revised full papers presented in the book were carefully reviewed and selected from the 30 papers accepted for presentation at the workshop. All current aspects of type theory and type systems and their applications to program verification and theorem proving are addressed; the proof systems and theorem provers dealt with include Coq, LEGO, and Isabelle/HOL.
- Contents:
- Coercion synthesis in computer implementations of type-theoretic frameworks
- Verification of the interface of a small proof system in coq
- An implementation of the Heine-Borel covering theorem in type theory
- Detecting and removing dead-code using rank 2 intersection
- A type-free formalization of mathematics where proofs are objects
- Higman's lemma in type theory
- A proof of weak termination of typed ??-calculi
- Proof style
- Some algorithmic and proof-theoretical aspects of coercive subtyping
- Semantical BNF
- The internal type theory of a Heyting pretopos
- Inverting inductively defined relations in LEGO
- A generic normalisation proof for pure type systems
- Proving a real time algorithm for ATM in Coq
- Dependent types with explicit substitutions: A meta-theoretical development
- Type inference verified: Algorithm W in Isabelle/HOL
- Continuous lattices in formal topology
- Abstract insertion sort in an extension of type theory with record types and subtyping.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-49562-8
- 9783540495628
- 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.