000 | 03406nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-540-44904-1 | ||
003 | DE-He213 | ||
005 | 20240423132550.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2003 gw | s |||| 0|eng d | ||
020 |
_a9783540449041 _9978-3-540-44904-1 |
||
024 | 7 |
_a10.1007/3-540-44904-3 _2doi |
|
050 | 4 | _aQA8.9-10.3 | |
072 | 7 |
_aPBCD _2bicssc |
|
072 | 7 |
_aPBC _2bicssc |
|
072 | 7 |
_aMAT018000 _2bisacsh |
|
072 | 7 |
_aPBCD _2thema |
|
072 | 7 |
_aPBC _2thema |
|
082 | 0 | 4 |
_a511.3 _223 |
245 | 1 | 0 |
_aTyped Lambda Calculi and Applications _h[electronic resource] : _b6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings / _cedited by Martin Hofmann. |
250 | _a1st ed. 2003. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2003. |
|
300 |
_aVIII, 320 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 ; _v2701 |
|
505 | 0 | _aTermination and Productivity Checking with Continuous Types -- Derivatives of Containers -- Max-Plus Quasi-interpretations -- Inductive Types in the Calculus of Algebraic Constructions -- On Strong Normalization in the Intersection Type Discipline -- Relative Definability and Models of Unary PCF -- Principal Typing in Elementary Affine Logic -- A Logical Framework with Dependently Typed Records -- A Sound and Complete CPS-Translation for ??-Calculus -- Abstraction Barrier-Observing Relational Parametricity -- Encoding of the Halting Problem into the Monster Type and Applications -- Well-Going Programs Can Be Typed -- Parameterizations and Fixed-Point Operators on Control Categories -- Functional In-Place Update with Layered Datatype Sharing -- A Fully Abstract Bidomain Model of Unary FPC -- On a Semantic Definition of Data Independence -- Nondeterministic Light Logics and NP-Time -- Polarized Proof Nets with Cycles and Fixpoints Semantics -- Observational Equivalence and Program Extraction in the Coq Proof Assistant -- Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts -- A Universal Embedding for the Higher Order Structure of Computational Effects. | |
650 | 0 | _aMathematical logic. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aCompilers (Computer programs). | |
650 | 0 | _aComputer science. | |
650 | 1 | 4 | _aMathematical Logic and Foundations. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aCompilers and Interpreters. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
700 | 1 |
_aHofmann, Martin. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540403326 |
776 | 0 | 8 |
_iPrinted edition: _z9783662165799 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2701 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-44904-3 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c189187 _d189187 |