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.
Mendeley readers
Chapter title |
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
|
---|---|
Chapter number | 7 |
Book title |
Computer Science Logic
|
Published by |
Springer Berlin Heidelberg, January 2006
|
DOI | 10.1007/11874683_7 |
Book ISBNs |
978-3-54-045458-8, 978-3-54-045459-5
|
Authors |
Klaus Aehlig |
Editors |
Zoltán Ésik |
Mendeley readers
The data shown below were compiled from readership statistics for 17 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United Kingdom | 1 | 6% |
Unknown | 16 | 94% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 4 | 24% |
Student > Ph. D. Student | 3 | 18% |
Student > Doctoral Student | 2 | 12% |
Other | 2 | 12% |
Student > Bachelor | 1 | 6% |
Other | 3 | 18% |
Unknown | 2 | 12% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 14 | 82% |
Physics and Astronomy | 1 | 6% |
Unknown | 2 | 12% |