• Login
• Admin

Hope, Catherine and Hutton, Graham (2005) Accurate Step Counting. In: 17th International Workshop on Implementation and Application of Functional Languages, Dublin, Ireland.

Full text not available from this repository.

Abstract

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.

Item Type:	Conference or Workshop Item (Paper)
RIS ID:	https://nottingham-repository.worktribe.com/output/1020404
Schools/Departments:	University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User:	Hutton, Graham
Date Deposited:	26 Oct 2005
Last Modified:	04 May 2020 20:30
URI:	https://eprints.nottingham.ac.uk/id/eprint/247

Actions (Archive Staff Only)

Edit View