LEADER 04331nam  22007695  450 
001 996465407003316
005 20200702125154.0
010   $a3-540-45842-5
024 7 $a10.1007/3-540-45842-5
035   $a(CKB)1000000000211678
035   $a(SSID)ssj0000327459
035   $a(PQKBManifestationID)11265772
035   $a(PQKBTitleCode)TC0000327459
035   $a(PQKBWorkID)10301621
035   $a(PQKB)10491463
035   $a(DE-He213)978-3-540-45842-5
035   $a(MiAaPQ)EBC3072895
035   $a(PPN)155232916
035   $a(EXLCZ)991000000000211678
100   $a20121227d2002      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 Workshop, TYPES 2000, Durham, UK, December 8-12, 2000. Selected Papers /$fedited by Paul Callaghan, Zhaohui Luo, James McKinna, Robert Pollack
205   $a1st ed. 2002.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002.
215   $a1 online resource (VIII, 248 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2277
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-43287-6 
320   $aIncludes bibliographical references at the end of each chapters and index.
327   $aCollection Principles in Dependent Type Theory -- Executing Higher Order Logic -- A Tour with Constructive Real Numbers -- An Implementation of Type:Type -- On the Logical Content of Computational Type Theory: A Solution to Curry?s Problem -- Constructive Reals in Coq: Axioms and Categoricity -- A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals -- A Kripke-Style Model for the Admissibility of Structural Rules -- Towards Limit Computable Mathematics -- Formalizing the Halting Problem in a Constructive Type Theory -- On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory -- Changing Data Structures in Type Theory: A Study of Natural Numbers -- Elimination with a Motive -- Generalization in Type Theory Based Proof Assistants -- An Inductive Version of Nash-Williams? Minimal-Bad-Sequence Argument for Higman?s Lemma.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v2277
606   $aComputer logic
606   $aArchitecture, Computer
606   $aMathematical logic
606   $aProgramming languages (Electronic computers)
606   $aArtificial intelligence
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057
606   $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037
606   $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000
615  0$aComputer logic.
615  0$aArchitecture, Computer.
615  0$aMathematical logic.
615  0$aProgramming languages (Electronic computers).
615  0$aArtificial intelligence.
615 14$aLogics and Meanings of Programs.
615 24$aComputer System Implementation.
615 24$aMathematical Logic and Foundations.
615 24$aMathematical Logic and Formal Languages.
615 24$aProgramming Languages, Compilers, Interpreters.
615 24$aArtificial Intelligence.
676   $a006.3/33
702   $aCallaghan$b Paul$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aLuo$b Zhaohui$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aMcKinna$b James$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aPollack$b Robert$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aTYPES 2000
906   $aBOOK
912   $a996465407003316
996   $aTypes for Proofs and Programs$9771867
997   $aUNISA