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 user's friendly syntax to define recursive functions as typed λ-terms
|
|---|---|
| Chapter number | 5 |
| Book title |
Types for Proofs and Programs
|
| Published by |
Springer, Berlin, Heidelberg, June 1994
|
| DOI | 10.1007/3-540-60579-7_5 |
| Book ISBNs |
978-3-54-060579-9, 978-3-54-047770-9
|
| Authors |
Pascal Manoury, Manoury, Pascal |
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 % |
|---|---|---|
| Student > Ph. D. Student | 1 | 100% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 1 | 100% |