• Publications
  • Influence
Multiple-View Tracing for Haskell: a New Hat
TLDR
This work presents the design of a trace that can serve several views, which is generated and written to file as the computation proceeds. Expand
Compositional explanation of types and algorithmic debugging of type errors
  • O. Chitil
  • Computer Science
  • ICFP '01
  • 1 October 2001
TLDR
This work proposes to explain types using a variant of the Hindley-Milner type system that defines a compositional type explanation graph of principaltyping, and describes how the programmer understands types by interactive navigation through the explanation graph. Expand
Hat-Delta --- One Right Does Make a Wrong
TLDR
Two methods for locating bugs in a program are outlined, one of which is a program slicing technique, which is used to identify areas of code that are likely to be correct. Expand
Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs
TLDR
This paper compares three systems for tracing and debugging Haskell programs: Freja, Hat and Hood and identifies the strengths and weaknesses of each system and form ideas on how the systems can be improved further. Expand
Functional Programming
  • O. Chitil
  • Computer Science
  • Wiley Encyclopedia of Computer Science and…
  • 2008
TLDR
Functional programming is a programming paradigm like object-oriented programming and logic programming that enables the programmer to describe an algorithm on a high-level, in terms of the problem domain, without having to deal with machine-related details. Expand
Typer inference builds a short cut to deforestation
  • O. Chitil
  • Computer Science
  • ICFP '99
  • 1 September 1999
TLDR
This work presents a linear-time algorithm that solves a partial type inference problem and that, together with controlled inlining and polymorphic type instantiation, suffices for deforestation. Expand
Transforming Haskell for Tracing
TLDR
This work presents general techniques for building compiler independent tools similar to Hat based on program transformation and points out which features of Haskell 98 caused us particular grief. Expand
Practical typed lazy contracts
  • O. Chitil
  • Computer Science
  • ICFP '12
  • 9 September 2012
TLDR
This paper presents the design and implementation of a small, easy-to-use, purely functional contract library for Haskell, which, when a contract is violated, also provides more useful information than the classical blaming of one contract partner. Expand
Linear, bounded, functional pretty-printing
TLDR
An implementation that uses lazy evaluation to simulate two co-operating processes and higher-order functions for delimited continuations to simulate co-routines with explicit scheduling is presented. Expand
Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat
TLDR
It is a very undesirable situation that today’s software often contains errors; even the most advanced functional programmers are not infallible; they misunderstand the properties of their own programs, or those of others, and so commit errors. Expand
...
1
2
3
4
5
...