| Display title | Graph reduction |
| Default sort key | Graph reduction |
| Page length (in bytes) | 4,683 |
| Namespace ID | 0 |
| Page ID | 234486 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Dennis Ross |
| Date of page creation | 02:30, 1 August 2022 |
| Latest editor | imported>Dennis Ross |
| Date of latest edit | 02:30, 1 August 2022 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computer science, graph reduction implements an efficient version of non-strict evaluation, an evaluation strategy where the arguments to a function are not immediately evaluated. This form of non-strict evaluation is also known as lazy evaluation and used in functional programming languages. The... |
