↓ Skip to main content

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 Typed Lambda Calculi and Applications
  3. Altmetric Badge
    Chapter 2 A Pronominal Approach to Binding and Computation
  4. Altmetric Badge
    Chapter 3 A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
  5. Altmetric Badge
    Chapter 4 Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1
  6. Altmetric Badge
    Chapter 5 Syntax for Free: Representing Syntax with Binding Using Parametricity
  7. Altmetric Badge
    Chapter 6 On the Meaning of Logical Completeness
  8. Altmetric Badge
    Chapter 7 Thick Subtrees, Games and Experiments
  9. Altmetric Badge
    Chapter 8 Bounded Linear Logic, Revisited
  10. Altmetric Badge
    Chapter 9 Partial Orders, Event Structures and Linear Strategies
  11. Altmetric Badge
    Chapter 10 Existential Type Systems with No Types in Terms
  12. Altmetric Badge
    Chapter 11 Initial Algebra Semantics for Cyclic Sharing Structures
  13. Altmetric Badge
    Chapter 12 An Operational Account of Call-by-Value Minimal and Classical λ -Calculus in “Natural Deduction” Form
  14. Altmetric Badge
    Chapter 13 Refinement Types as Proof Irrelevance
  15. Altmetric Badge
    Chapter 14 Weak ω -Categories from Intensional Type Theory
  16. Altmetric Badge
    Chapter 15 Relating Classical Realizability and Negative Translation for Existential Witness Extraction
  17. Altmetric Badge
    Chapter 16 Session-Based Communication Optimisation for Higher-Order Mobile Processes
  18. Altmetric Badge
    Chapter 17 The Cut-Elimination Theorem for Differential Nets with Promotion
  19. Altmetric Badge
    Chapter 18 A Polymorphic Type System for the Lambda-Calculus with Constructors
  20. Altmetric Badge
    Chapter 19 Kripke Semantics for Martin-Löf’s Extensional Type Theory
  21. Altmetric Badge
    Chapter 20 On the Values of Reducibility Candidates
  22. Altmetric Badge
    Chapter 21 Lexicographic Path Induction
  23. Altmetric Badge
    Chapter 22 Parametricity for Haskell with Imprecise Error Semantics
  24. Altmetric Badge
    Chapter 23 Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
  25. Altmetric Badge
    Chapter 24 Algebraic Totality, towards Completeness
  26. Altmetric Badge
    Chapter 25 A Logical Foundation for Environment Classifiers
  27. Altmetric Badge
    Chapter 26 Inhabitation of Low-Rank Intersection Types
  28. Altmetric Badge
    Chapter 27 Differential Linear Logic and Polarization
  29. Altmetric Badge
    Chapter 28 Complexity of Gödel’s T in λ-Formulation
  30. Altmetric Badge
    Chapter 29 The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
Attention for Chapter 26: Inhabitation of Low-Rank Intersection Types
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
6 Mendeley
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.
Chapter title
Inhabitation of Low-Rank Intersection Types
Chapter number 26
Book title
Typed Lambda Calculi and Applications
Published by
Springer, Berlin, Heidelberg, July 2009
DOI 10.1007/978-3-642-02273-9_26
Book ISBNs
978-3-64-202272-2, 978-3-64-202273-9
Authors

Paweł Urzyczyn, Urzyczyn, Paweł

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 6 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 33%
Professor 1 17%
Researcher 1 17%
Student > Doctoral Student 1 17%
Unknown 1 17%
Readers by discipline Count As %
Computer Science 5 83%
Unknown 1 17%