From 152643ce366c08e43268abd9a922329339dfce5a Mon Sep 17 00:00:00 2001 From: Paul Buetow Date: Thu, 20 May 2021 08:31:19 +0100 Subject: Publishing new version --- gemfeed/atom.xml | 102 ++++++++++++++++++++++++++++++++++++++++++++++++++++++- 1 file changed, 101 insertions(+), 1 deletion(-) (limited to 'gemfeed/atom.xml') diff --git a/gemfeed/atom.xml b/gemfeed/atom.xml index 8bad3304..8751b47a 100644 --- a/gemfeed/atom.xml +++ b/gemfeed/atom.xml @@ -1,6 +1,6 @@ - 2021-05-19T22:03:14+01:00 + 2021-05-20T08:26:57+01:00 buetow.org feed Having fun with computers! @@ -2192,6 +2192,106 @@ BB

May the source be with you

You can find all of this on the GitHub page. There is also an "examples" folders containing some Fype scripts!

https://github.com/snonux/fype
+

E-Mail me your thoughts at comments@mx.buetow.org!

+ + + + + Lazy Evaluation with Standard ML + + https://buetow.org/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html + 2010-05-07T08:17:59+01:00 + + Paul Buetow + comments@mx.buetow.org + + In contrast to Haskell, Standard SML does not use lazy evaluation by default, but strict evaluation. . .....to read on please visit my site. + +
+

Lazy Evaluation with Standard ML

+
+
+      _____|~~\_____      _____________
+  _-~               \    |    \
+  _-    | )     \    |__/   \   \
+  _-         )   |   |  |     \  \
+  _-    | )     /    |--|      |  |
+ __-_______________ /__/_______|  |_________
+(                |----         |  |
+ `---------------'--\\\\      .`--'          -Glyde-
+                              `||||
+
+

Written by Paul Buetow 2010-05-07

+

In contrast to Haskell, Standard SML does not use lazy evaluation by default, but eager evaluation.

+https://en.wikipedia.org/wiki/Eager_evaluation
+https://en.wikipedia.org/wiki/Lazy_evaluation
+

You can solve certain 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.

+

Emulating lazy evaluation in SML

+

However, it is possible to emulate lazy evaluation in most eager evaluation languages. This is how it is done with Standard ML (with some play with an infinite list of natural number tuples filtering out 0 elements):

+
+type ’a lazy = unit -> ’a;
+
+fun force (f:’a lazy) = f ();
+fun delay x = (fn () => x) : ’a lazy;
+
+datatype ’a sequ = NIL | CONS of ’a * ’a sequ lazy;
+
+fun first 0 s = []
+  | first n NIL = []
+  | first n (CONS (i,r)) = i :: first (n-1) (force r);
+
+fun filters p NIL = NIL
+  | filters p (CONS (x,r)) =
+      if p x
+          then CONS (x, fn () => filters p (force r))
+      else
+          filters p (force r);
+
+fun nat_pairs () =
+    let
+        fun from_pair (x,0) =
+              CONS ((x,0), fn () => from_pair (0,x+1))
+          | from_pair (up,dn) =
+              CONS ((up,dn), fn () => from_pair (up+1,dn-1))
+        in from_pair (0,0)
+    end;
+
+(* Test
+val test = first 10 (nat_pairs ())
+*)
+
+fun nat_pairs_not_null () =
+    filters (fn (x,y) => x > 0 andalso y > 0) (nat_pairs ());
+
+(* Test
+val test = first 10 (nat_pairs_not_null ());
+*)
+
+http://smlnj.org/
+

Real laziness with Haskell

+

As Haskell already uses lazy evaluation by default, there is no need to construct a new data type. Lists in Haskell are lazy by default. You will notice that the code is also much shorter and easier to understand than the SML version because of that.

+
+{- Just to make it look like the ML example -}
+first = take
+filters = filter
+
+{- Implementation -}
+nat_pairs = from_pair 0 0
+    where
+        from_pair x 0 = [x,0] : from_pair 0 (x+1)
+        from_pair up dn = [up,dn] : from_pair (up+1) (dn-1)
+
+{- Test:
+first 10 nat_pairs
+-}
+
+nat_pairs_not_null = filters (\[x,y] -> x > 0 && y > 0) nat_pairs
+
+{- Test:
+first 10 nat_pairs_not_null
+-}
+
+http://www.haskell.org/

E-Mail me your thoughts at comments@mx.buetow.org!

 -- cgit v1.2.3