Computation on graph-like expressions (Q1134513)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Computation on graph-like expressions	scientific article

Statements

scholarly article

0 references

Computation on graph-like expressions (English)

0 references

0 references

Theoretical Computer Science

0 references

publication date

1980

0 references

zbMATH Keywords

efficient evaluations of expressions

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0304-3975(80)90013-4

0 references

Can programming be liberated from the von Neumann style?

0 references

0 references

0 references

Aspects of Applicative Programming for Parallel Processing

0 references

0 references

0 references

0 references

Dynamics of discrete systems and pattern reproduction

0 references

A class of replacement systems with simple optimality theory

0 references

0 references

Optimal evaluations of graph-like expressions

0 references

Speeding up subtree replacement systems

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0304-3975(80)90013-4

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1134513

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1134513&oldid=34635360"