4 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.LO2019★ 1 cited
Semantics-Preserving DPO-Based Term Graph Rewriting
Wolfram Kahl, Yuhang Zhao
Term graph rewriting is important as "conceptual implementation" of the execution of functional programs, and of data-flow optimisations in compilers. One way to define term graph…
cs.PL2015★ 1 cited
A Simple Parallel Implementation of Interaction Nets in Haskell
Wolfram Kahl
Due to their "inherent parallelism", interaction nets have since their introduction been considered as an attractive implementation mechanism for functional programming. We show th…
cs.LO2011★ 4 cited
Dependently-Typed Formalisation of Typed Term Graphs
Wolfram Kahl
We employ the dependently-typed programming language Agda2 to explore formalisation of untyped and typed term graphs directly as set-based graph structures, via the gs-monoidal cat…