|
|
|
|
| LEADER |
03800nam a2200625 4500 |
| 001 |
978-3-540-45842-5 |
| 003 |
DE-He213 |
| 005 |
20191027132231.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s2002 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540458425
|9 978-3-540-45842-5
|
| 024 |
7 |
|
|a 10.1007/3-540-45842-5
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.L63
|
| 050 |
|
4 |
|a QA76.5913
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 072 |
|
7 |
|a UM
|2 thema
|
| 072 |
|
7 |
|a UYF
|2 thema
|
| 082 |
0 |
4 |
|a 005.1015113
|2 23
|
| 245 |
1 |
0 |
|a Types for Proofs and Programs
|h [electronic resource] :
|b International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000. Selected Papers /
|c edited by Paul Callaghan, Zhaohui Luo, James McKinna, Robert Pollack.
|
| 250 |
|
|
|a 1st ed. 2002.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2002.
|
| 300 |
|
|
|a VIII, 248 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2277
|
| 505 |
0 |
|
|a Collection 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 |
|a Computer logic.
|
| 650 |
|
0 |
|a Architecture, Computer.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Logics and Meanings of Programs.
|0 http://scigraph.springernature.com/things/product-market-codes/I1603X
|
| 650 |
2 |
4 |
|a Computer System Implementation.
|0 http://scigraph.springernature.com/things/product-market-codes/I13057
|
| 650 |
2 |
4 |
|a Mathematical Logic and Foundations.
|0 http://scigraph.springernature.com/things/product-market-codes/M24005
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|0 http://scigraph.springernature.com/things/product-market-codes/I16048
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|0 http://scigraph.springernature.com/things/product-market-codes/I14037
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|0 http://scigraph.springernature.com/things/product-market-codes/I21000
|
| 700 |
1 |
|
|a Callaghan, Paul.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Luo, Zhaohui.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a McKinna, James.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Pollack, Robert.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540432876
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783662194775
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2277
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-45842-5
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
