Types for Proofs and Programs International Conference, TYPES 2007, Cividale des Friuli, Italy, May 2-5, 2007 Revised Selected Papers / [electronic resource] :
edited by Marino Miculan, Ivan Scagnetto, Furio Honsell.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
- online resource.
- Lecture Notes in Computer Science, 4941 0302-9743 ; .
- Lecture Notes in Computer Science, 4941 .
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.
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.
9783540681038
10.1007/978-3-540-68103-8 doi
Computer science.
Logic design.
Algebra--Data processing.
Artificial intelligence.
Computer Science.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Programming Languages, Compilers, Interpreters.
Symbolic and Algebraic Manipulation.
Artificial Intelligence (incl. Robotics).
QA76.9.L63 QA76.5913 QA76.63
005.1015113
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.
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.
9783540681038
10.1007/978-3-540-68103-8 doi
Computer science.
Logic design.
Algebra--Data processing.
Artificial intelligence.
Computer Science.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Programming Languages, Compilers, Interpreters.
Symbolic and Algebraic Manipulation.
Artificial Intelligence (incl. Robotics).
QA76.9.L63 QA76.5913 QA76.63
005.1015113