In this thesis we present a condensed, goal-independent, bottom-up fixpoint
that is fully abstract w.r.t. results computed for Curry/Haskell expressions. These features make our semantics particularly suitable for developing efficacious semantics-based program manipulation tools. To support this claim, we provide some applications: a static analyzer for groundness dependencies, an abstract debugging/diagnosis method, and an automatic method for synthesizing property-oriented specifications
