scientific article; zbMATH DE number 3885293

From MaRDI portal
Publication:3219095





[For the entire collection see Zbl 0505.00021.] Linked trees were introduced to describe the computational semantics of programming languages. A linked tree is a tree with additional edges, called pointers. A linked forest is a set of trees with pointers between them. The authors give an algebraically oriented formal definition of linked forest manipulation systems and a description of their application to computational semantics. A linked forest manipulation system consists of operations on trees and forests such as concatenation, superposition, skeleton operation and substructure replacement. An ALGOL-like language and the \(\lambda\)-calculus are used as examples.











This page was built for publication:

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