Skip to main content
SpringerLink
Log in

The Term Graph Programming System HOPS

  • Conference paper
Tool Support for System Specification, Development and Verification

Part of the book series: Advances in Computing Science ((ACS))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bayer, A., Grobauer, B., Kahl, W., Kempf, P., Schmalhofer, F., Schmidt, G., Winter, M. (1996): The Higher-Object Programming System “HOPS”Internal Report, Fakultät für Informatik, Universität der Bundeswehr München. URL http://inf2-www.informatik.unibw-muenchen.de/HOPS/papers/HOPSreport-1996.html. 214 pp.

  • Bellin, G., Scott, P.J. (1994): On the it-calculus and linear logic. Theoretical Computer Science 135 (1), 11–63.

    Article  MathSciNet  MATH  Google Scholar 

  • Gansner, E.R., Koutsofios, E., North, S.C., Vo, K. (1993): A Technique for Drawing Directed Graphs. IEEE-TSE.

    Google Scholar 

  • Kahl, W. (1994): Can Functional Programming Be Liberated from the Applicative Style?. In Bjorn Pehrson, Imre Simon (eds.), Technology and Foundations, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August – 2 September 1994, Volume I, pages 330–335. IFIP Transactions. North-Holland. IFIP.

    Google Scholar 

  • Kahl, W. (1996): Algebraische Termgraphersetzung mit gebundenen Variablen.Reihe Informatik. Herbert Utz Verlag, München. ISBN 3–931327–60–4, zugleich Dissertation an der Fakultät für Informatik, Universität der Bundeswehr München.

    Google Scholar 

  • Kahl, W. (1998): The Higher Object Programming System — User Manual for HOPS, Fakultät für Informatik, Universität der Bundeswehr München. URL http://diogenes.informatik.unibw-muenchen.de:8080/kahl/HOPS/.

    Google Scholar 

  • Kahl, W. (1998): Internally Typed Second-Order Term Graphs. In Juraj Hromkovic, Ondrej Sykora (eds.), Graph Theoretic Concepts in Computer Science, 24th International Workshop, WG ‘88, Smolenice Castle, Slovak Republic, June 1998, Proceedings, pages 149–163. LNCS 1517. Springer-Verlag.

    Google Scholar 

  • Kingston, J.H. (1998): A User’s Guide to the Lout Document Formatting System (Version 3.12). Basser Department of Computer Science, University of Sydney. ISBN 0 86758 951 5. URL ftp://ftp.es.su.oz.au/jeff/lout.

    Google Scholar 

  • Klop, J.W. (1980): Combinatory Reduction Systems. Mathematical Centre Tracts 127, Centre for Mathematics and Computer Science, Amsterdam. PhD Thesis

    Google Scholar 

  • Klop, J.W., van Oostrom, V., van Raamsdonk, F. (1993): Combinatory reduction systems: introduction and survey. Theoretical Computer Science 121 (1–2), 279–308.

    Article  MathSciNet  MATH  Google Scholar 

  • Knuth, D.E. (1984): Literate Programming. The Computer Journal 27 (2), 97–111.

    Article  MATH  Google Scholar 

  • Milner, R. (1993): The Polyadic’n-Calculus: A Tutorial. In F. L. Bauer, W. Brauer, H. Schwichtenberg (eds.), Logic, Algebra, and Specification, pages 203–246. Vol. 94 of NATO Series F: Computer and Systems Sciences. Springer.

    Google Scholar 

  • Orava, F., Parrow, J. (1992): An Algebraic Verification of a Mobile Telephone Network. Formal Aspects of Computer Science 4, 497–543.

    Article  MATH  Google Scholar 

  • Williams, R.N. (1992): FunnelWeb User’s Manual.URL http://www.ross.net/funnelweb/introduction.html. Part of the FunnelWeb distribution

    Google Scholar 

  • Zierer, H., Schmidt, G., Berghammer, R. (1986): An Interactive Graphical Manipulation System for Higher Objects Based on Relational Algebra. In Proc. 12th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 68–81. LNCS 246. Springer-Verlag, Bernried, Starnberger See.

    Google Scholar 

Download references

Authors
  1. Wolfram Kahl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Universität Kiel, Federal Republic of Germany

    Rudolf Berghammer  & Yassine Lakhnech  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Wien

About this paper

Cite this paper

Kahl, W. (1999). The Term Graph Programming System HOPS. In: Berghammer, R., Lakhnech, Y. (eds) Tool Support for System Specification, Development and Verification. Advances in Computing Science. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6355-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6355-9_10

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83282-0

  • Online ISBN: 978-3-7091-6355-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation