Re: [Haskell-cafe] HaskellDB DB Layout Description

2011-07-15 Thread Mats Rauhala
On 18:12 Sat 09 Jul , Tom Murphy wrote:
> Hi,
>  I've found good explanations of the HaskellDB combinators, but I
> can't find good information about how to correctly define the database
> layout. Can anyone point me to a resource, or give a quick example?
> 
> Thanks!
> Tom

Hello,

I wrote a bit lengthy introduction to haskelldb at
http://users.utu.fi/machra/posts/2011-07-15-haskelldb.html. Could you
check it out, and maybe comment whether it was helpful, or if something
is falsy/doesn't work for you?

-- 
Mats Rauhala
MasseR


pgpIJJ6WlM8Nn.pgp
Description: PGP signature
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe


[Haskell-cafe] GHC API output files options problem

2011-07-15 Thread Marianna Rapoport
Hi all,

we are working on a Haskell support plugin for IntelliJ IDEA, and need to
provide correct compilation of Haskell programs.

We compile the latter using GHC API, with options specifying .hi and .o
paths. For some reason, unlike a standalone GHC compilation, GHC API ignores
the values of the outputFile and outputHi flags.

Please find attached a minimal example where "err_test.hs" uses GHC API to
compile "src/A.hs".

Thus, "test_ghc.sh" and "test_my.sh" should do the same, but the first works
correctly while the latter puts "use.o" and "use.hi" to the "src" folder. To
launch "test_my.sh", please change the value of lib in "err_test.hs"
according to your GHC installation path.

Thank you very much in advance!

Marianna Rapoport, amaurr...@gmail.com
Oleg Sobolev, sobolev...@mail.ru


htest.tar
Description: Unix tar archive
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe


[Haskell-cafe] ANNOUNCE: docidx-1.0.0

2011-07-15 Thread Andy Gimblett
Hi all.  I'd like to announce docidx, a new tool for Haskell documentation:

http://hackage.haskell.org/package/docidx
http://github.com/gimbo/docidx.hs

docidx is a program which creates a static HTML page indexing your installed 
packages, with links to your local haddock docs and to each package's hackage 
page.  It covers global and user packages, and handles multiple installed 
versions sensibly.  Here's how the output looks:

http://github.com/gimbo/docidx.hs/raw/master/examples/example.png

The idea is to complement the "index by module name" which Cabal creates and 
maintains.  Sometimes you want to find things by package.  :-)  (But note that 
unlike Cabal's index, docidx's isn't automatically updated when you install a 
new package; so, I run it once an hour from cron.)

Please see the github page for more details, including customisation options.

Hopefully somebody will find this useful.  Maybe one day it could be part of 
cabal-install?  :-)

Thanks!

-Andy

PS: A bit of history/due credit: Martijn van Steenbergen did something similar 
in PHP in early 2009: 
http://thread.gmane.org/gmane.comp.lang.haskell.cafe/53531/focus=53572 ; then I 
wrote a static version in Python later that year: 
http://gimbo.org.uk/blog/2009/09/23/ ; then Andy Price ported that to Haskell: 
https://github.com/andyprice/docidx.hs ; finally, I rewrote that to build the 
index via Cabal rather than walking the filesystem directly - and here we are.

--
Andy Gimblett
hask...@gimbo.org.uk


___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe


[Haskell-cafe] How to determine minimal dependency of package

2011-07-15 Thread yi huang
I'm writing my first haskell package, how do i determine the minimal
dependency of it, for example, it use Data.Data, how do i know which version
of base package  first introduce Data.Data module, i can't find the answer
with google.

-- 
http://www.yi-programmer.com/blog/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe


Re: [Haskell-cafe] How to determine minimal dependency of package

2011-07-15 Thread Anthony Cowley
On Fri, Jul 15, 2011 at 10:48 AM, yi huang  wrote:
> I'm writing my first haskell package, how do i determine the minimal
> dependency of it, for example, it use Data.Data, how do i know which version
> of base package  first introduce Data.Data module, i can't find the answer
> with google.

