The following pages link to Hat (Q25593):
Displaying 19 items.
- Dynamic slicing of lazy functional programs based on redex trails (Q2271904) (← links)
- Structure and Properties of Traces for Functional Programs (Q2867898) (← links)
- Enhancing Theorem Prover Interfaces with Program Slice Information (Q2867933) (← links)
- Reporting Failures in Functional Logic Programs (Q2873788) (← links)
- A Framework for Interpreting Traces of Functional Logic Computations (Q2873790) (← links)
- Backward Trace Slicing for Conditional Rewrite Theories (Q2891440) (← links)
- Dynamic optimization for functional reactive programming using generalized algebraic data types (Q2936767) (← links)
- How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger (Q3150209) (← links)
- Introducing Debugging Capabilities to Natural Semantics (Q3401945) (← links)
- Forward slicing of functional logic programs by partial evaluation (Q3430670) (← links)
- A Program Transformation for Tracing Functional Logic Computations (Q3591083) (← links)
- (Q4433998) (← links)
- Lazy call-by-value evaluation (Q5168933) (← links)
- Searching for deadlocks while debugging concurrent haskell programs (Q5178019) (← links)
- Backward Trace Slicing for Rewriting Logic Theories (Q5200013) (← links)
- Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat (Q5390283) (← links)
- Theoretical Aspects of Computing – ICTAC 2005 (Q5395102) (← links)
- The Feasibility of Interactively Probing Quiescent Properties of GUI Applications (Q5423541) (← links)
- Source-Based Trace Exploration (Q5423548) (← links)
