最 低 价：￥511.90
| Invited Lectures Many Happy Returns From Bounded Arithmetic t0 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 71π-Calculus Logical Properties of Name Restriction Subtyping Recursive Games Typing Lambda Terms in Elementary Logic with Linear Constraints Ramified Recurrence with Dependent Types Game Semantics for the PUre Lazy λ-Calculus Reductions，Intersection Types，and Explicit S ubstitutions The Stratified Foundations as a Theory Modulo Normalization by Evaluation for the Computational Lambda-Calculus In duction 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 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 The Complexity of β-Reduction in Low Orders Strong Normalisation for a Gentzen-like Cut-Elimination Procedure Author Index |
内容加载中，请稍后...
商品评论（0条）