The characteristics of the logical variable are as follows.
An incomplete data structure (ie. containing free variables)
may be returned as a procedure's output. The free variables
can later be filled in by other procedures, giving the effect
of implicit assignments to a data structure
Lennart Augustsson lenn...@augustsson.net writes:
Jon, you beat me to it. I was going to mention Ponder.
Strange chance; yesterday was the first time I read haskell café
for something like half a year.
But Ponder did have a builtin type, it had the function type built in. :)
Well, to use
On Wed, Nov 3, 2010 at 06:49, Tony Morris tonymor...@gmail.com wrote:
I am trying to set up an apache server as an additional source to
hackage for haskell packages.
I have added to my ~/.cabal/config file:
remote-repo: myhackage:http://myhackage/packages
Shouldn't that be:
remote-repo:
On 2 November 2010 14:10, Bertram Felgenhauer
bertram.felgenha...@googlemail.com wrote:
Indeed. I had a lot of fun with the ideas of this thread, extending
the 'Force' type family (which I call 'Eval' below) to a small EDSL
on the type level:
I also came up with this.. I was trying to use it
I just released the monad-peel library to Hackage.
http://hackage.haskell.org/package/monad-peel
MonadPeelIO is a simple class that allows lifting monadic control
operations, such as those in Control.Exception and Foreign.Marshal.Alloc,
through layers of monad transformers. It comes with
On 29/10/2010 23:24, Ganesh Sittampalam wrote:
On Fri, 22 Oct 2010, Sigbjorn Finne wrote:
On Fri, Oct 22, 2010 at 9:35 AM, Sittampalam, Ganesh
ganesh.sittampa...@credit-suisse.com wrote:
libraries@, what's the right way to proceed? Can I make a Debian-style
non-maintainer upload with
Hi.
In a project with Haskell + FFI,
I recently split my C program into modules (files).
I don't want to lose optimization though,
so I want to use something like
gcc -c -o complete.o -fwhole-program -combine *.c
(doing whole program optimization/inlining etc., I hope).
How do I write this in
Hi everybody,
Here's a little report from the most recent Darcs hacking sprint (held
15-17 October in Orleans)
http://blog.darcs.net/2010/10/darcs-hacking-sprint-5-report.html
--
Eric Kow http://www.nltg.brighton.ac.uk/home/Eric.Kow
For a faster response, try +44 (0)1273 64 2905 or
On 02-11-10 18:57, Aaron Gray wrote:
On 2 November 2010 14:00, Martijn Schrage mart...@oblomov.com
mailto:mart...@oblomov.com wrote:
On 01-11-10 22:35, Aaron Gray wrote:
Right, FF seems okay now on Vista too.
Chrome :-
...
It works on Firefox, Chrome and Safari now,
Message: 10
Date: Wed, 3 Nov 2010 00:38:53 -0200
From: Victor Oliveira rhapso...@gmail.com
Hi,
Info:
ghc 6.12.3 (installed from haskell plataform)
Mac os x snow leopard 10.6.4
ffmpeg instaled from ports - ffmpeg @0.6.1
hs-ffmpeg 0.3.4 - installed from cabal-install
When I try
On Wed, Nov 3, 2010 at 10:59 AM, Anders Kaseorg ande...@mit.edu wrote:
I just released the monad-peel library to Hackage.
This is great news!
My regions library uses 'bracket' from MonadCatchIO in the runRegionT
function. Due to the recent discussion on MonadCatchIO I realized that
users could
On Wed, Nov 3, 2010 at 4:14 AM, Erik Hesselink hessel...@gmail.com wrote:
On Wed, Nov 3, 2010 at 06:49, Tony Morris tonymor...@gmail.com wrote:
I am trying to set up an apache server as an additional source to
hackage for haskell packages.
I have added to my ~/.cabal/config file:
Hi,
exist some benchmark active to use in my libraries, i want test memory
usage and performance?
Cheers,
André
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi André,
Have a look at the Criterion benchmarking package:
http://hackage.haskell.org/package/criterion
Johan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Günther,
from the semantical point of view, you can replace
let x = e' in e
by
(\x - e) e'
Both should evaluate to the same thing.
However, from the typing point of view, it makes quite a difference. It is
an integral part of the Hindley-Milner type inference algorithm, which
is
Hi Johan,
i already try use Criterion but i couldn't install with cabal :S i get
error:
cabal install criterion
Resolving dependencies...
cabal: dependencies conflict: ghc-6.12.1 requires array ==0.3.0.1 however
array-0.3.0.1 was excluded because ghc-6.12.1 requires array ==0.3.0.0
Anyone can
Looks like http://www.haskell.org/cabal/FAQ.html has a description of your
problem!
2010/11/3 André Batista Martins andre...@netcabo.pt
Hi Johan,
i already try use Criterion but i couldn't install with cabal :S i get
error:
cabal install criterion
Resolving dependencies...
cabal:
2010/11/3 Petr Pudlak d...@pudlak.name:
However, from the typing point of view, it makes quite a difference. It is
an integral part of the Hindley-Milner type inference algorithm, which is
used by many functional languages. Consider the following two expressions:
f = (\x - x x) (\y - y)
g =
2010/11/3 Petr Pudlak d...@pudlak.name:
f = (\x - x x) (\y - y)
g = let x = \y - y in x x
The function f is not typable in the Hindley-Milner type system, while g
is is (and its type is a - a). The reason is that in the first case (f),
the typing system tries to assign a single type to x,
On Wed, 3 Nov 2010, Simon Marlow wrote:
On 29/10/2010 23:24, Ganesh Sittampalam wrote:
4000.0.10 should fix the reported issue with fail and Either, and bumps
the base dep to build with GHC 7.0
That's great. Any chance you could also look at this one, which appears to
be a pretty serious
On Wed, 3 Nov 2010, Bas van Dijk wrote:
Something else: In the soon to be released base-4.3 the block and
unblock functions will be deprecated in favor of mask. It would be great
if you can also add these new functions to Control.Exception.Peel:
Yeah, I was putting off learning how to deal
Welcome to issue 157 of the HWN, a newsletter covering developments in
the [1]Haskell community in the week of October 24 - 30.
Seems that things quieted down a bit this week. We saw 85 new or
updated packages in Hackage, 29 (-5) stories posted to Reddit, 25 (-22)
questions posted
On Wed, 2010-11-03 at 18:05 +0100, Petr Pudlak wrote:
Hi Günther,
from the semantical point of view, you can replace
let x = e' in e
by
(\x - e) e'
Both should evaluate to the same thing.
You also need (sometimes) fix function
let xs = 1:xs in xs
and
fix (\xs - 1:xs)
On Tue, 2010-11-02 at 21:57 -0400, Brandon S Allbery KF8NH wrote:
On 10/29/10 09:35 , Dominique Devriese wrote:
* Only introduce a dependency from type class A to type class B if all
functions in type class B can be implemented in terms of the
functions in type class A or if type class
This is off topic (almost regardless of the topic), but It gave me a
laugh. Hope you all enjoy it, too.
I was telling a friend about the power and elegance of Haskell. When I
mentioned that it has influenced many other programming languages,
including his favorite language (Python) he retorted by
I would love to know the answer to this.
On Tue, Nov 2, 2010 at 3:36 PM, Jeremy Shaw jer...@n-heptane.com wrote:
Hello,
I have a module, XMLGenerator, which has some overlapping instances.
I have a second module, Test, which imports that module and also adds
some more overlapping instances.
On 3/11/2010, at 9:50 PM, Claus Reinke wrote:
The bottom line is that
- in logic programming languages, building a list by working on
a pair of arguments representing a segment of the list is the
NORMAL way to build a list; it's as fast as it gets, and the
list is inspectable during
I have a program (test.hs):
module Main (main) where
import System.Exit
main :: IO ExitCode
main = do
return (ExitFailure 1)
In another program, I invoke it via 'system':
exitCode - system .\\test.exe
case (exitCode) of
ExitFailure failCnt - do
putStrLn $ --
At 8:45 PM -0700 11/3/10, Peter Schmitz wrote:
I have a program (test.hs):
module Main (main) where
import System.Exit
main :: IO ExitCode
main = do
return (ExitFailure 1)
In another program, I invoke it via 'system':
exitCode - system .\\test.exe
case (exitCode) of
On 11/3/10 12:34 AM, Gregory Crosswhite wrote:
On 11/2/10 8:37 PM, wren ng thornton wrote:
Though I would suggest you look at the LogicT library instead of using
actual lists... Also, you may be interested in reading the LogicT
paper[2] or this paper[3] about search combinators in Haskell. Both
30 matches
Mail list logo
