↓ Skip to main content

Rewriting and Typed Lambda Calculi

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Process Types as a Descriptive Tool for Interaction
  3. Altmetric Badge
    Chapter 2 Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk)
  4. Altmetric Badge
    Chapter 3 Rewriting and Typed Lambda Calculi
  5. Altmetric Badge
    Chapter 4 Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
  6. Altmetric Badge
    Chapter 5 Predicate Abstraction of Rewrite Theories
  7. Altmetric Badge
    Chapter 6 Unification and Logarithmic Space
  8. Altmetric Badge
    Chapter 7 Ramsey Theorem as an Intuitionistic Property of Well Founded Relations
  9. Altmetric Badge
    Chapter 8 A Model of Countable Nondeterminism in Guarded Type Theory
  10. Altmetric Badge
    Chapter 9 Cut Admissibility by Saturation
  11. Altmetric Badge
    Chapter 10 Automatic Evaluation of Context-Free Grammars (System Description)
  12. Altmetric Badge
    Chapter 11 Tree Automata with Height Constraints between Brothers
  13. Altmetric Badge
    Chapter 12 A Coinductive Confluence Proof for Infinitary Lambda-Calculus
  14. Altmetric Badge
    Chapter 13 An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
  15. Altmetric Badge
    Chapter 14 Preciseness of Subtyping on Intersection and Union Types
  16. Altmetric Badge
    Chapter 15 Abstract Datatypes for Real Numbers in Type Theory
  17. Altmetric Badge
    Chapter 16 Self Types for Dependently Typed Lambda Encodings
  18. Altmetric Badge
    Chapter 17 Rewriting and Typed Lambda Calculi
  19. Altmetric Badge
    Chapter 18 Rewriting and Typed Lambda Calculi
  20. Altmetric Badge
    Chapter 19 Amortised Resource Analysis and Typed Polynomial Interpretations
  21. Altmetric Badge
    Chapter 20 Confluence by Critical Pair Analysis
  22. Altmetric Badge
    Chapter 21 Proof Terms for Infinitary Rewriting
  23. Altmetric Badge
    Chapter 22 Construction of Retractile Proof Structures
  24. Altmetric Badge
    Chapter 23 Local States in String Diagrams
  25. Altmetric Badge
    Chapter 24 Reduction System for Extensional Lambda-mu Calculus
  26. Altmetric Badge
    Chapter 25 The Structural Theory of Pure Type Systems
  27. Altmetric Badge
    Chapter 26 Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB
  28. Altmetric Badge
    Chapter 27 Implicational Relevance Logic is 2- ExpTime -Complete
  29. Altmetric Badge
    Chapter 28 Near Semi-rings and Lambda Calculus
  30. Altmetric Badge
    Chapter 29 All-Path Reachability Logic
  31. Altmetric Badge
    Chapter 30 Rewriting and Typed Lambda Calculi
  32. Altmetric Badge
    Chapter 31 Rewriting and Typed Lambda Calculi
  33. Altmetric Badge
    Chapter 32 Nagoya Termination Tool
  34. Altmetric Badge
    Chapter 33 Termination of Cycle Rewriting
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (75th percentile)
  • Good Attention Score compared to outputs of the same age and source (67th percentile)

Mentioned by

twitter
4 X users
wikipedia
1 Wikipedia page

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 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.
Title
Rewriting and Typed Lambda Calculi
Published by
Lecture notes in computer science, January 2014
DOI 10.1007/978-3-319-08918-8
ISBNs
978-3-31-908917-1, 978-3-31-908918-8
Authors

Gilles Dowek

Editors

Dowek, Gilles

X Demographics

X Demographics

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

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Student > Doctoral Student 1 50%
Readers by discipline Count As %
Computer Science 2 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 5. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 30 August 2022.
All research outputs
#6,272,128
of 23,206,358 outputs
Outputs from Lecture notes in computer science
#2,027
of 8,154 outputs
Outputs of similar age
#73,080
of 307,324 outputs
Outputs of similar age from Lecture notes in computer science
#91
of 280 outputs
Altmetric has tracked 23,206,358 research outputs across all sources so far. This one has received more attention than most of these and is in the 72nd percentile.
So far Altmetric has tracked 8,154 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 74% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 307,324 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 75% of its contemporaries.
We're also able to compare this research output to 280 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 67% of its contemporaries.