diff options
| author | Paul Buetow <paul@buetow.org> | 2023-04-08 12:32:25 +0300 |
|---|---|---|
| committer | Paul Buetow <paul@buetow.org> | 2023-04-08 12:32:25 +0300 |
| commit | 89f83d49ad7d4cd8baa815993d3172ca72e5b30e (patch) | |
| tree | f91acfa483e4ef3a0632af7f0f91d8b45cc9d76d /gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html | |
| parent | d0098c5faf74b0b3291395114b99bc5c309718b3 (diff) | |
Update content for html
Diffstat (limited to 'gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html')
| -rw-r--r-- | gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html b/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html index 0d56577d..bfb83d94 100644 --- a/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html +++ b/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html @@ -10,7 +10,7 @@ <body> <h1 style='display: inline'>Lazy Evaluation with Standard ML</h1><br /> <br /> -<span class=quote>Published at 2010-05-07T08:17:59+01:00</span><br /> +<span class='quote'>Published at 2010-05-07T08:17:59+01:00</span><br /> <br /> <pre> @@ -27,8 +27,8 @@ <br /> <span>In contrast to Haskell, Standard SML does not use lazy evaluation by default but an eager evaluation. </span><br /> <br /> -<a class=textlink href='https://en.wikipedia.org/wiki/Eager_evaluation'>https://en.wikipedia.org/wiki/Eager_evaluation</a><br /> -<a class=textlink href='https://en.wikipedia.org/wiki/Lazy_evaluation'>https://en.wikipedia.org/wiki/Lazy_evaluation</a><br /> +<a class='textlink' href='https://en.wikipedia.org/wiki/Eager_evaluation'>https://en.wikipedia.org/wiki/Eager_evaluation</a><br /> +<a class='textlink' href='https://en.wikipedia.org/wiki/Lazy_evaluation'>https://en.wikipedia.org/wiki/Lazy_evaluation</a><br /> <br /> <br /> <span>You can solve specific problems with lazy evaluation easier than with eager evaluation. For example, you might want to list the number Pi or another infinite list of something. With the help of lazy evaluation, each element of the list is calculated when it is accessed first, but not earlier.</span><br /> @@ -77,7 +77,7 @@ val test = first 10 (nat_pairs_not_null ()); *) </pre> <br /> -<a class=textlink href='http://smlnj.org/'>http://smlnj.org/</a><br /> +<a class='textlink' href='http://smlnj.org/'>http://smlnj.org/</a><br /> <br /> <h2 style='display: inline'>Real laziness with Haskell </h2><br /> <br /> @@ -105,11 +105,11 @@ first 10 nat_pairs_not_null -} </pre> <br /> -<a class=textlink href='http://www.haskell.org/'>http://www.haskell.org/</a><br /> +<a class='textlink' href='http://www.haskell.org/'>http://www.haskell.org/</a><br /> <br /> <span>E-Mail your comments to hi@paul.cyou :-)</span><br /> <br /> -<a class=textlink href='../'>Back to the main site</a><br /> +<a class='textlink' href='../'>Back to the main site</a><br /> <p class="footer"> Generated with <a href="https://codeberg.org/snonux/gemtexter">Gemtexter</a> | served by <a href="https://www.OpenBSD.org">OpenBSD</a>/<a href="https://man.openbsd.org/httpd.8">httpd(8)</a> | |