Accurate Step Counting
Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevance to studying both the space and time properties of programs because these can be estimated by counting transitions of the abst...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2005
|
| Online Access: | https://eprints.nottingham.ac.uk/247/ |
| _version_ | 1848790378664165376 |
|---|---|
| author | Hope, Catherine Hutton, Graham |
| author_facet | Hope, Catherine Hutton, Graham |
| author_sort | Hope, Catherine |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevance to studying both the space and time properties of programs because these can be estimated by counting transitions of the abstract machine and measuring the size of the additional data structures needed, such as environments and stacks. In this article we use this process to derive a function that accurately counts the number of steps required to evaluate expressions in a simple language. |
| first_indexed | 2025-11-14T18:11:40Z |
| format | Conference or Workshop Item |
| id | nottingham-247 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T18:11:40Z |
| publishDate | 2005 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-2472020-05-04T20:30:51Z https://eprints.nottingham.ac.uk/247/ Accurate Step Counting Hope, Catherine Hutton, Graham Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevance to studying both the space and time properties of programs because these can be estimated by counting transitions of the abstract machine and measuring the size of the additional data structures needed, such as environments and stacks. In this article we use this process to derive a function that accurately counts the number of steps required to evaluate expressions in a simple language. 2005 Conference or Workshop Item PeerReviewed Hope, Catherine and Hutton, Graham (2005) Accurate Step Counting. In: 17th International Workshop on Implementation and Application of Functional Languages, Dublin, Ireland. |
| spellingShingle | Hope, Catherine Hutton, Graham Accurate Step Counting |
| title | Accurate Step Counting |
| title_full | Accurate Step Counting |
| title_fullStr | Accurate Step Counting |
| title_full_unstemmed | Accurate Step Counting |
| title_short | Accurate Step Counting |
| title_sort | accurate step counting |
| url | https://eprints.nottingham.ac.uk/247/ |