Send Beginners mailing list submissions to
beginners@haskell.org
To subscribe or unsubscribe via the World Wide Web, visit
http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
or, via email, send a message with subject or body 'help' to
beginners-requ...@haskell.org
You can reach the person managing the list at
beginners-ow...@haskell.org
When replying, please edit your Subject line so it is more specific
than "Re: Contents of Beginners digest..."
Today's Topics:
1. Trying to prove Applicative is superclass of Functor, etc
(Silent Leaf)
2. audio generation (Dennis Raddle)
3. Re: audio generation (Jeffrey Brown)
4. Re: audio generation (Dennis Raddle)
----------------------------------------------------------------------
Message: 1
Date: Fri, 29 Apr 2016 19:18:23 +0200
From: Silent Leaf <silent.le...@gmail.com>
To: D?niel Arat? <exitcons...@gmail.com>, The Haskell-Beginners
Mailing List - Discussion of primarily beginner-level topics related
to Haskell <beginners@haskell.org>
Subject: [Haskell-beginners] Trying to prove Applicative is superclass
of Functor, etc
Message-ID:
<cagfccjmz68ujlniqgwfse67brwt6fmeh7wra1hqm_odbyhy...@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"
I'm very interested in your definition of (->) based on the idea of
implication?
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://mail.haskell.org/pipermail/beginners/attachments/20160429/a85a5932/attachment-0001.html>
------------------------------
Message: 2
Date: Fri, 29 Apr 2016 20:58:18 -0700
From: Dennis Raddle <dennis.rad...@gmail.com>
To: Haskell Beginners <beginners@haskell.org>
Subject: [Haskell-beginners] audio generation
Message-ID:
<CAKxLvoqfPEZownq=ydtc8q15fvdf6si+wzndkpeerg+9deo...@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"
I'm writing a program that will use functions to generate audio. The
Haskell code will write the audio samples to disk---no need for real time
playback. I see some useful libraries for writing audio files.
My question concerns efficiency when generating several million to 20
million samples (or even many times more than that if I use high-resolution
sampling rates). They can be generated one at a time in sequence, so
there's no need to occupy a lot of memory or postpone thunk evaluation. I'm
going to need efficient disk writing. Note that I may need some
pseudorandom numbers in my calculations, so I might want to calculate
samples by state monadic computations to carry the generator state. What is
my general strategy going to be for memory and time efficiency? I am pretty
confused by Haskell "strictness" and normal head form and all that, which
often doesn't seem to be very strict. Or bang patterns, etc. Is it going to
be simple to understand what I need?
Dennis
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://mail.haskell.org/pipermail/beginners/attachments/20160429/04d58512/attachment-0001.html>
------------------------------
Message: 3
Date: Fri, 29 Apr 2016 22:05:34 -0700
From: Jeffrey Brown <jeffbrown....@gmail.com>
To: The Haskell-Beginners Mailing List - Discussion of primarily
beginner-level topics related to Haskell <beginners@haskell.org>
Subject: Re: [Haskell-beginners] audio generation
Message-ID:
<CAEc4Ma0=NOAfZo_voLx-L=fD2dPxwVwQWu1tuN5J+=t8dxi...@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"
Interesting question! I don't know but I'm excited to read the responses.
If you don't find an answer here, this question seems to me easily
difficult enough to be appropriate on haskell cafe.
On Fri, Apr 29, 2016 at 8:58 PM, Dennis Raddle <dennis.rad...@gmail.com>
wrote:
> I'm writing a program that will use functions to generate audio. The
> Haskell code will write the audio samples to disk---no need for real time
> playback. I see some useful libraries for writing audio files.
>
> My question concerns efficiency when generating several million to 20
> million samples (or even many times more than that if I use high-resolution
> sampling rates). They can be generated one at a time in sequence, so
> there's no need to occupy a lot of memory or postpone thunk evaluation. I'm
> going to need efficient disk writing. Note that I may need some
> pseudorandom numbers in my calculations, so I might want to calculate
> samples by state monadic computations to carry the generator state. What is
> my general strategy going to be for memory and time efficiency? I am pretty
> confused by Haskell "strictness" and normal head form and all that, which
> often doesn't seem to be very strict. Or bang patterns, etc. Is it going to
> be simple to understand what I need?
>
> Dennis
>
>
> _______________________________________________
> Beginners mailing list
> Beginners@haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
>
>
--
Jeffrey Benjamin Brown
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://mail.haskell.org/pipermail/beginners/attachments/20160429/36c7e369/attachment-0001.html>
------------------------------
Message: 4
Date: Sat, 30 Apr 2016 02:31:26 -0700
From: Dennis Raddle <dennis.rad...@gmail.com>
To: The Haskell-Beginners Mailing List - Discussion of primarily
beginner-level topics related to Haskell <beginners@haskell.org>
Subject: Re: [Haskell-beginners] audio generation
Message-ID:
<CAKxLvooNhfx+yVtM2yWbWPYE4jS=6u78uetjjmtxq38f37a...@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"
Oh a related question is---do any of the linear algebra packages for
Haskell use hardware acceleration for vector arithmetic? I have a Windows
PC with a gamer-class video card, so maybe I could speed things up manyfold.
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://mail.haskell.org/pipermail/beginners/attachments/20160430/f658c69b/attachment-0001.html>
------------------------------
Subject: Digest Footer
_______________________________________________
Beginners mailing list
Beginners@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
------------------------------
End of Beginners Digest, Vol 94, Issue 32
*****************************************
