000 03448nam a22006495i 4500
001 978-3-540-45842-5
003 DE-He213
005 20240423132434.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540458425
_9978-3-540-45842-5
024 7 _a10.1007/3-540-45842-5
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aTypes for Proofs and Programs
_h[electronic resource] :
_bInternational Workshop, TYPES 2000, Durham, UK, December 8-12, 2000. Selected Papers /
_cedited by Paul Callaghan, Zhaohui Luo, James McKinna, Robert Pollack.
250 _a1st ed. 2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2002.
300 _aVIII, 248 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2277
505 0 _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.
650 0 _aComputer science.
650 0 _aComputer systems.
650 0 _aMathematical logic.
650 0 _aMachine theory.
650 0 _aCompilers (Computer programs).
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aComputer System Implementation.
650 2 4 _aMathematical Logic and Foundations.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aArtificial Intelligence.
700 1 _aCallaghan, Paul.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLuo, Zhaohui.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMcKinna, James.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPollack, Robert.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540432876
776 0 8 _iPrinted edition:
_z9783662194775
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2277
856 4 0 _uhttps://doi.org/10.1007/3-540-45842-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187761
_d187761