|
|
|
|
| LEADER |
03133nam a22006015i 4500 |
| 001 |
978-3-540-31429-5 |
| 003 |
DE-He213 |
| 005 |
20151204142040.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100409s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540314295
|9 978-3-540-31429-5
|
| 024 |
7 |
|
|a 10.1007/11617990
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.L63
|
| 050 |
|
4 |
|a QA76.5913
|
| 050 |
|
4 |
|a QA76.63
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a UYF
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 072 |
|
7 |
|a COM036000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1015113
|2 23
|
| 245 |
1 |
0 |
|a Types for Proofs and Programs
|h [electronic resource] :
|b International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers /
|c edited by Jean-Christophe Filliâtre, Christine Paulin-Mohring, Benjamin Werner.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2006.
|
| 300 |
|
|
|a VIII, 280 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 3839
|
| 505 |
0 |
|
|a Formalized Metatheory with Terms Represented by an Indexed Family of Types -- A Content Based Mathematical Search Engine: Whelp -- A Machine-Checked Formalization of the Random Oracle Model -- Extracting a Normalization Algorithm in Isabelle/HOL -- A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis -- Formalising Bitonic Sort in Type Theory -- A Semi-reflexive Tactic for (Sub-)Equational Reasoning -- A Uniform and Certified Approach for Two Static Analyses -- Solving Two Problems in General Topology Via Types -- A Tool for Automated Theorem Proving in Agda -- Surreal Numbers in Coq -- A Few Constructions on Constructors -- Tactic-Based Optimized Compilation of Functional Programs -- Interfaces as Games, Programs as Strategies -- ?Z: Zermelo’s Set Theory as a PTS with 4 Sorts -- Exploring the Regular Tree Types -- On Constructive Existence.
|
| 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 Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 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 Filliâtre, Jean-Christophe.
|e editor.
|
| 700 |
1 |
|
|a Paulin-Mohring, Christine.
|e editor.
|
| 700 |
1 |
|
|a Werner, Benjamin.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540314288
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3839
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11617990
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
