<blocksapp="Snap! 6, https://snap.berkeley.edu"version="1"><block-definitions="%'head' in front of stream %'tail'"type="reporter"category="lists"><commentw="418.6106770833333"collapsed="false">The stream version of IN FRONT OF.

Streams, also called lazy lists, are like lists except that
items are not computed until they're needed. This allows
for more efficient handling of large computed lists, and
even infinite lists. The only piece of magic is here in 
IN FRONT OF STREAM, whose second input is of type 
Unevaluated, which means that it's a procedure, with 
a sort of invisible gray ring. So HEAD OF STREAM is just 
ITEM 1 OF, but TAIL OF STREAM has a CALL block 
to make the computation happen.

For a tutorial introduction to streams, read SICP 3.5:
https://mitpress.mit.edu/sites/default/files/sicp/full-text/book/book-Z-H-24.html#%_sec_3.5
or Brian's lecture notes (start on page 74):
https://people.eecs.berkeley.edu/~bh/61a-pages/Volume2/notes.pdf
The above are clickable links!</comment><header></header><code></code><translations>pt:a prefixação de _ ao canal _
</translations><inputs><inputtype="%s"></input><inputtype="%anyUE"></input></inputs><script><blocks="doReport"><blocks="reportNewList"><list><blockvar="head"/><blockvar="tail"/><blocks="reportBoolean"><l><bool>false</bool></l></block><blocks="reportBoolean"><l><bool>false</bool></l></block></list></block></block></script></block-definition><block-definitions="head of stream %'stream'"type="reporter"category="lists"><commentw="418.6106770833333"collapsed="false">The stream version of ITEM 1 OF.

Streams, also called lazy lists, are like lists except that
items are not computed until they're needed. This allows
for more efficient handling of large computed lists, and
even infinite lists. The only piece of magic is in 
IN FRONT OF STREAM, whose second input is of type 
Unevaluated, which means that it's a procedure, with 
a sort of invisible gray ring. So HEAD OF STREAM is just 
ITEM 1 OF, but TAIL OF STREAM has a CALL block 
to make the computation happen.

For a tutorial introduction to streams, read SICP 3.5:
https://mitpress.mit.edu/sites/default/files/sicp/full-text/book/book-Z-H-24.html#%_sec_3.5
or Brian's lecture notes (start on page 74):
https://people.eecs.berkeley.edu/~bh/61a-pages/Volume2/notes.pdf
The above are clickable links!</comment><header></header><code></code><translations>pt:o primeiro item do canal _
</translations><inputs><inputtype="%l"></input></inputs><script><blocks="doReport"><blocks="reportListItem"><l>1</l><blockvar="stream"/></block></block></script></block-definition><block-definitions="tail of stream %'stream'"type="reporter"category="lists"><commentw="418.6106770833333"collapsed="false">The stream version of ALL BUT FIRST OF.

Streams, also called lazy lists, are like lists except that
items are not computed until they're needed. This allows
for more efficient handling of large computed lists, and
even infinite lists. The only piece of magic is in 
IN FRONT OF STREAM, whose second input is of type 
Unevaluated, which means that it's a procedure, with 
a sort of invisible gray ring. So HEAD OF STREAM is just 
ITEM 1 OF, but TAIL OF STREAM has a CALL block 
to make the computation happen.

For a tutorial introduction to streams, read SICP 3.5:
https://mitpress.mit.edu/sites/default/files/sicp/full-text/book/book-Z-H-24.html#%_sec_3.5
or Brian's lecture notes (start on page 74):
https://people.eecs.berkeley.edu/~bh/61a-pages/Volume2/notes.pdf
The above are clickable links!</comment><header></header><code></code><translations>pt:um canal com todos os itens de _ menos o primeiro
</translations><inputs><inputtype="%l"></input></inputs><script><blocks="doWarp"><script><blocks="doIf"><blocks="reportList
