Execution Profiling for Non-strict Functional Languages

Execution Profiling for Non-strict Functional Languages (1994)

by Patrick M. Sansom , Patrick M. Sansom

Citations:

20 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Execution Profiling for Non-strict Functional Languages	user correction - Legacy Corrections
AUTHOR NAME	Patrick M. Sansom	SVM HeaderParse 0.1
AUTHOR NAME	Patrick M. Sansom	SVM HeaderParse 0.1
ABSTRACT	Profiling tools, which measure and display the dynamic space and time behaviour of programs, are essential for identifying execution bottlenecks. A variety of such tools exist for conventional languages, but almost none for non-strict functional languages. There is a good reason for this: lazy evaluation means that the program is executed in an order which is not immediately apparent from the source code, so it is difficult to relate dynamically-gathered statistics back to the original source. This thesis examines the difficulties of profiling lazy higher-order functional languages and develops a profiling tool which overcomes them. It relates information about both the time and space requirements of the program back to the original source expressions identified by the programmer. Considerable attention is paid to the cost semantics with two abstract cost semantics, lexical scoping and evaluation scoping, being investigated. Experience gained from the two profiling schemes led to the d...	user correction - Legacy Corrections
YEAR	1994	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	PhD thesis	INFERENCE
CITATIONS	77 found	ParsCit 1.0