A Reference Interpreter for the Graph Programming Language GP 2
Christopher Bak, Glyn Faulkner, Detlef Plump, Colin Runciman
TL;DR
This paper presents a simple, functional Haskell-based reference interpreter for GP 2, an experimental graph transformation language, demonstrating sufficient performance for testing and development purposes.
Contribution
It introduces a concise, structured reference implementation of GP 2 in Haskell, facilitating further development and comparative testing.
Findings
Interpreter performance is adequate for testing various programs.
The implementation serves as a foundation for more advanced interpreters.
The approach simplifies understanding and developing GP 2 implementations.
Abstract
GP 2 is an experimental programming language for computing by graph transformation. An initial interpreter for GP 2, written in the functional language Haskell, provides a concise and simply structured reference implementation. Despite its simplicity, the performance of the interpreter is sufficient for the comparative investigation of a range of test programs. It also provides a platform for the development of more sophisticated implementations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.