The execution of declarative programs is largely independent of
concrete execution strategies.  For instance, functional logic
languages support various strategies to execute programs, e.g.,
sequential, parallel, concurrent, fair, depth-first etc.  This
freedom causes difficulties for tools intended to visualize,
trace, or debug functional logic computations.  To improve this
situation, we describe structures for representing a functional
logic computation independently of its concrete execution
strategy.  Our representation serves as an interface to connect
different implementations of functional logic languages, such as
PAKCS, KiCS, MCC, FLVM, or TOY, to current and future tools, such
as tracers or debuggers, for visualizing and understanding
computations.