You should specify the minimum version you have tested with.

Anthony

___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe


Re: [Haskell-cafe] How to determine minimal dependency of package

2011-07-15 Thread Daniel Patterson
Based on the package versioning policy [1], A.B is a major version, so if you 
know that it works with 1.2, then it is reasonably safe to specify the range >= 
1.2 && <1.3, as no major api breaking changes should occur within the 1.2 range 
(ie, 1.2.1 to 1.2.2, etc)

1. http://www.haskell.org/haskellwiki/Package_versioning_policy#Version_numbers

On Jul 15, 2011, at 10:56 AM, Anthony Cowley wrote:

> On Fri, Jul 15, 2011 at 10:48 AM, yi huang  wrote:
>> I'm writing my first haskell package, how do i determine the minimal
>> dependency of it, for example, it use Data.Data, how do i know which version
>> of base package  first introduce Data.Data module, i can't find the answer
>> with google.
> 
> You should specify the minimum version you have tested with.
> 
> Anthony
> 
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe

___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe


[Haskell-cafe] Domain-Specific Languages: Call for Participation

2011-07-15 Thread Chung-chieh Shan
DSL 2011: IFIP Working Conference on Domain-Specific Languages 
6-8 September 2011, Bordeaux, France 

 Call for Participation: Online registration deadline July 30, 2011  

Details of the program and accommodation are available at 
http://dsl2011.bordeaux.inria.fr.

== Invited Speakers ==

- Jeremy Gibbons - University of Oxford, UK.
- Claude Kirchner - INRIA, France.

== Distilled Tutorials on Domain-Specific Languages ==

The purpose of these tutorials are not to give a general overview, but to make 
the attendees 
aware of one point and to make them master it.

- Jerzy Karczmarczuk.  Specific "scientific" data structures, and their 
processing.
- Oleg Kiselyov.  Implementing explicit and finding implicit sharing in 
embedded DSL.
- Keiko Nakata.  A total interpreter for While with interactive I/O.
- Josef Svenningsson.  Combining deep and shallow embeddings for EDSLs.
- Walid Taha.  Accurate programming: thinking about programs in terms of 
properties.
- William Cook.  Build your own partial evaluator in 90 minutes.

== DSL Technical Papers == 

- Basile Starynkevitch. MELT a Translated Domain Specific Language Embedded in 
the GCC Compiler.
- Azer Bestavros and Assaf Kfoury. A Domain-Specific Language for the 
Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks. 
- Tiark Rompf, Kevin J. Brown, Hassan Chafi, Hyoukjoong Lee, Arvind K. Sujeeth, 
Martin Odersky and Kunle Olukotun. Building-Blocks for Performance Oriented 
DSLs. 
- Dominic Orchard and Alan Mycroft. Efficient and Correct Stencil Computation 
via Pattern Matching and Static Typing.
- Tim Bauer, Martin Erwig, Alan Fern and Jervis Pinto. Adaptation-Based 
Programming in Haskell. 
- Eric Walkingshaw and Martin Erwig. A DSEL for Studying and Explaining 
Causation. 
- Lucas Beyak and Jacques Carette. SAGA: A DSL for story management.



signature.asc
Description: Digital signature
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe


Re: [Haskell-cafe] ANNOUNCE: docidx-1.0.0

2011-07-15 Thread Jack Henahan
I've been using docidx for a while now. It's a great little tool. I highly 
recommend to anyone looking for a centralized documentation tool.

Jack

On Jul 15, 2011, at 8:38 AM, Andy Gimblett wrote:

