erministic logic program is very similar to a functional program.
--
Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
iminated all
the non-determinism from a logic program what you have left is a
functional program. The work I was involved with, trying to get
quasi-real-time performance from Prolog, bore this out.
--
Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@has
On Fri, 2007-12-28 at 20:23 -0700, Luke Palmer wrote:
. . .
> OO is orthogonal to functional. Erlang is pure functional, Lisp is a
> bastard child...
Give it its historical due, please -- bastard grandsire at least.
-- Bill Wood
___
Haskel
eveloping a DSL, one
reason being it's macro system. However, it has also long been realized
that DSLs implemented with macros can be extremely difficult to debug
because by the time bugs manifest the (macro) source is long gone and
its connection to the expansion text is difficult to determ
a
> heap has "Fibonacci" the name in its name.
>
> Just a nit, but I thought it worth mentioning. =]
That's fair, and Cormen et. al. said pretty much the same thing in Chap.
20. I think the argument is that the Fibonacci sequence is important to
*understanding* th
rd Stein, Introduction to Algorithms, second edition, The MIT
Press (2001).
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
as it's not purely imaginary...
This is becoming surreal.
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
passes the advantages of strong typing, so this is most
> likely a dumb idea...
You might find Forth interesting/entertaining. After implementing
versions of Dijkstra's guarded if and do constructs using the same
mechanisms that were used to implement the "native" control struct
was up to the challenge; the response was a candid "probably not".
I still sometimes think it might have worked, but the risks would have
been horrendous.
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ly quick, too -- 50 sudokus in ca. 0.1 sec. (I did a Project
Euler problem that required solving 50 sudokus with ECLiPSe).
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Mon, 2007-09-03 at 07:43 +0800, Hugh Perkins wrote:
> On 9/3/07, Derek Elkins <[EMAIL PROTECTED]> wrote:
> > Because no one has said it quite this way:
> > The modern equivalent of Prolog is Prolog.
I was just about to say the same thing :-); thanks, Derek.
. . .
> (btw, just thought, when
ten my own Sudoku solver on
OCaml a year or so ago.
To Jerzy's point -- I strongly believe that learning a language like
Prolog is a good idea for two reasons -- first, it adds another tool to
the programmer's toolkit, and second, it enlarges the programmer's view
"a tensor is something that transforms like a tensor does!".
>
> Grrr...must...hold...my...tongue...
Dan, as a former student of a clone of that physics teacher, I am really
interested in what you will say when you fail to hold your tongue.
-- Bill Wood
___
we gotta have a theory, I'll go with this one!
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
onditionalQ but not P e
As you can see from the table, Tautology and Inconsistency are rarely if
ever used as connectives.
I checked these in Carol Horn Greenstein, _Dictionary of Logical Terms
and Symbols_, Van Nostrand Reinhold Company, 1978.
-- Bill Wood
rule is enabled, it's actions
> may be selected to execute atomically. In contrast to Verilog
> "always" blocks, multiple rules can write to the same state element.
Just curious, how does this relate to Guryevitch's Evo
while there are more suds.
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ral
knowledge. A common view was that the two sorts of knowledge
complemented each other, and corresponded in a natural way to intuitions
(and some epistemological theory) about human reasoning.
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
character sequences?
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
oving non-determinism it moves towards a
functional program. Any real (non-textbook example) Prolog program has
to expose algorithmic details simply because the programmer must a) make
decisions and b) express them. I think you're right that Haskell should
be in the
void writing IO in
Peripheral Processor code.
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
spammers. Maybe
the experts know better engines, better ways to set up a forum, or
better ways to administer them after they're up, but it is a concern.
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
mentation, a quasi-standard mechanism for
introducing extension libraries into Scheme) provides a "Notation for
Specializing Parameters without Currying" as a syntactic sugar for
nested lambdas.
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
take this to mean that at least a primitive form of
closure was provided. Moreover, a language that provides SET/SETQ,
RPLACA/RPLACD and the PROG feature (including labels and a goto) surely
qualifies as imperative?
-- Bill Wood
___
Haskell-Cafe
.
This may be difficult to guarantee. Consider:
1. If it does nothing atomically then it does nothing atomically.
2. But if it does nothing atomically then it is false that it does
nothing atomically.
3. Ergo it is false that it does nothing atomically, from (1) and (2)
by Reductio ad Absur
On Tue, 2006-06-27 at 13:35 -0700, Jeremy Shaw wrote:
. . .
> How about heir? Also, until recently, herb and humble?
I grew up in the southern US, and I was taught 'herb' with silent 'h'
but 'humble' with aspirated 'h'. With the 'h' silen
as LUB = 1, but 1 is not an element of the subset. It would seem
that while the infinite list is the LUB of the chain of finite lists, it
is not itself a member of the chain of finite lists. So, what am I
missing?
-- Bill Wood
___
Haskell-Cafe mailing li
so explain why those who *do* believe in some of those maths
resist the move to totally strict Haskell :-).
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
gative integers has "one more element" than the set
of all positive integers, however they have the same cardinality,
aleph-null. This phenomenon is the hallmark of infinite sets.
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haske
does seem that the whole controversy boils down to how the writer
thinks of the chain -- as a sequence of actions or as the evolution of a
value. Neither one is "the One True View"; they're just different.
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
quot;;" in front of the new statement (and one
reason Pascal syntax included the "null" statement was so that "s1;"
would parse as "s1; null", making ";" a de facto delimiter).
Editing ease matters more than a little.
-- Bill Wood
On Sat, 2006-02-04 at 23:34 +, Chris Kuklewicz wrote:
. . .
> But this implies [a,b,c,[]..] is the same as [a,b,c] and [a,b,c,[d,e,f]..] is
> the same as [a,b,c,d,e,f] and [a,b,c,[d,e,f..]..] is [a,b,c,d,e,f..]
Hmmm, does this get us to difference lists ala Prolog?
-- Bil
t to
|forall x, forall y. x <> y only-if phi(x,y)|? I use |P only-if Q| for
|P materially implies Q|.
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
n team at ETH Zurich, the first Pascal compiler for the CDC
6x00 family of computers was written in 1970-1971, and a second was
developed from scratch for the same computers but compiling the revised
language, was written in 1972-1974. I think both of these compilers
were one-pass.
-- Bill Wood
tutorial information has expanded and been
improved since last I looked. So I think I shall now go do some deep
browsing; thanks for the links.
-- Bill Wood
PS: While looking over my post it occurred to me that the issue is at
least as much methodological as it is linguistic. So I ask: Does
d since I last looked. I applaud this discussion for
making Haskell more accessible for the newbie.
(Now, if someone would just explain how to get reliable performance
information while jumping through only a bounded number of hoops ... :-)
-- Bill Wood
___
tly what yours does, and
> not what the one in the example does.
It helped me to read "factors m n" as "there is an integer between m and
n-1 inclusive that divides n". Then the recursion made sense.
Thielemann's "factors n" would read "there is an integer b
ke a compiler do that, why bother the programmer? But
you're not talking about analyzing a function into a
parallel/concurrent/distributed implementation; rather, you're
interested in synthesizing a temporal process out of interacting
computations.
The
t
function of XAUI. I made some progress, but I never found a
satisfactory solution. On the other hand, I did work out a fairly nice
dataflow algorithm for CRC32.
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
und the spine (standard for this
series edited by C.A.R. Hoare), black banner with "100th title" in red.
The lack of any edition information leads me to surmise it's a first
edition.
Do you (or anyone) know if the "diagrammatic notation" ha
d form and using
a reversed composition operator, I was able to provide a programmatic
interface which could be laid out one instruction per line with the
composition operators way off to the right in the comment column, just
like assembler code! The inventors thought this was just wonderfu
by some
algebraists, but I can't put my hands on a source right now.
I guess it's not even entirely clear what constitutes "mathematical
notation". :-)
-- Bill Wood
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
integrated into Lisp.
All of these made non-trivial extensions to Lisp, and all were of
arguably great utility.
-- Bill Wood
[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
s in 0 as a memory location. The suggested solution is to give each
And the Scheme community chose "#f" and "#t" for boolean values so you
had to be a little more explicit about what you were doing.
I mostly agree with the "tightening
ead make higher-order functions difficult (I
never saw any serious attempts at HOFs).
I suspect it's a levels-of-abstraction thing; after all, the Forth
environment could be viewed as the ideal stack machine upon which to
implement FLs and block-structured languages.
-- Bill Wood
[EMAI
th op codes and parameters
running down the page, just like real assembler (I tabbed over to place
the ">>" so they kinda hung out in the comment area so as not to spoil
the illusion). It was a quick 'n dirty hack that turned out to be
pretty slick.
-- Bill Wood
[EMAIL PRO
f transforming (logical) specifications through
functions into imperative programs.
-- Bill Wood
[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
minor glitch: the earlier version gave
B_0 = 0 instead of 1.
I think I got the right results for B_3000: My print-out had the same
denominator along with a 6762-digit numerator with the same initial
seven and final two digits. I don't get 6744 digits in the middle,
however.
I'm impres
eg's blow the heap at an
*odd* value -- I thought he skipped those.
-- Bill Wood
[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Number Theory for
Computing_, p. 75
This has gotten a little long, sorry. If you want I can post my Haskell
code or send privately.
-- Bill Wood
[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
50 matches
Mail list logo
