No label defined (Q3219095)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3885293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3885293 |
Statements
1981
0 references
Linked trees
0 references
computational semantics of programming languages
0 references
linked forest
0 references
0.7600851058959961
0 references
0.7002729773521423
0 references
0.6978574991226196
0 references
[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.
0 references