Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
Formally based profiling for higher-order functional languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
QuickCheck: a lightweight tool for random testing of Haskell programs
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
A Practical Introduction to Data Structures and Algorithm Analysis
A Practical Introduction to Data Structures and Algorithm Analysis
Definitional Interpreters for Higher-Order Programming Languages
Higher-Order and Symbolic Computation
A functional correspondence between evaluators and abstract machines
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A tutorial on the universality and expressiveness of fold
Journal of Functional Programming
A functional correspondence between call-by-need evaluators and lazy abstract machines
Information Processing Letters
MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
| Hi-index | 0.00 |
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 time and space 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 paper we will use this process to derive a function that accurately counts the number of steps required to evaluate expressions in a simple language, and illustrate this function with a range of examples.