<http://hackage.haskell.org/package/csound-sampler>
-
csound-catalog <http://hackage.haskell.org/package/csound-catalog>
2015-10-30 17:41 GMT+03:00 Anton Kholomiov <anton.kholom...@gmail.com>:
> *The 4.9.0 is out! New features:*
>
> csound-expression
>
>
*The 4.9.0 is out! New features:*
csound-expression
-
Functions for creation of FM-synthesizers. We can create
the whole graph of FM-units (with feedback). Check out the module
Csound.Air.Fm
-
Support for Monosynth patches. See atMono in the module Csound.Air.Patch
see the
>
> src/Csound.hs:135:10:
> Not in scope: type constructor or class ‘CsdSco’
>
> Where do I find it?
>
> thanks,
> Edward
>
> Anton Kholomiov <anton.kholom...@gmail.com> writes:
>
> > Status update for my haskell synth csound-expression. The mai
was able to stream the audio to DAW live.
2015-09-14 17:31 GMT+03:00 <amin...@gmail.com>:
> Oh interesting! I had thought CSound didn't do realtime synthesis.
>
> tom
>
>
> El Sep 14, 2015, a las 6:15, Anton Kholomiov <anton.kholom...@gmail.com>
> escribió:
>
&g
; to be. Can you point to references you used to create the instrument
> definitions?
>
> Tom
>
>
> On Sun, Sep 13, 2015 at 9:13 AM, Anton Kholomiov <
> anton.kholom...@gmail.com> wrote:
>
>> Status update for my haskell synth csound-expression. The main point is
It's all was played live with Csound triggered by midi keyboard and
recorded with Audacity (connected to csound output with Jack)
2015-09-14 13:11 GMT+03:00 Anton Kholomiov <anton.kholom...@gmail.com>:
> Thanks for feedback. I've used several sources on sound design:
>
> Ian McC
Status update for my haskell synth csound-expression. The main point is
presence of many cool instruments. They are implemented in the package
csound-catalog. All packages are compiled with GHC-7.10 So the hackage
fails to build them and unfortunately docs a broken too. But you can look
at the
Chair: David Janin, University of Bordeaux
Publicity Chair: Samuel Aaron, University of Cambridge
Program Committee:
Samuel Aaron, University of Cambridge
Jean Bresson, IRCAM Paris
David Broman, KTH and UC Berkeley
David Janin (chair), University of Bordeaux
Anton Kholomiov, Orffeus instrumental
Thanks for the kind words. It was a long road to making the tracks
2014-12-01 4:34 GMT+03:00 Francesco Ariis fa...@ariis.it:
― Attachment links are at the end of this email ―
On Fri, Nov 28, 2014 at 12:47:48PM +0400, Anton Kholomiov wrote:
I wrote two tracks completely with Haskell.
You
at 12:47:48PM +0400, Anton Kholomiov wrote:
I wrote two tracks completely with Haskell.
You can listen to them on the soundcloud:
I downloaded the zip'd source, but I cannot listen to your track
on soundcloud (it requires Flash, and Linux doesn't play well
with Flash).
Is there any other
I wrote two tracks completely with Haskell.
You can listen to them on the soundcloud:
https://soundcloud.com/anton-kho/celtic
https://soundcloud.com/anton-kho/invisible-ocean
The music is based on samples but
a single track uses no more than 6 samples.
The code is under 100 lines of code.
I'm
For midi you can try my packages: temporal-music-notation and
temporal-music-notation-demo (and maybe temporal-music-notation-western).
It looks like Haskore but different inside. It tries to be clear, minimal,
more efficient and documented (as far as my english goes though).
Anton
2013/7/10
I don't understand the final part of the question but here are some
comments for the first part.
I don't like the phrase:
the more powerfull a class is, the more fleixblility you have for
combining them to complex programs
powerfull, more flexibility, complex programs -- are not so precise
I wish it was possible to use an extension
CustomPrelude = Prelude.Prime
In the cabal file
2013/5/23 Roman Cheplyaka r...@ro-che.info
I liked Andreas's idea (cited below). Hence the new package
prelude-prime.
https://github.com/feuerbach/prelude-prime
Things I have to install on Ubuntu to get it going: librsvg2-dev (for
svgcairo), libpoppler-glib-dev (for poppler), libgd2-xpm-dev (for gd).
2013/3/30 Ian-Woo Kim ianwoo...@gmail.com
Hi, all,
Pen note-taking program hoodle, which is being developed entirely in
haskell, is updated to
requires the arguments to be of the same type (in the second type
argument `c`).
2013/2/23 Conal Elliott co...@conal.net
On Tue, Feb 19, 2013 at 9:28 PM, Anton Kholomiov
anton.kholom...@gmail.com wrote:
Do you think the approach can be extended for non-regular (nested)
algebraic types (where
I'm glad to announce the package for Common subexpression elimination [1].
It's an implementation of the hashconsig algorithm as described in the
paper
'Implementing Explicit and Finding Implicit Sharing in EDSLs' by Oleg
Kiselyov.
Main point of the library is to define this algorithm in the most
and
lightweight.
Just fixpoints, just folds and unfolds.
2013/2/19 Emil Axelsson e...@chalmers.se
2013-02-19 12:10, Anton Kholomiov skrev:
I'm glad to announce the package for Commonsubexpression elimination [1].
It's an implementation of the hashconsig algorithm as described in the
paper
Do you think the approach can be extended for non-regular (nested)
algebraic types (where the recursive data type is sometimes at a different
type instance)? For instance, it's very handy to use GADTs to capture
embedded language types in host language (Haskell) types, which leads to
An idea. You can make a type:
data TestContains = TestContains Tweet TweetSet
and the make an Arbitrary instance for it. When you do
a recursove call you have three different tweets one new tweet
and two from the sub-calls. Then you can place one of them in the
result. In the end you will have a
I'd like to announce ticketimer.com -- it's a website
that is not done yet. With ticketimer you can
choose films for your local cinema. People can buy
tickets in advance and promote the films they like.
Do we need to eat this blockbuster stuff all the time?
See how to vote for a change on
You have implemented very general idea as
a part of your library (Data type a la carte).
Maybe it's better to make a separate package?
Other developers would benefit from it. I saw some other
packages and they implement it too.
Anton
2012/7/1 Liam O'Connor lia...@cse.unsw.edu.au
I know it's
The class you're looking for is Applicative. The (*) operator handles
application of effectful things to effectful things, whereas ($)
handles the application of non-effectful things to effectful things.
This situation is interesting because it highlights the fact that there is
a distinction
do-notation is just syntax in theory but in practice
it's difficult to avoid it. Try to write any OpenGL
program in terms of `=`, `` and `return`.
I don't like to use `do` knowing that it's just
syntax sugar but sometimes it help a lot.
___
Haskell-Cafe
Here is an half-baked idea how to make monads more functional.
It's too wild to be implemented in haskell.
But maybe you are interested more in ideas than implementations,
so let's start with monad class
class Monad m where
return :: a - m a
(=) :: m a - (a - m b) - m b
I think monad's
Why this function doesn't compile?
phi :: Monad m = StateT s m ()
phi = lift $ return ()
I get (ghc-7.4.1)
Could not deduce (MonadTrans (StateT s))
arising from a use of `lift'
from the context (Monad m)
bound by the type signature for phi :: Monad m = StateT s m ()
at
No, it wants me to define an instance for
(StateT s) which is supposed to be defined
be the authors of the library.
Actually I discovered that I have two libraries
called transformers.
transformers-0.2.2.0
transformers-0.3.0.0
So when I'm doing
import Control.Monad.Trans (0.2.2.0)
I get
At last..
No, it wants me to define an instance for
(StateT s) which is supposed to be defined
be the authors of the library.
Actually I discovered that I have two libraries
called transformers.
transformers-0.2.2.0
transformers-0.3.0.0
So when I'm doing
import Control.Monad.Trans
Indeed, thank you. mtl is cruel with me for
the second time uumpf. But it's strange mtl
just reexports transformer's module
2012/6/23 MigMit miguelim...@yandex.ru
On 23 Jun 2012, at 21:27, Anton Kholomiov wrote:
At last..
No, it wants me to define an instance for
(StateT s) which
Maybe I export State from one library version
and instance from another?
2012/6/23 Anton Kholomiov anton.kholom...@gmail.com
Indeed, thank you. mtl is cruel with me for
the second time uumpf. But it's strange mtl
just reexports transformer's module
2012/6/23 MigMit miguelim...@yandex.ru
What are you using instead of mtl? I need simple type for State.
The more classy it gets the harder error messages are to understand.
I've installed new package. Silently it installed new mtl.
And here I'm staring into three lines of code for half an hour
trying to understand where I misused the
I'd rather use 'transformers' then.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
a) you can generate c++ with it :) (but don't tell it.
it may be regarded as offense)
b) -
c) -
d) stop debugging, you don't need it that much in
haskell. But you need profiler. If they really want
to print something in pure function you can show
them function 'trace', from Debug.Trace
e) I
Well Russian translation title goes:
Learn Haskell in the name of the Kindness
Anton
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'd like to make special syntax for folds, so that fold is built in
the type definition. Maybe it can be some special
braces or just fold(..). So we can write the same function in
place of foldr, maybe, either and so on and don't have to define
them by hand.
Inside special fold-braces one can
This can be very helpful: Implementation of FP languages by Simon Peyton
Jones
http://research.microsoft.com/en-us/um/people/simonpj/papers/slpj-book-1987/index.htm
2011/11/16 Shogo Sugamoto eseh...@gmail.com
Hi,Cafe.
I want to create my own Programming Language with Haskell, and I learn
node.
31 октября 2011 г. 9:05 пользователь Eugene Kirpichov
ekirpic...@gmail.comнаписал:
Anton, I think the mapM inside searchBy is incorrect. You're threading
state between exploration of different branches, which you I think
shouldn't be doing.
30.10.2011, в 19:44, Anton Kholomiov
visits the nodes in the order ABCDE FCDE GDE HE IJ.
-- ryan
On Sat, Oct 22, 2011 at 5:28 AM, Anton Kholomiov
anton.kholom...@gmail.com wrote:
Recently I was looking for an A-star search algorithm. I've found a
package
but I couldn't understand the code. Then I saw some blogposts
Recently I was looking for an A-star search algorithm. I've found a package
but I couldn't understand the code. Then I saw some blogposts but they
were difficult to understand too. I thought about some easier solution that
relies on laziness. And I've come to this:
Heuristic search is like
Problems by Nordin
Tolmach.
http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4704
RS
On 22/10/11 13:28, Anton Kholomiov wrote:
Recently I was looking for an A-star search algorithm. I've found a
package
but I couldn't understand the code. Then I saw some blogposts but they
were
Just to make it explicit, is it
\a i -
let t = a ! i in
if i = 0 then
t
else if i 0 then
t + a ! (i-1)
else
bad idea, because of last else-case? Can it be mended with
one another pass for if-expressions?
The upcoming
.
On 11 August 2011 08:57, Anton Kholomiov anton.kholom...@gmail.com
wrote:
Thank you for the reference to Strafunski libraries, I read
HaskellWiki, but I don't have a permission to visit their site.
All links are forbidden.
Can it be a function:
fun :: Eq a = Tree a - [(Int, (a, [Int
or similar library.
On 11 August 2011 05:00, Anton Kholomiov anton.kholom...@gmail.com
wrote:
Is there a library on common sub-expression elimination?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
Is there a library on common sub-expression elimination?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
There is a 'spit' library on hackage. Maybe you are looking for this
http://hackage.haskell.org/package/split
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Maybe haskellWiki is proper place for this, but I like what haddock is doing
with styles and how it links to functions and modules.
2010/11/10 Erik de Castro Lopo mle...@mega-nerd.commle%2...@mega-nerd.com
Anton Kholomiov wrote:
no, it's not here any more, but i've added tutorial. look
no, it's not here any more, but i've added tutorial. look for update
http://hackage.haskell.org/package/csound-expression
2010/11/4 C K Kashyap ckkash...@gmail.com
Hi Erik,
This looks very interesting and seems to have quite comprehensive
reference documentation. Unfortunately there
Hi,
I'm glad to announce csound combinator library.
It features liberation from id-style csound code, haskore-like composition
structures, type-safe composable opcodes and simple instrument interface (no
interface at all, instrument is just a function from some note
representation to signal).
48 matches
Mail list logo
