The term graph programming system HOPS

MaRDI QIDQ4934535zbMATH OpenFDO

Authors Wolfram Kahl

Publication date 17 February 2002

zbMATH Keywords

higher object programming systemHOPS

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• Graph matching in operational semantics and typing
• Compositional explanation of types and algorithmic debugging of type errors
• The Graph Programming Language GP
• A flexible categorial formalisation of term graphs as directed hypergraphs
• Hoare-style verification of graph programs

Cited in

(4)

• Towards ``mouldable code via nested code graph transformation
• Gunther Schmidt's life as a mathematician and computer scientist
• A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA).
• Correcting type errors in the Curry system

This page was built for publication: The term graph programming system HOPS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934535)