↓ Skip to main content

Mathematical Foundations of Computer Science 1979

Overview of attention for book
Cover of 'Mathematical Foundations of Computer Science 1979'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A sound and complete proof system for partial program correctness
  3. Altmetric Badge
    Chapter 2 The problem of reachability and verification of programs
  4. Altmetric Badge
    Chapter 3 Assertion programming
  5. Altmetric Badge
    Chapter 4 Complexity classes of formal languages
  6. Altmetric Badge
    Chapter 5 Fast probabilistic algorithms
  7. Altmetric Badge
    Chapter 6 Relative succinctness of representations of languages and separation of complexity classes
  8. Altmetric Badge
    Chapter 7 On two types of loops
  9. Altmetric Badge
    Chapter 8 Full abstraction for a simple parallel programming language
  10. Altmetric Badge
    Chapter 9 On some developments in cryptography and their applications to computer science
  11. Altmetric Badge
    Chapter 10 Searching, sorting and information theory
  12. Altmetric Badge
    Chapter 11 Lcf: A way of doing proofs with a machine
  13. Altmetric Badge
    Chapter 12 Axioms or algorithms
  14. Altmetric Badge
    Chapter 13 Power from power series
  15. Altmetric Badge
    Chapter 14 Computational complexity of string and graph ident ification
  16. Altmetric Badge
    Chapter 15 A survey of grammar and l forms-1978
  17. Altmetric Badge
    Chapter 16 A theoretical study on the time analysis of programs
  18. Altmetric Badge
    Chapter 17 Completeness problems in verification of programs and program schemes
  19. Altmetric Badge
    Chapter 18 Relationships between AFDL's and cylinders
  20. Altmetric Badge
    Chapter 19 Computable data types
  21. Altmetric Badge
    Chapter 20 Program equivalence and provability
  22. Altmetric Badge
    Chapter 21 Interactive L systems with almost interactionless behaviour
  23. Altmetric Badge
    Chapter 22 On the simplification of constructions in degrees of unsolvability via computational complexity
  24. Altmetric Badge
    Chapter 23 An algebraic extension of the Chomsky — hierarchy
  25. Altmetric Badge
    Chapter 24 Bounds on computational complexity and approximability of initial segments of recursive sets
  26. Altmetric Badge
    Chapter 25 On the weighted path length of binary search trees for unknown access probabilities
  27. Altmetric Badge
    Chapter 26 Computational complexity of approximation algorithms for combinatorial problems
  28. Altmetric Badge
    Chapter 27 A reduct-and-closure algorithm for graphs
  29. Altmetric Badge
    Chapter 28 Small universal Minsky machines
  30. Altmetric Badge
    Chapter 29 Parallel and two-way recognizers of directed acyclic graphs
  31. Altmetric Badge
    Chapter 30 Fully effective solutions of recursive domain equations
  32. Altmetric Badge
    Chapter 31 A note on computational complexity of a statistical deducibility testing procedure
  33. Altmetric Badge
    Chapter 32 Context free normal systems
  34. Altmetric Badge
    Chapter 33 New proofs for jump dpda's
  35. Altmetric Badge
    Chapter 34 Synchronization and maximality for very pure subsemigroups of a free semigroup
  36. Altmetric Badge
    Chapter 35 On the sets of minimal indices of partial recursive functions
  37. Altmetric Badge
    Chapter 36 Some remarks on Boolean sums
  38. Altmetric Badge
    Chapter 37 On the propositional algorithmic logic
  39. Altmetric Badge
    Chapter 38 Ch(k) grammars: A characterization of LL(k) languages
  40. Altmetric Badge
    Chapter 39 A uniform approach to balanced binary and multiway trees
  41. Altmetric Badge
    Chapter 40 On the generative capacity of some classes of grammars with regulated rewriting
  42. Altmetric Badge
    Chapter 41 Validity test for Floyd's operator-precedence parsing algorithms
  43. Altmetric Badge
    Chapter 42 On the languages of bounded Petri nets
  44. Altmetric Badge
    Chapter 43 Dyck language D2 is not absolutely parallel
  45. Altmetric Badge
    Chapter 44 Fixed points in the power-set algebra of infinite trees
  46. Altmetric Badge
    Chapter 45 On relaxation rules in algorithmic logic
  47. Altmetric Badge
    Chapter 46 L-Fuzzy functorial automata
  48. Altmetric Badge
    Chapter 47 Schematics of structural parallel programming and its applications
  49. Altmetric Badge
    Chapter 48 On axiomatization of deterministic propositional dynamic logic
  50. Altmetric Badge
    Chapter 49 Bounded recursion and complexity classes
  51. Altmetric Badge
    Chapter 50 Characterization of rational and algebraic power series
  52. Altmetric Badge
    Chapter 51 A crossing measure for 2-tape Turing machines
  53. Altmetric Badge
    Chapter 52 The complexity of lexicographic sorting and searching
  54. Altmetric Badge
    Chapter 53 An algebraic approach to concurrence
  55. Altmetric Badge
    Chapter 54 On multitape automata
  56. Altmetric Badge
    Chapter 55 A turing machine oracle hierarchy
  57. Altmetric Badge
    Chapter 56 A survey of some syntactic results in the λ-calculus
  58. Altmetric Badge
    Chapter 57 On rational expressions representing infinite rational trees : Application to the structure of flow charts
Attention for Chapter 11: Lcf: A way of doing proofs with a machine
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
1 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
Lcf: A way of doing proofs with a machine
Chapter number 11
Book title
Mathematical Foundations of Computer Science 1979
Published in
Lecture notes in computer science, May 2005
DOI 10.1007/3-540-09526-8_11
Book ISBNs
978-3-54-009526-2, 978-3-54-035088-0
Authors

Milner, Robin, Robin Milner

Editors

Jiří Bečvář

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 100%
Readers by discipline Count As %
Computer Science 1 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 16 February 2016.
All research outputs
#7,473,822
of 22,849,304 outputs
Outputs from Lecture notes in computer science
#2,487
of 8,126 outputs
Outputs of similar age
#20,356
of 57,650 outputs
Outputs of similar age from Lecture notes in computer science
#14
of 59 outputs
Altmetric has tracked 22,849,304 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,126 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 54% 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 57,650 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 13th percentile – i.e., 13% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 59 others from the same source and published within six weeks on either side of this one. This one is in the 37th percentile – i.e., 37% of its contemporaries scored the same or lower than it.