One of the attendants at German.pm online meeting yesterday pointed to these blogposts of MJ Dominus somehow complaining that Perl is too "clumsy" to reimplement a Haskell solution based on monads

see

• https://blog.plover.com/prog/haskell/monad-search.html
• https://blog.plover.com/prog/monad-search-2.html

Basically you have a nice linearized syntax implementing nested loops to find the solution for a number riddle

Let's say for concreteness that we would like to solve this cryptarithm puzzle:

    S E N D
+   M O R E
-----------
  M O N E Y
[download]

This means that we want to map the letters S, E, N, D, M, O, R, Y to distinct digits 0 through 9 to produce a five-digit and two four-digit numerals which, when added in the indicated way, produce the indicated sum.

the proposed Perl code was actually the semantic translation of some Python code and was indeed clumsy (NB all those curlies at the end)

Now here my solution reusing some work I've done in the past with List Comprehensions

use strict;
use warnings;
use Data::Dump qw/pp dd/;




=pod

https://blog.plover.com/prog/haskell/monad-search.html

https://blog.plover.com/prog/monad-search-2.html

=cut


# --- List comprehension

sub from (&$;$) {
    my ($c_block, undef, $c_tail) = @_;
    my $var = \$_[1];
    sub {
        for ( &$c_block ) {
            $$var = $_;
            $c_tail->()
        }
      }
}

sub when (&$){                          # guard
    my ($c_block, $c_tail) = @_;

    sub { $c_tail->() if &$c_block }
}


# --- rem() Helper function to return digits 0..9 except @_
my %digits;
@digits{0..9}=();

sub rem {                               # set difference
    my %h = %digits;
    delete @h{@_};
    keys %h;
}


my ($send,$s,$e,$n,$d);
my ($more,$m,$o,$r);
my ($money,$y);



my $do =
  # send
  from { rem 0 } $s =>
  from { rem $s } $e =>
  from { rem $s, $e } $n =>
  from { rem $s,$e,$n } $d =>

  # more
  from { rem 0,$s,$e,$n,$d } $m =>
  from { rem $s,$e,$n,$d,$m } $o =>
  from { rem $s,$e,$n,$d,$m,$o } $r =>

  # money
  from { rem $s,$e,$n,$d,$m,$o,$r } $y =>

  # guard
  when { "$s$e$n$d" + "$m$o$r$e" == "$m$o$n$e$y" }

  # output
  sub { pp [ "$s$e$n$d" , "$m$o$r$e" , "$m$o$n$e$y" ] }
  ;

&$do;
[download]

Compilation started at Wed Dec  2 19:11:14

C:/Perl_524/bin\perl.exe -w d:/tmp/pm/send_more_money_monad.pl 
[9567, 1085, 10652]

Compilation finished at Wed Dec  2 19:11:18
[download]

NB: It could be done better and faster, I've just coded this POC from scratch within an hour.

Please note that making it "lazy" is not really a problem, left for the interested reader.

So Monads in Perl are not that complicated ... or what am I missing? ;-)

---

---

Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!

Titles consisting of a single word are discouraged, and in most cases are disallowed outright.

Read Where should I post X? if you're not absolutely sure you're posting in the right place.

Please read these before you post! —

• How do I compose an effective node title?
• How do I post a question effectively?
• Markup in the Monastery

Posts may use any of the Perl Monks Approved HTML tags:

a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr

You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)

	For:		Use:
	&		&
	<		&lt;
	>		&gt;
	[		&#91;
	]		&#93;

Link using PerlMonks shortcuts! What shortcuts can I use for linking?

See Writeup Formatting Tips and other pages linked from there for more info.