Patrick M. Sansom

dblp:01/5982 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Programming languages and type systems · 54% Program analysis · 39% Compilers and program optimization · 7%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis › dynamic analysis
profiling
0.021997
Formally Based Profiling for Higher-Order Functional Languages · ACM Trans. Program. Lang. Syst. 1997
Time and Space Profiling for Non-Strict Higher-Order Functional Languages · POPL 1995
Programming languages and type systems
functional programming
0.021997
Formally Based Profiling for Higher-Order Functional Languages · ACM Trans. Program. Lang. Syst. 1997
Time and Space Profiling for Non-Strict Higher-Order Functional Languages · POPL 1995
Programming languages and type systems › functional programming
higher-order functional languages
0.011997
Formally Based Profiling for Higher-Order Functional Languages · ACM Trans. Program. Lang. Syst. 1997
Programming languages and type systems
lazy evaluation
0.011995
Time and Space Profiling for Non-Strict Higher-Order Functional Languages · POPL 1995

Methods — techniques the papers use, named apart from their topics

operational semantics · 0.0formal specification · 0.0abstract interpretation · 0.0
YearPublicationVenuePosition
1997 Formally Based Profiling for Higher-Order Functional Languages
abstract
We present the first source-level profiler for a compiled, nonstrict, higher-order, purely functional language capable of measuring time as well as space usage. Our profiler is implemented in a production-quality optimizing compiler for Haskell and can successfully profile large applications. A unique feature of our approach is that we give a formal specification of the attribution of execution costs to cost centers. This specification enables us to discuss our design decisions in a precise framework, prove properties about the attribution of costs, and examine to effects of different program transformations on the attribution of costs. Since it is not obvious how to map this specification onto a particular implementation, we also present an implementation-oriented operational semantics, and prove it equivalent to the specification.
Patrick M. Sansom, Simon L. Peyton Jones
ACM Trans. Program. Lang. Syst.1
1995 Time and Space Profiling for Non-Strict Higher-Order Functional Languages
abstract
We present the first profiler for a compiled, non-strict, higher-order, purely functional language capable of measuring time as well as space usage. Our profiler is implemented in a production-quality optimising compiler for Haskell, has low overheads, and can successfully profile large applications.
Patrick M. Sansom, Simon L. Peyton Jones
POPL1