1 option
Types for Proofs and Programs : International Conference, TYPES 2007, Cividale del Friuli, Italy, May 2-5, 2007, Revised Selected Papers / edited by Marino Miculan, Ivan Scagnetto, Furio Honsell.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 4941.
- Theoretical Computer Science and General Issues ; 4941
- Language:
- English
- Subjects (All):
- Software engineering.
- Computer logic.
- Logic, Symbolic and mathematical.
- Programming languages (Electronic computers).
- Computer science--Mathematics.
- Computer science.
- Artificial intelligence.
- Software Engineering/Programming and Operating Systems.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Programming Languages, Compilers, Interpreters.
- Symbolic and Algebraic Manipulation.
- Artificial Intelligence.
- Local Subjects:
- Software Engineering/Programming and Operating Systems.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Programming Languages, Compilers, Interpreters.
- Symbolic and Algebraic Manipulation.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (VII, 203 pages).
- Edition:
- First edition 2008.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
- System Details:
- text file PDF
- Summary:
- This book constitutes the thoroughly refereed post-conference proceedings of TYPES 2007, the concluding conference of the Types project, held in Cividale del Friuli, Italy, in May 2007. The 13 revised full papers presented were carefully reviewed and selected from 22 submissions. The topic of this last annual workshop of the Types Working Group was formal reasoning and computer programming based on type theory. Great importance was attached to languages and computerized tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, formalization of mathematics and mathematics education.
- Contents:
- Algorithmic Equality in Heyting Arithmetic Modulo
- CoqJVM: An Executable Specification of the Java Virtual Machine Using Dependent Types
- Dependently Sorted Logic
- Finiteness in a Minimalist Foundation
- A Declarative Language for the Coq Proof Assistant
- Characterising Strongly Normalising Intuitionistic Sequent Terms
- Intuitionistic vs. Classical Tautologies, Quantitative Comparison
- In the Search of a Naive Type Theory
- Verification of the Redecoration Algorithm for Triangular Matrices
- A Logic for Parametric Polymorphism with Effects
- Working with Mathematical Structures in Type Theory
- On Normalization by Evaluation for Object Calculi
- Attributive Types for Proof Erasure.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-68103-8
- 9783540681038
- 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.