LEADER 04318nam  22007935  450 
001 996465609803316
005 20230406063134.0
010   $a3-540-68103-5
024 7 $a10.1007/978-3-540-68103-8
035   $a(CKB)1000000000440589
035   $a(SSID)ssj0000320543
035   $a(PQKBManifestationID)11235229
035   $a(PQKBTitleCode)TC0000320543
035   $a(PQKBWorkID)10248082
035   $a(PQKB)11182294
035   $a(DE-He213)978-3-540-68103-8
035   $a(MiAaPQ)EBC3068652
035   $a(PPN)127048030
035   $a(EXLCZ)991000000000440589
100   $a20100301d2008      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aTypes for Proofs and Programs$b[electronic resource] $eInternational Conference, TYPES 2007, Cividale del Friuli, Italy, May 2-5, 2007, Revised Selected Papers /$fedited by Marino Miculan, Ivan Scagnetto, Furio Honsell
205   $a1st ed. 2008.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008.
215   $a1 online resource (VII, 203 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4941
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-68084-5 
320   $aIncludes bibliographical references and index.
327   $aAlgorithmic 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.
330   $aThis 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4941
606   $aSoftware engineering
606   $aComputer science
606   $aMachine theory
606   $aCompilers (Computer programs)
606   $aComputer science?Mathematics
606   $aArtificial intelligence
606   $aSoftware Engineering
606   $aComputer Science Logic and Foundations of Programming
606   $aFormal Languages and Automata Theory
606   $aCompilers and Interpreters
606   $aSymbolic and Algebraic Manipulation
606   $aArtificial Intelligence
615  0$aSoftware engineering.
615  0$aComputer science.
615  0$aMachine theory.
615  0$aCompilers (Computer programs).
615  0$aComputer science?Mathematics.
615  0$aArtificial intelligence.
615 14$aSoftware Engineering.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aFormal Languages and Automata Theory.
615 24$aCompilers and Interpreters.
615 24$aSymbolic and Algebraic Manipulation.
615 24$aArtificial Intelligence.
676   $a005.13/1
686   $a54.52$2bcl
702   $aMiculan$b Marino$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aScagnetto$b Ivan$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aHonsell$b Furio$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465609803316
996   $aTypes for Proofs and Programs$9771867
997   $aUNISA