단행본 상세

서지주요정보
Typed Lambda Calculi and Applications: 5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings
서명 / 저자 Typed Lambda Calculi and Applications [electronic resource] : 5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings / edited by Samson Abramsky.
저자명 Abramsky, Samson. editor. edt http://id.loc.gov/vocabulary/relators/edt
단체명 SpringerLink (Online service)
판사항 1st ed. 2001.
발행사항 Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
총서명 Lecture Notes in Computer Science, 1611-3349 ; 2044
Online Access https://doi.org/10.1007/3-540-... URL

서지기타정보

서지기타정보
ISBN 9783540454137
기타 표준번호 10.1007/3-540-45413-6
청구기호 QA299.6-433
형태사항 XII, 436 p. online resource.
언어 English
내용 Invited Lectures -- Many Happy Re urns -- From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour -- Definability of Total Objects in PCF and Related Calculi -- Categorical Semantics of Control -- Contributed Papers -- Representations of First Order Function Types as Terminal Coalgebras -- A Finitary Subsystem of the Polymorphic ?-Calculus -- Sequentiality and the ?-Calculus -- Logical Properites of Name Restriction -- Subtyping Recursive Games -- Typing Lambda Terms in Elementary Logic with Linear Constraints -- Ramied Recurrence with Dependent Types -- Game Semantics for the Pure Lazy ?-Calculus -- Reductions, intersection types, and explicit substitutions -- The Stratified Foundations as a Theory Modulo -- Normalization by Evaluation for the Computational Lambda-Calculus -- Induction Is Not Derivable in Second Order Dependent Type Theory -- Strong Normalization of Classical Natural Deduction with Disjunction -- Partially Additive Categories and Fully Complete Models of Linear Logic -- Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types -- The Finitely Generated Types of the ?-Calculus -- Deciding Monadic Theories of Hyperalgebraic Trees -- A Deconstruction of Non-deterministic Classical Cut Elimination -- A Token Machine for Full Geometry of Interaction (Extended Abstract) -- Second-Order Pre-logical Relations and Representation Independence -- Characterizing Convergent Terms in Object Calculi via Intersection Types -- Parigot’s Second Order ??-Calculus and Inductive Types -- The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping -- Evolving Games and Essential Nets for Affine Polymorphism -- Retracts in Simple Types -- Parallel Implementation Models for the ?-Calculus Using the Geometry of Interaction (Extended Abstract) -- The complexity of ?-reduction in low orders -- Strong Normalisation for a Gentzen-like Cut-Elimination Procedure.
주제 Mathematical analysis.
Mathematical logic.
Machine theory.
Computer science.
Computer programming.
Compilers (Computer programs).
Analysis.
Mathematical Logic and Foundations.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
Programming Techniques.
Compilers and Interpreters.
보유판 및 특별호 저록 Springer Nature eBook
Printed edition: 9783662204092 Printed edition: 9783540419600
QR CODE