diff options
| author | Paul Buetow <paul@buetow.org> | 2023-04-07 00:49:19 +0300 |
|---|---|---|
| committer | Paul Buetow <paul@buetow.org> | 2023-04-07 00:49:19 +0300 |
| commit | 30fc4e8f74315a92aaec36dfb9a8d4efa0a21791 (patch) | |
| tree | 97ef2b26fd54a366d72f5289ba11ea311f8a0173 | |
| parent | 5c9e3886de0f9041e4a6fb6fea9917e29a8fbd76 (diff) | |
exact style
57 files changed, 4525 insertions, 2343 deletions
diff --git a/gemfeed/2008-06-26-perl-poetry.html b/gemfeed/2008-06-26-perl-poetry.html index 8548d656..635d0ac0 100644 --- a/gemfeed/2008-06-26-perl-poetry.html +++ b/gemfeed/2008-06-26-perl-poetry.html @@ -8,8 +8,10 @@ <link rel="stylesheet" href="style-override.css" /> </head> <body> -<h1>Perl Poetry</h1> -<p class="quote"><i>Published at 2008-06-26T21:43:51+01:00; Updated at 2021-05-04</i></p> +<h1 style='display: inline'>Perl Poetry</h1><br /> +<br /> +<span class=quote>Published at 2008-06-26T21:43:51+01:00; Updated at 2021-05-04</span><br /> +<br /> <pre> '\|/' * -- * ----- @@ -32,10 +34,15 @@ _~~|~/_|_|__/|~~~~~~~ | / ~~~~~ | | ~~~~~~~~ ~ ~ ~~~ _|| (_/ (___)_| |Nov291999 (__) (____) </pre> -<p>Here are some Perl Poems I wrote. They don't do anything useful when you run them, but they don't produce a compiler error either. They only exist for fun and demonstrate what you can do with Perl syntax.</p> -<p>Wikipedia: "Perl poetry is the practice of writing poems that can be compiled as legal Perl code, for example the piece known as Black Perl. Perl poetry is made possible by the large number of English words that are used in the Perl language. New poems are regularly submitted to the community at PerlMonks."</p> -<a class="textlink" href="https://en.wikipedia.org/wiki/Perl">https://en.wikipedia.org/wiki/Perl</a><br /> -<h2>math.pl</h2> +<br /> +<span>Here are some Perl Poems I wrote. They don't do anything useful when you run them, but they don't produce a compiler error either. They only exist for fun and demonstrate what you can do with Perl syntax.</span><br /> +<br /> +<span>Wikipedia: "Perl poetry is the practice of writing poems that can be compiled as legal Perl code, for example the piece known as Black Perl. Perl poetry is made possible by the large number of English words that are used in the Perl language. New poems are regularly submitted to the community at PerlMonks."</span><br /> +<br /> +<a class=textlink href='https://en.wikipedia.org/wiki/Perl'>https://en.wikipedia.org/wiki/Perl</a><br /> +<br /> +<h2 style='display: inline'>math.pl</h2><br /> +<br /> <pre> #!/usr/bin/perl @@ -77,7 +84,9 @@ home: //ig,'nore', time and sleep $very =~ s/tr/on/g; __END__ </pre> -<h2>christmas.pl</h2> +<br /> +<h2 style='display: inline'>christmas.pl</h2><br /> +<br /> <pre> #!/usr/bin/perl @@ -121,7 +130,9 @@ __END__ This is perl, v5.8.8 built for i386-freebsd-64int </pre> -<h2>shopping.pl</h2> +<br /> +<h2 style='display: inline'>shopping.pl</h2><br /> +<br /> <pre> #!/usr/bin/perl @@ -153,15 +164,22 @@ and sleep until unpack$ing, cool products(); __END__ This is perl, v5.8.8 built for i386-freebsd-64int </pre> -<h2>More...</h2> -<p>Did you like what you saw? Have a look at Codeberg to see my other poems too:</p> -<a class="textlink" href="https://codeberg.org/snonux/perl-poetry">https://codeberg.org/snonux/perl-poetry</a><br /> -<p>Other related posts are:</p> -<a class="textlink" href="./2022-05-27-perl-is-still-a-great-choice.html">2022-05-27 Perl is still a great choice</a><br /> -<a class="textlink" href="./2011-05-07-perl-daemon-service-framework.html">2011-05-07 Perl Daemon (Service Framework)</a><br /> -<a class="textlink" href="./2008-06-26-perl-poetry.html">2008-06-26 Perl Poetry (You are currently reading this)</a><br /> -<p>E-Mail your comments to hi@paul.cyou :-)</p> -<a class="textlink" href="../">Back to the main site</a><br /> +<br /> +<h2 style='display: inline'>More...</h2><br /> +<br /> +<span>Did you like what you saw? Have a look at Codeberg to see my other poems too:</span><br /> +<br /> +<a class=textlink href='https://codeberg.org/snonux/perl-poetry'>https://codeberg.org/snonux/perl-poetry</a><br /> +<br /> +<span>Other related posts are:</span><br /> +<br /> +<a class=textlink href='./2022-05-27-perl-is-still-a-great-choice.html'>2022-05-27 Perl is still a great choice</a><br /> +<a class=textlink href='./2011-05-07-perl-daemon-service-framework.html'>2011-05-07 Perl Daemon (Service Framework)</a><br /> +<a class=textlink href='./2008-06-26-perl-poetry.html'>2008-06-26 Perl Poetry (You are currently reading this)</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 /> <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> | diff --git a/gemfeed/2008-12-29-using-my-nokia-n95-for-fixing-my-mta.html b/gemfeed/2008-12-29-using-my-nokia-n95-for-fixing-my-mta.html index 88ed6062..a993fc98 100644 --- a/gemfeed/2008-12-29-using-my-nokia-n95-for-fixing-my-mta.html +++ b/gemfeed/2008-12-29-using-my-nokia-n95-for-fixing-my-mta.html @@ -8,8 +8,10 @@ <link rel="stylesheet" href="style-override.css" /> </head> <body> -<h1>Using my Nokia N95 for fixing my MTA</h1> -<p class="quote"><i>Published at 2008-12-29T09:10:41+00:00; Updated at 2021-12-01</i></p> +<h1 style='display: inline'>Using my Nokia N95 for fixing my MTA</h1><br /> +<br /> +<span class=quote>Published at 2008-12-29T09:10:41+00:00; Updated at 2021-12-01</span><br /> +<br /> <pre> _ @@ -26,20 +28,28 @@ _jgs_\|//_\\|///_\V/_\|//__ Art by Joan Stark </pre> -<p>The last week I was in Vidin, Bulgaria with no internet access and I had to fix my MTA (Postfix) at host.0.buetow.org which serves E-Mail for all my customers at P. B. Labs. Good, that I do not guarantee high availability on my web services (I've to do a full time job somewhere else too). </p> -<p>My first attempt to find an internet café, which was working during Christmastime, failed. However, I found with my N95 phone lots of free WLAN hotspots. The hotspots refused me logging into my server using SSH as I have configured a non-standard port for SSH for security reasons. Without knowing the costs, I used the GPRS internet access of my German phone provider (yes, I had to pay roaming fees). </p> -<a href="./2008-12-29-using-my-nokia-n95-for-fixing-my-mta/nokia-n95.jpg"><img alt="Picture of a Nokia N95" title="Picture of a Nokia N95" src="./2008-12-29-using-my-nokia-n95-for-fixing-my-mta/nokia-n95.jpg" /></a><br /> -<p>With Putty for N95 and configuring Postfix with Vim and the T9 input mechanism, I managed to fix the problem. But it took half of an hour:</p> +<br /> +<span>The last week I was in Vidin, Bulgaria with no internet access and I had to fix my MTA (Postfix) at host.0.buetow.org which serves E-Mail for all my customers at P. B. Labs. Good, that I do not guarantee high availability on my web services (I've to do a full time job somewhere else too). </span><br /> +<br /> +<span>My first attempt to find an internet café, which was working during Christmastime, failed. However, I found with my N95 phone lots of free WLAN hotspots. The hotspots refused me logging into my server using SSH as I have configured a non-standard port for SSH for security reasons. Without knowing the costs, I used the GPRS internet access of my German phone provider (yes, I had to pay roaming fees). </span><br /> +<br /> +<a href='./2008-12-29-using-my-nokia-n95-for-fixing-my-mta/nokia-n95.jpg'><img alt='Picture of a Nokia N95' title='Picture of a Nokia N95' src='./2008-12-29-using-my-nokia-n95-for-fixing-my-mta/nokia-n95.jpg' /></a><br /> +<br /> +<span>With Putty for N95 and configuring Postfix with Vim and the T9 input mechanism, I managed to fix the problem. But it took half of an hour:</span><br /> +<br /> <ul> <li>First, getting a shell prompt</li> <li>Second, use the "tail" command to analyse the Postfix logs</li> <li>Third, use the "sed" command to fix a syntax error in the Postfix config</li> <li>Fourth, restart Postfix</li> -</ul> -<p>It was a pain in the ass. My next mobile phone MUST have a full QWERTY keyboard. This would have made my life lots easier. :)</p> -<p>At the moment I am in Sofia, Bulgaria. Here I can use at least an unprotected WLAN hotspot which belongs to one of the neighbours which I don’t know in person, and it is not blocking any port at all :)</p> -<p>E-Mail your comments to hi@paul.cyou :-)</p> -<a class="textlink" href="../">Back to the main site</a><br /> +</ul><br /> +<span>It was a pain in the ass. My next mobile phone MUST have a full QWERTY keyboard. This would have made my life lots easier. :)</span><br /> +<br /> +<span>At the moment I am in Sofia, Bulgaria. Here I can use at least an unprotected WLAN hotspot which belongs to one of the neighbours which I don’t know in person, and it is not blocking any port at all :)</span><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 /> <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> | diff --git a/gemfeed/2010-04-09-standard-ml-and-haskell.html b/gemfeed/2010-04-09-standard-ml-and-haskell.html index 13f18715..dcad4602 100644 --- a/gemfeed/2010-04-09-standard-ml-and-haskell.html +++ b/gemfeed/2010-04-09-standard-ml-and-haskell.html @@ -8,20 +8,29 @@ <link rel="stylesheet" href="style-override.css" /> </head> <body> -<h1>Standard ML and Haskell</h1> -<p class="quote"><i>Published at 2010-04-09T22:57:36+01:00</i></p> -<p>I am currently looking into the functional programming language Standard ML (aka SML). The purpose is to refresh my functional programming skills and to learn something new too. Since I already knew a little Haskell, I could not help myself, and I also implemented the same exercises in Haskell.</p> -<p>As you will see, SML and Haskell are very similar (at least when it comes to the basics). However, the syntax of Haskell is a bit more "advanced". Haskell utilizes fewer keywords (e.g. no val, end, fun, fn ...). Haskell also allows to write down the function types explicitly. What I have been missing in SML so far is the so-called pattern guards. Although this is a very superficial comparison for now, so far, I like Haskell more than SML. Nevertheless, I thought it would be fun to demonstrate a few simple functions of both languages to show off the similarities. </p> -<p>Haskell is also a "pure functional" programming language, whereas SML also makes explicit use of imperative concepts. I am by far not a specialist in either of these languages, but here are a few functions implemented in both SML and Haskell:</p> -<h2>Defining a multi-data type</h2> -<p>Standard ML:</p> +<h1 style='display: inline'>Standard ML and Haskell</h1><br /> +<br /> +<span class=quote>Published at 2010-04-09T22:57:36+01:00</span><br /> +<br /> +<span>I am currently looking into the functional programming language Standard ML (aka SML). The purpose is to refresh my functional programming skills and to learn something new too. Since I already knew a little Haskell, I could not help myself, and I also implemented the same exercises in Haskell.</span><br /> +<br /> +<span>As you will see, SML and Haskell are very similar (at least when it comes to the basics). However, the syntax of Haskell is a bit more "advanced". Haskell utilizes fewer keywords (e.g. no val, end, fun, fn ...). Haskell also allows to write down the function types explicitly. What I have been missing in SML so far is the so-called pattern guards. Although this is a very superficial comparison for now, so far, I like Haskell more than SML. Nevertheless, I thought it would be fun to demonstrate a few simple functions of both languages to show off the similarities. </span><br /> +<br /> +<span>Haskell is also a "pure functional" programming language, whereas SML also makes explicit use of imperative concepts. I am by far not a specialist in either of these languages, but here are a few functions implemented in both SML and Haskell:</span><br /> +<br /> +<h2 style='display: inline'>Defining a multi-data type</h2><br /> +<br /> +<span>Standard ML:</span><br /> +<br /> <pre> datatype ’a multi = EMPTY | ELEM of ’a | UNION of ’a multi * ’a multi </pre> -<p>Haskell:</p> +<br /> +<span>Haskell:</span><br /> +<br /> <pre> data (Eq a) => Multi a = Empty @@ -29,8 +38,11 @@ data (Eq a) => Multi a | Union (Multi a) (Multi a) deriving Show </pre> -<h2>Processing a multi</h2> -<p>Standard ML:</p> +<br /> +<h2 style='display: inline'>Processing a multi</h2><br /> +<br /> +<span>Standard ML:</span><br /> +<br /> <pre> fun number (EMPTY) _ = 0 | number (ELEM x) w = if x = w then 1 else 0 @@ -39,7 +51,9 @@ fun test_number w = number (UNION (EMPTY, \ UNION (ELEM 4, UNION (ELEM 6, \ UNION (UNION (ELEM 4, ELEM 4), EMPTY))))) w </pre> -<p>Haskell:</p> +<br /> +<span>Haskell:</span><br /> +<br /> <pre> number Empty _ = 0 number (Elem x) w = if x == w then 1 else 0 @@ -47,8 +61,11 @@ test_number w = number (Union Empty \ (Union (Elem 4) (Union (Elem 6) \ (Union (Union (Elem 4) (Elem 4)) Empty)))) w </pre> -<h2>Simplify function</h2> -<p>Standard ML:</p> +<br /> +<h2 style='display: inline'>Simplify function</h2><br /> +<br /> +<span>Standard ML:</span><br /> +<br /> <pre> fun simplify (UNION (x,y)) = let fun is_empty (EMPTY) = true | is_empty _ = false @@ -64,7 +81,9 @@ fun simplify (UNION (x,y)) = end | simplify x = x </pre> -<p>Haskell:</p> +<br /> +<span>Haskell:</span><br /> +<br /> <pre> simplify (Union x y) | (isEmpty x’) && (isEmpty y’) = Empty @@ -78,8 +97,11 @@ simplify (Union x y) y’ = simplify y simplify x = x </pre> -<h2>Delete all</h2> -<p>Standard ML:</p> +<br /> +<h2 style='display: inline'>Delete all</h2><br /> +<br /> +<span>Standard ML:</span><br /> +<br /> <pre> fun delete_all m w = let fun delete_all’ (ELEM x) = if x = w then EMPTY else ELEM x @@ -88,7 +110,9 @@ fun delete_all m w = in simplify (delete_all’ m) end </pre> -<p>Haskell:</p> +<br /> +<span>Haskell:</span><br /> +<br /> <pre> delete_all m w = simplify (delete_all’ m) where @@ -96,8 +120,11 @@ delete_all m w = simplify (delete_all’ m) delete_all’ (Union x y) = Union (delete_all’ x) (delete_all’ y) delete_all’ x = x </pre> -<h2>Delete one</h2> -<p>Standard ML:</p> +<br /> +<h2 style='display: inline'>Delete one</h2><br /> +<br /> +<span>Standard ML:</span><br /> +<br /> <pre> fun delete_one m w = let fun delete_one’ (UNION (x,y)) = @@ -115,7 +142,9 @@ fun delete_one m w = in simplify m’ end </pre> -<p>Haskell:</p> +<br /> +<span>Haskell:</span><br /> +<br /> <pre> delete_one m w = do let (m’, _) = delete_one’ m @@ -131,8 +160,11 @@ delete_one m w = do if x == w then (Empty, True) else (Elem x, False) delete_one’ x = (x, False) </pre> -<h2>Higher-order functions</h2> -<p>The first line is always the SML code, the second line the Haskell variant:</p> +<br /> +<h2 style='display: inline'>Higher-order functions</h2><br /> +<br /> +<span>The first line is always the SML code, the second line the Haskell variant:</span><br /> +<br /> <pre> fun make_map_fn f1 = fn (x,y) => f1 x :: y make_map_fn f1 = \x y -> f1 x : y @@ -146,8 +178,10 @@ my_map f l = foldr (make_map_fn f) [] l fun my_filter f l = foldr (make_filter_fn f) [] l my_filter f l = foldr (make_filter_fn f) [] l </pre> -<p>E-Mail your comments to hi@paul.cyou :-)</p> -<a class="textlink" href="../">Back to the main site</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 /> <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> | 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 4a98a243..0d56577d 100644 --- a/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html +++ b/gemfeed/2010-05-07-lazy-evaluation-with-standarn-ml.html @@ -8,8 +8,10 @@ <link rel="stylesheet" href="style-override.css" /> </head> <body> -<h1>Lazy Evaluation with Standard ML</h1> -<p class="quote"><i>Published at 2010-05-07T08:17:59+01:00</i></p> +<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 /> +<br /> <pre> _____|~~\_____ _____________ @@ -22,12 +24,19 @@ `---------------'--\\\\ .`--' -Glyde- `|||| </pre> -<p>In contrast to Haskell, Standard SML does not use lazy evaluation by default but an eager evaluation. </p> -<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 /> -<p>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.</p> -<h2>Emulating lazy evaluation in SML</h2> -<p>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):</p> +<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 /> +<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 /> +<br /> +<h2 style='display: inline'>Emulating lazy evaluation in SML</h2><br /> +<br /> +<span>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):</span><br /> +<br /> <pre> type ’a lazy = unit -> ’a; @@ -67,9 +76,13 @@ fun nat_pairs_not_null () = val test = first 10 (nat_pairs_not_null ()); *) </pre> -<a class="textlink" href="http://smlnj.org/">http://smlnj.org/</a><br /> -<h2>Real laziness with Haskell </h2> -<p>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. </p> +<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 /> +<span>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. </span><br /> +<br /> <pre> {- Just to make it look like the ML example -} first = take @@ -91,9 +104,12 @@ nat_pairs_not_null = filters (\[x,y] -> x > 0 && y > 0) nat_pai first 10 nat_pairs_not_null -} </pre> -<a class="textlink" href="http://www.haskell.org/">http://www.haskell.org/</a><br /> -<p>E-Mail your comments to hi@paul.cyou :-)</p> -<a class="textlink" href="../">Back to the main site</a><br /> +<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 /> <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> | diff --git a/gemfeed/ |