论文信息 - The Term Graph Programming System HOPS

The Term Graph Programming System HOPS

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.

Wolfram Kahl

[1] Vincent van Oostrom,et al. Combinatory Reduction Systems: Introduction and Survey , 1993, Theor. Comput. Sci..

[2] Gianluigi Bellin,et al. On the pi-Calculus and Linear Logic , 1992, Theor. Comput. Sci..

[3] Jan Willem Klop,et al. Combinatory reduction systems , 1980 .

[4] Wolfram Kahl,et al. Algebraische Termgraphersetzung mit gebundenen Variablen , 1996, Informatik.

[5] Wolfram Kahl,et al. Relational Treatment of Term Graphs With Bound Variables , 1998, Log. J. IGPL.

[6] Ross N. Williams,et al. FunnelWeb User's Manual , 1992 .

[7] Wolfram Kahl. Can Functional Programming Be Liberated from the Applicative Style? , 1994, IFIP Congress.

[8] Donald E. Knuth,et al. Literate Programming , 1984, Comput. J..

[9] Wolfram Kahl. The Higher Object Programming System - User Manual for HOPS , 1998 .

[10] Gunther Schmidt,et al. An Interactive Graphical Manipulation System for Higher Objects Based on Relational Algebra , 1986 .

[11] Wolfram Kahl. Interally Typed Second-Order Term Graphs , 1998, WG.

[12] Emden R. Gansner,et al. A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[13] R. Milner. Mathematical Centre Tracts , 1976 .

[14] Robin Milner,et al. The Polyadic π-Calculus: a Tutorial , 1993 .