03351oam 2200553 450 991014346560332120210717111130.03-540-48959-210.1007/3-540-48959-2(CKB)1000000000211075(SSID)ssj0000327457(PQKBManifestationID)11294587(PQKBTitleCode)TC0000327457(PQKBWorkID)10301733(PQKB)11568734(DE-He213)978-3-540-48959-7(MiAaPQ)EBC3073271(MiAaPQ)EBC6485750(PPN)15522090X(EXLCZ)99100000000021107520210717d1999 uy 0engurnn|008mamaatxtccrTyped lambda calculi and applications 4th international conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999 : proceedings /Jean-Yves Girard (editor)1st ed. 1999.Berlin :Springer,[1999]©19991 online resource (VIII, 404 p.) Lecture notes in computer science ;1581Bibliographic Level Mode of Issuance: Monograph3-540-65763-0 Includes bibliographical references and index.Invited 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.Lecture notes in computer science ;1581.Lambda calculusCongressesLambda calculus511.3Girard Jean-YvesInternational Conference on Typed Lambda Calculi and ApplicationsMiAaPQMiAaPQUtOrBLWBOOK9910143465603321Typed Lambda Calculi and Applications772124UNINA