|
|
|
|
| LEADER |
03132nam a22005775i 4500 |
| 001 |
978-3-540-74464-1 |
| 003 |
DE-He213 |
| 005 |
20151204153427.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540744641
|9 978-3-540-74464-1
|
| 024 |
7 |
|
|a 10.1007/978-3-540-74464-1
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.7-76.73
|
| 050 |
|
4 |
|a QA76.76.C65
|
| 072 |
|
7 |
|a UMX
|2 bicssc
|
| 072 |
|
7 |
|a UMC
|2 bicssc
|
| 072 |
|
7 |
|a COM051010
|2 bisacsh
|
| 072 |
|
7 |
|a COM010000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.13
|2 23
|
| 245 |
1 |
0 |
|a Types for Proofs and Programs
|h [electronic resource] :
|b International Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers /
|c edited by Thorsten Altenkirch, Conor McBride.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2007.
|
| 300 |
|
|
|a VIII, 272 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 4502
|
| 505 |
0 |
|
|a Weyl’s Predicative Classical Mathematics as a Logic-Enriched Type Theory -- Crafting a Proof Assistant -- On Constructive Cut Admissibility in Deduction Modulo -- Fast Reflexive Arithmetic Tactics the Linear Case and Beyond -- Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq -- Deciding Equality in the Constructor Theory -- A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family -- Truth Values Algebras and Proof Normalization -- Curry-Style Types for Nominal Terms -- (In)consistency of Extensions of Higher Order Logic and Type Theory -- Constructive Type Classes in Isabelle -- Zermelo’s Well-Ordering Theorem in Type Theory -- A Finite First-Order Theory of Classes -- Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers -- Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs -- Subset Coercions in Coq -- A Certified Distributed Security Logic for Authorizing Code.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 700 |
1 |
|
|a Altenkirch, Thorsten.
|e editor.
|
| 700 |
1 |
|
|a McBride, Conor.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540744634
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4502
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-540-74464-1
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
