↓ Skip to main content
What is this page? Embed badge

Typed Lambda Calculi and Applications

Overview of attention for book
Cover of 'Typed Lambda Calculi and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Many Happy Re urns
  3. Altmetric Badge
    Chapter 2 From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour
  4. Altmetric Badge
    Chapter 3 Definability of Total Objects in PCF and Related Calculi
  5. Altmetric Badge
    Chapter 4 Categorical Semantics of Control
  6. Altmetric Badge
    Chapter 5 Representations of First Order Function Types as Terminal Coalgebras
  7. Altmetric Badge
    Chapter 6 A Finitary Subsystem of the Polymorphic λ-Calculus
  8. Altmetric Badge
    Chapter 7 Sequentiality and the π-Calculus
  9. Altmetric Badge
    Chapter 8 Logical Properites of Name Restriction
  10. Altmetric Badge
    Chapter 9 Subtyping Recursive Games
  11. Altmetric Badge
    Chapter 10 Typing Lambda Terms in Elementary Logic with Linear Constraints
  12. Altmetric Badge
    Chapter 11 Ramied Recurrence with Dependent Types
  13. Altmetric Badge
    Chapter 12 Game Semantics for the Pure Lazy λ-Calculus
  14. Altmetric Badge
    Chapter 13 Reductions, intersection types, and explicit substitutions
  15. Altmetric Badge
    Chapter 14 The Stratified Foundations as a Theory Modulo
  16. Altmetric Badge
    Chapter 15 Normalization by Evaluation for the Computational Lambda-Calculus
  17. Altmetric Badge
    Chapter 16 Induction Is Not Derivable in Second Order Dependent Type Theory
  18. Altmetric Badge
    Chapter 17 Strong Normalization of Classical Natural Deduction with Disjunction
  19. Altmetric Badge
    Chapter 18 Partially Additive Categories and Fully Complete Models of Linear Logic
  20. Altmetric Badge
    Chapter 19 Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types
  21. Altmetric Badge
    Chapter 20 The Finitely Generated Types of the λ-Calculus
  22. Altmetric Badge
    Chapter 21 Deciding Monadic Theories of Hyperalgebraic Trees
  23. Altmetric Badge
    Chapter 22 A Deconstruction of Non-deterministic Classical Cut Elimination
  24. Altmetric Badge
    Chapter 23 A Token Machine for Full Geometry of Interaction (Extended Abstract)
  25. Altmetric Badge
    Chapter 24 Second-Order Pre-logical Relations and Representation Independence
  26. Altmetric Badge
    Chapter 25 Characterizing Convergent Terms in Object Calculi via Intersection Types
  27. Altmetric Badge
    Chapter 26 Parigot’s Second Order λμ-Calculus and Inductive Types
  28. Altmetric Badge
    Chapter 27 The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping
  29. Altmetric Badge
    Chapter 28 Evolving Games and Essential Nets for Affine Polymorphism
  30. Altmetric Badge
    Chapter 29 Retracts in Simple Types
  31. Altmetric Badge
    Chapter 30 Parallel Implementation Models for the λ-Calculus Using the Geometry of Interaction (Extended Abstract)
  32. Altmetric Badge
    Chapter 31 The complexity of β-reduction in low orders
  33. Altmetric Badge
    Chapter 32 Strong Normalisation for a Gentzen-like Cut-Elimination Procedure
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users

Citations

dimensions_citation
2 Dimensions
Summary X Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Typed Lambda Calculi and Applications
Published by
Springer, Berlin, Heidelberg, January 2001
DOI 10.1007/3-540-45413-6
ISBNs
978-3-54-041960-0, 978-3-54-045413-7
Editors

Samson Abramsky

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.

This page is provided by Altmetric.