作者: Catherine Hope , Graham Hutton
DOI: 10.1007/11964681_6
关键词: Machine code 、 Data structure 、 Functional programming 、 Algorithm 、 Function (mathematics) 、 Process (computing) 、 Range (mathematics) 、 Computer science 、 Abstract machine 、 Program transformation 、 Expression (mathematics)
摘要: Starting with an evaluator for a language, abstract machine the same language can be mechanically derived using successive program transformations. This has relevance to studying both time and space properties of programs because these estimated by counting transitions measuring size additional data structures needed, such as environments stacks. In this paper we will use process derive function that accurately counts number steps required evaluate expressions in simple illustrate range examples.