> Hi all.  I'd like to announce docidx, a new tool for Haskell documentation:
> 
>http://hackage.haskell.org/package/docidx
>http://github.com/gimbo/docidx.hs
> 
> docidx is a program which creates a static HTML page indexing your installed 
> packages, with links to your local haddock docs and to each package's hackage 
> page.  It covers global and user packages, and handles multiple installed 
> versions sensibly.  Here's how the output looks:
> 
>http://github.com/gimbo/docidx.hs/raw/master/examples/example.png
> 
> The idea is to complement the "index by module name" which Cabal creates and 
> maintains.  Sometimes you want to find things by package.  :-)  (But note 
> that unlike Cabal's index, docidx's isn't automatically updated when you 
> install a new package; so, I run it once an hour from cron.)
> 
> Please see the github page for more details, including customisation options.
> 
> Hopefully somebody will find this useful.  Maybe one day it could be part of 
> cabal-install?  :-)
> 
> Thanks!
> 
> -Andy
> 
> PS: A bit of history/due credit: Martijn van Steenbergen did something 
> similar in PHP in early 2009: 
> http://thread.gmane.org/gmane.comp.lang.haskell.cafe/53531/focus=53572 ; then 
> I wrote a static version in Python later that year: 
> http://gimbo.org.uk/blog/2009/09/23/ ; then Andy Price ported that to 
> Haskell: https://github.com/andyprice/docidx.hs ; finally, I rewrote that to 
> build the index via Cabal rather than walking the filesystem directly - and 
> here we are.
> 
> --
> Andy Gimblett
> hask...@gimbo.org.uk
> 
> 
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe


___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe


Re: [Haskell-cafe] Animas/Yampa: ArrowChoice?

2011-07-15 Thread Edward Amsden
On Fri, Jul 15, 2011 at 12:56 AM, Jason Dagit  wrote:
> On Thu, Jul 14, 2011 at 5:04 PM, Ertugrul Soeylemez  wrote:
>> Hello all,


>>
>> I really like the way Animas (fork of Yampa) represents reactive
>> systems, and I would love to write some of my simulations using it.
Hi.

The Animas fork is something I did, to fix up some annoyances in
Yampa. It's otherwise the same.

>> Unfortunately most of what I want to do requires dynamic systems, which
>> can be boiled down to me believing to need an ArrowChoice instance for
>> the SF arrow, because I have to choose between different signal paths
>> depending on the input signal or events.
>>
>> Animas appears to be only suitable for robot-like systems with specific,
>> predefined actors.
>>
>> Is there anything I can do about it?  Is it difficult to write the
>> ArrowChoice instance?

Recall that signals in Animas/Yampa are conceptually continuous, which
means that an ArrowChoice instance would need to make a choice at
every instant. This would expose the underlying sample rate. So, no,
ArrowChoice doesn't conceptually fit in Animas/Yampa.

>> Or is there a different solution, which I
>> overlooked?
> If I understand the thesis about the Frag game correctly it uses
> rSwitch, or rpSwitch, to make a dynamic switch:
> http://www.haskell.org/haskellwiki/Yampa/rSwitch
> http://haskell.org/haskellwiki/Frag
The switching combinators are the correct solution for dynamic systems.

-- 
Edward Amsden
Student
Computer Science
Rochester Institute of Technology
www.edwardamsden.com

___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe


Re: [Haskell-cafe] How to determine minimal dependency of package

2011-07-15 Thread Ivan Lazar Miljenovic
On 16 July 2011 01:04, Daniel Patterson  wrote:
> Based on the package versioning policy [1], A.B is a major version, so if
> you know that it works with 1.2, then it is reasonably safe to specify the
> range >= 1.2 && <1.3, as no major api breaking changes should occur within
> the 1.2 range (ie, 1.2.1 to 1.2.2, etc)
> 1. http://www.haskell.org/haskellwiki/Package_versioning_policy#Version_numbers

Not quite: if you're using version x.y.z then it may have an
additional function, etc. that was added compared to just x.y ; as
such the bounds are >= x.y.z && < x.(y+1)

That said, very few packages seem to have versions where they add
something without removing or modifying something else, so in most
cases you are correct.

-- 
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.wordpress.com

___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe


[Haskell-cafe] urWeb, Haskell and dependent types ....

2011-07-15 Thread Vasili I. Galchin
Hello,

 Here is probably a good paper to get people up to speed on dependent
types (ironically written by two contributors to this mailing list??):
okmij.org/ftp/papers/lightweight-static-capabilities.pdf



Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe