Graph reduction
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 technique was first developed by in 1971.
Wikipage disambiguates
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Graph reduction
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 technique was first developed by in 1971.
has abstract
En informática, la reducción d ...... a por primera vez por en 1971.
@es
In computer science, graph red ...... as first developed by in 1971.
@en
Στην επιστήμη υπολογιστών, η α ...... ό τον Chris Wadsworth το 1971.
@el
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,000,197,025
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
En informática, la reducción d ...... a por primera vez por en 1971.
@es
In computer science, graph red ...... as first developed by in 1971.
@en
Στην επιστήμη υπολογιστών, η α ...... ό τον Chris Wadsworth το 1971.
@el
label
Graph reduction
@en
Reducción de grafos
@es
Αναγωγή γράφου
@el