2021/03/02 by Jin Sano, Sano, Jin · 1 citation
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Model-Driven Software Engineering Techniques #Programming Languages (cs.PL) #Semantic Web and Ontologies
paper · pdf · doi:10.48550/arxiv.2103.14698
openalex publication_date 2021/03/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Since language processing systems generally allocate/discard memory with complex reference relationships, including circular and indirect references, their implementation is often not trivial. Here, the allocated memory and the references can be abstracted to the labeled vertices and edges of a graph. And there exists a graph rewriting language, a programming language or a calculation model that can handle graph intuitively, safely and efficiently. Therefore, the implementation of a language processing system can be highly expected as an application field of graph rewriting language. To show this, in this research, we implemented G-machine, the virtual machine for lazy evaluation, in hypergraph rewriting language, HyperLMNtal.