LEADER 03478nam  2200625 a 450 
001 9910485038503321
005 20200520144314.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   $a20080408d2008      uy         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aTypes for proofs and programs $einternational conference, TYPES 2007, Cividale del Friuli, Italy, May 2-5, 2007 : revised selected papers /$fMarino Miculan, Ivan Scagnetto, Furio Honsell (eds.)
205   $a1st ed. 2008.
210   $aBerlin ;$aNew York $cSpringer$dc2008
215   $a1 online resource (VII, 203 p.) 
225 1 $aLecture notes in computer science,$x0302-9743 ;$v4941
225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues
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$aLecture notes in computer science ;$v4941.
410  0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues.
517 3 $aTYPES 2007
606   $aAutomatic theorem proving$vCongresses
606   $aComputer programming$vCongresses
615  0$aAutomatic theorem proving
615  0$aComputer programming
676   $a005.13/1
686   $a54.52$2bcl
701   $aMiculan$b Marino$01762555
701   $aScagnetto$b Ivan$0502484
701   $aHonsell$b Furio$0626692
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910485038503321
996   $aTypes for proofs and programs$94202563
997   $aUNINA