pp. 136-149 in
Rudolf Berghammer, Yassine Lakhnech (eds.)
Tool Support for System Specification, Development and Verification, Advances in Computing Science, Springer-Verlag Vienna,
ISBN 3-211-83282-3, March 1999.
(.bib, .ps.gz, .pdf)
Programmers of Haskell or ML know that once their programs are syntactically correct and get past the type checker, the probability that they are correct is usually already pretty high. But while the parser or the type checker still complain, it is not always easy to spot the real problem, which may be far from the trouble spot indicated by the often cryptic error message.
Syntax-directed editing can solve the problem with syntax errors. But, even if a syntax-directed editor would be extended with online typing, another problem would be how to present the typing information to the user; huge type expressions with unclear relation to the program expression may perhaps be of only very little help.
We present a system that deals with both problems by making the program structure and the program's typing structure explicit and interactively accessible in the shape of term graphs. The design of this system relies on recent advances in the theories of untyped and typed second-order term graphs.
The Higher Object Programming System HOPS, which has been developed by a group led by Gunther Schmidt since the mid-eighties, is a graphically interactive term graph programming system designed for transformational program development.
In HOPS, only syntactically correct and well-typed programs can be constructed. The choice of the language is only constrained by certain restrictions of the term graph formalism and of the typing system. An important ingredient of HOPS is the transformation support; this favours referentially transparent languages -- for this reason most of our examples use a language close to typed λ-calculi and Haskell. HOPS is intended as:
The current version (available via WWW) features several significant improvements over earlier prototypes:
Also refer to the HOPS home page.