000 03761nam a22005535i 4500
001 978-3-540-73228-0
003 DE-He213
005 20240730181447.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540732280
_9978-3-540-73228-0
024 7 _a10.1007/978-3-540-73228-0
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aTyped Lambda Calculi and Applications
_h[electronic resource] :
_b8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings /
_cedited by Simona Ronchi Della Rocca.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aX, 400 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4583
505 0 _aOn a Logical Foundation for Explicit Substitutions -- From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing -- Strong Normalization and Equi-(Co)Inductive Types -- Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves -- The Safe Lambda Calculus -- Intuitionistic Refinement Calculus -- Computation by Prophecy -- An Arithmetical Proof of the Strong Normalization for the ?-Calculus with Recursive Equations on Types -- Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo -- Completing Herbelin's Programme -- Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi -- Ludics is a Model for the Finitary Linear Pi-Calculus -- Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic -- The Omega Rule is -Complete in the ??-Calculus -- Weakly Distributive Domains -- Initial Algebra Semantics Is Enough! -- A Substructural Type System for Delimited Continuations -- The Inhabitation Problem for Rank Two Intersection Types -- Extensional Rewriting with Sums -- Higher-Order Logic Programming Languages with Constraints: A Semantics -- Predicative Analysis of Feasibility and Diagonalization -- Edifices and Full Abstraction for the Symmetric Interaction Combinators -- Two Session Typing Systems for Higher-Order Mobile Processes -- An Isomorphism Between Cut-Elimination Procedure and Proof Reduction -- Polynomial Size Analysis of First-Order Functions -- Simple Saturated Sets for Disjunction and Second-Order Existential Quantification -- Convolution -Calculus.
650 0 _aMachine theory.
_9124922
650 0 _aComputer science.
_99832
650 0 _aComputer programming.
_94169
650 0 _aCompilers (Computer programs).
_93350
650 1 4 _aFormal Languages and Automata Theory.
_9124923
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aProgramming Techniques.
_9124924
650 2 4 _aCompilers and Interpreters.
_931853
700 1 _aRonchi Della Rocca, Simona.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9124925
710 2 _aSpringerLink (Online service)
_9124926
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540732273
776 0 8 _iPrinted edition:
_z9783540839903
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4583
_9124927
856 4 0 _uhttps://doi.org/10.1007/978-3-540-73228-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90909
_d90909