000 | 03696nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-540-48959-7 | ||
003 | DE-He213 | ||
005 | 20240423132502.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1999 gw | s |||| 0|eng d | ||
020 |
_a9783540489597 _9978-3-540-48959-7 |
||
024 | 7 |
_a10.1007/3-540-48959-2 _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 |
_aTyped Lambda Calculi and Applications _h[electronic resource] : _b4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings / _cedited by Jean-Yves Girard. |
250 | _a1st ed. 1999. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1999. |
|
300 |
_aVIII, 404 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 ; _v1581 |
|
505 | 0 | _aInvited Demonstration -- The Coordination Language Facility and Applications -- AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem -- Contributions -- Modules in Non-commutative Logic -- Elementary Complexity and Geometry of Interaction -- Quantitative Semantics Revisited -- Total Functionals and Well-Founded Strategies -- Counting a Type’s Principal Inhabitants -- Useless-Code Detection and Elimination for PCF with Algebraic Data Types -- Every Unsolvable ? Term has a Decoration -- Game Semantics for Untyped ???-Calculus -- A Finite Axiomatization of Inductive-Recursive Definitions -- Lambda Definability with Sums via Grothendieck Logical Relations -- Explicitly Typed ??-Calculus for Polymorphism and Call-by-Value -- Soundness of the Logical Framework for Its Typed Operational Semantic -- Logical Predicates for Intuitionistic Linear Type Theories -- Polarized Proof-Nets: Proof-Nets for LC -- Call-by-Push-Value: A Subsuming Paradigm -- A Study of Abramsky’s Linear Chemical Abstract Machine -- Resource Interpretations, Bunched Implications and the ??-Calculus (Preliminary Version) -- A Curry-Howard Isomorphism for Compilation and Program Execution -- Natural Deduction for Intuitionistic Non-commutative Linear Logic -- A Logic for Abstract Data Types as Existential Types -- Characterising Explicit Substitutions which Preserve Termination -- Explicit Environments -- Consequences of Jacopini’s Theorem: Consistent Equalities and Equations -- Strong Normalisation of Cut-Elimination in Classical Logic -- Pure Type Systems with Subtyping. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aMathematical logic. | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aMathematical Logic and Foundations. |
700 | 1 |
_aGirard, Jean-Yves. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540657637 |
776 | 0 | 8 |
_iPrinted edition: _z9783662185056 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1581 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-48959-2 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188271 _d188271 |