Parallel graph rewriting on loosely coupled machine architectures (Q5881294): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-54317-1_104 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1534969854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General PASCAL Program for Map Overlay of Quadtrees and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set of postulates for the foundation of logic. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780426 / rank
 
Normal rank

Latest revision as of 15:51, 31 July 2024

scientific article; zbMATH DE number 7661662
Language Label Description Also known as
English
Parallel graph rewriting on loosely coupled machine architectures
scientific article; zbMATH DE number 7661662

    Statements

    Parallel graph rewriting on loosely coupled machine architectures (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2023
    0 references
    normal form
    0 references
    expressive power
    0 references
    reduction order
    0 references
    functional language
    0 references
    functional graph
    0 references

    Identifiers