r...@cse.unsw.edu.auHi,
Does DPH resolve this issue or are SIMD primitives an orthogonal issue?
I might take a look at this ticket if it is still relevant.
Cheers,
Vivian
DISCLAIMER
This transmission contains information that may be confidential. It is
intended for the named addressee only.
No, I don't think its subsumed by DPH at all. I'm ignorant of the details, but
my sense is: go for it!
Simon
From: glasgow-haskell-bugs-boun...@haskell.org
[mailto:glasgow-haskell-bugs-boun...@haskell.org] On Behalf Of Alexander McPhail
Sent: 26 October 2010 10:01
To: r...@cse.unsw.edu.au;
#4431: SpecConstr doesn't specialise
-+--
Reporter: rl|Owner:
Type: bug | Status: merge
Priority: normal|
#4436: Render multi-line strings more prettily in Template Haskell
---+
Reporter: simonpj | Owner:
Type: bug | Status: closed
Priority: normal|
#4428: Local functions lose their unfoldings
-+--
Reporter: rl|Owner:
Type: bug | Status: new
Priority: normal
#4439: GHC doesn't detect trivial complete pattern with the combination of
ExistentialQuantification and ViewPatterns
-+--
Reporter: batterseapower|Owner:
Type: bug
#4414: scc001 fails: one SCC entered 0 times; another not mentioned when
optimisation is on
-+--
Reporter: igloo |Owner: simonmar
Type: bug | Status: new
#4428: Local functions lose their unfoldings
-+--
Reporter: rl|Owner:
Type: bug | Status: new
Priority: normal
#4138: Performance regression in overloading
-+--
Reporter: simonmar |Owner: igloo
Type: bug | Status: new
Priority: high
#2159: Use a more efficient representation than [DynFlag]
-+--
Reporter: igloo |Owner:
Type: bug | Status: new
#4138: Performance regression in overloading
-+--
Reporter: simonmar |Owner: igloo
Type: bug | Status: new
Priority: high
#4424: Dynamically set -hide-all-packages is being ignored.
-+--
Reporter: nominolo |Owner: simonmar
Type: bug | Status: patch
Priority: normal|
#4308: LLVM compiles Updates.cmm badly
-+--
Reporter: dterei|Owner: dterei
Type: bug | Status: new
Priority: normal|
#4427: hGetBuf sometimes reads fewer bytes than required
---+
Reporter: rl |Owner: simonmar
Type: bug | Status: new
#4308: LLVM compiles Updates.cmm badly
-+--
Reporter: dterei|Owner: dterei
Type: bug | Status: new
Priority: normal|
#4441: NCG miscompiles Double - Float - Double
-+--
Reporter: dterei| Owner:
Type: bug | Status: new
Priority:
#4441: NCG miscompiles Double - Float - Double
-+--
Reporter: dterei| Owner:
Type: bug | Status: new
Priority:
#4441: NCG miscompiles Double - Float - Double
-+--
Reporter: dterei| Owner: dterei
Type: bug | Status: new
Priority:
#4441: NCG miscompiles Double - Float - Double
-+--
Reporter: dterei|Owner: dterei
Type: bug | Status: new
Priority:
DPH doesn't provide SIMD primitives. Both DPH and vector could greatly benefit
from having them available, though. It would be fantastic if you could add them.
Roman
On 26 Oct 2010, at 10:00, Alexander McPhail haskell.vivian.mcph...@gmail.com
wrote:
Hi,
Does DPH resolve this issue or are
#4308: LLVM compiles Updates.cmm badly
-+--
Reporter: dterei|Owner: dterei
Type: bug | Status: new
Priority: normal|
#4442: Add unaligned version of indexWordArray#
-+--
Reporter: tibbe | Owner:
Type: feature request | Status: new
Priority: normal|
#4441: NCG miscompiles Double - Float - Double
-+--
Reporter: dterei|Owner: simonmar
Type: bug | Status: new
Priority:
#4443: Don't require users to use undefined
-+--
Reporter: basvandijk| Owner:
Type: proposal | Status: new
Priority: normal| Component:
#: SPECIALISE pragma rejected; regression
-+--
Reporter: igloo |Owner:
Type: bug | Status: new
Priority: highest |Milestone:
#4443: Don't require users to use undefined
-+--
Reporter: basvandijk| Owner:
Type: proposal | Status: new
Priority: normal| Component:
#: SPECIALISE pragma rejected; regression
-+--
Reporter: igloo |Owner:
Type: bug | Status: new
Priority: highest |Milestone:
#3877: Require XOverlappingInstances for the most specific instance only
+---
Reporter: traz161616 | Owner:
Type: feature request| Status: new
#4241: Optimization causes HUnit to behave incorrectly
--+-
Reporter: beej175560 | Owner:
Type: bug | Status: closed
Priority: high
#4437: unregistered language extensions
---+
Reporter: duncan| Owner:
Type: bug | Status: closed
Priority: normal| Milestone:
#3557: SIMD operations in GHC.Prim
-+--
Reporter: guest |Owner: vivian
Type: feature request | Status: new
Priority: normal|Milestone: _|_
#4445: Sometimes exit() is called instead of stg_exit()
-+--
Reporter: augustss | Owner:
Type: bug | Status: new
Priority: normal|
On Tue, Oct 26, 2010 at 12:21 AM, Johan Tibell johan.tib...@gmail.com wrote:
On Sun, Oct 24, 2010 at 2:02 AM, Johan Tibell johan.tib...@gmail.com wrote:
I noticed that indexWordArray# only allows for aligned reads (by
forcing the offset to be in words, rather than in bytes.) Is it
possible to
In the case of overlapping instance declarations, GHC currently requires the less specific instance to be compiled with
OverlappingInstances for the more specific instance to be usable. This means that, for example, if you write
type ChessBoard = Array (Int,Int) Piece
there is no way to
Hi,
can't remember to have been hit by it; but changing would mean that
library maintainers can act more conservatively. Otherwise one needs to
be able to guess if an instance might be overlapped.
The new version wouldn't require that, yes?
Gruss,
Christian
* John Smith volderm...@hotmail.com
The Heterogeneous Tool Set supports HasCASL for specification
of Haskell programs, and uses Isabelle for proving
http://www.dfki.de/sks/hets
Moreover, the Programatica project has an expressive logic
called P-logic, and tools supporting it:
http://programatica.cs.pdx.edu/
Best, Till
Am
Would someone like to make a Haskell Wiki page to summarise the responses to
this thread?
Simon
| -Original Message-
| From: haskell-boun...@haskell.org [mailto:haskell-boun...@haskell.org] On
Behalf Of
| Till Mossakowski
| Sent: 26 October 2010 11:38
| To: haskell@haskell.org
Haskell functions may be verified interactively and/or automatically
with Expander2 (http://fldit-www.cs.uni-dortmund.de/~peter/Expander2.html
).
Induction, coinduction, narrowing and extendable sets of
simplification rules admit proofs and computations at various levels
of automation.
Dear all:
I am pleased to announce the initial release of mutable-iter[1], an
extension to the iteratee package which uses mutable buffers. This allows
for iteratees to act upon a mutable buffer, which means that processing can
occur without performing any extra allocations. This may be useful
Hello
I would change you Alex specification to this:
$digit = 0-9-- digits
$alpha = [a-zA-Z] -- alphabetic characters
$eol = [\r\n]
$any = [^$eol]
tokens :-
$eol { tok $ \_ - Eol }
$any+ { tok $ \s - Str s }
The complementation
2010/10/25 Gregory Collins g...@gregorycollins.net
Andrew Coppin andrewcop...@btinternet.com writes:
Hypothesis: The fact that the average Haskeller thinks that this kind of
dense
cryptic material is pretty garden-variety notation possibly explains why
normal people think Haskell is
Hi,
Am Sonntag, den 24.10.2010, 15:56 +0200 schrieb Simon Hengel:
It would be convenient to have a page which would list all the HP packages
with their versions. The release page [2] only has a list of packages
whose versions has changed since the last release, as I understood.
It
Regardless, 7zip (LGPL) can do it. But you have to first inzip, and then
untar as a seperate step.
This is pretty far off topic, but you can actually unpack it in a single
run. If you use the GUI version of 7z (a.k.a. the 7zip File Manager) you can
open the .tar.gz and it will list a single .tar
On 24.10.2010 03:38, wren ng thornton wrote:
On 10/23/10 4:53 PM, Alexey Khudyakov wrote:
On 23.10.2010 05:11, wren ng thornton wrote:
I'd rather see,
class Additive v where -- or AdditiveMonoid, if preferred
zeroV :: v
(^+^) :: v - v - v
class Additive v = AdditiveGroup v where
negateV :: v
Hi all,
I would like to teach a small section on polytypism/genericity in the
functional programming using Haskell course I'm teaching. I won't, though,
unless I can assign an actual programming exercise in polytypic programming,
however brief. Can anybody recommend a functioning compiler that I
Hi Mulhern,
I would like to teach a small section on polytypism/genericity in the
functional programming using Haskell course I'm teaching. I won't, though,
unless I can assign an actual programming exercise in polytypic programming,
however brief. Can anybody recommend a functioning compiler
Some questions about Haddock usage:
1. Haddock executable and library are a single hackage package,
but GHC seems to include only the former (haddock does not
even appear as a hidden package anymore). Is that intended?
2. Naively, I'd expect Haddock processing to involve three stages:
lexer works fine, problem is in happy parser.
2010/10/26 Stephen Tetley stephen.tet...@gmail.com
Hello
I would change you Alex specification to this:
$digit = 0-9-- digits
$alpha = [a-zA-Z] -- alphabetic characters
$eol = [\r\n]
$any = [^$eol]
tokens
The lexer was wrong - but it was the lexer function not the lexer spec
- try the one below.
Note that you have to take 'len' chars from the original input.
Previously you were taking the whole of the rest-of--input:
lexer :: (TheToken - P a) - P a
lexer f input@(_,_,instr) =
case alexScan
Hello café,
I have a little DSL in my program as follow.
Now I'd like to add a Map constructor in it. Thats where I would need help!
data Obs a where
AllPlayers :: Obs [Int]
Plus :: (Num a) = Obs a - Obs a - Obs a
And:: Obs Bool - Obs Bool - Obs Bool
Vote
Hello again café,
I have a command line program that takes input from various handles
(actually network sockets) like this:
s - hGetLine h
etc.
I'd like to unit test this. How can I do?
I'd like to inject data on the handle so that all the input chain is tested.
How are command line
Hello Dupont,
If your code follows good style and has kept as much code out of IO as
possible, you should be able to easily unit test the pure portions of your
code. Otherwise, classic integration tests, by setting up the network jigs
yourself, is standard.
Another little question:
How can I
Dear all,
For organizatorial reasons, we would like to ask that everyone interested in
attending the symposium on functional programming in industry (see below)
registers at
https://spreadsheets.google.com/ccc?key=0Ak5F96CGaVoJdFVsNWZPWTdyT3NYOWRnT25GUzdJSFEhl=en#gid=0
Kind Regards,
The
Dear all,
The link provided below is incorrect.
The correct link is
https://spreadsheets.google.com/viewform?hl=enformkey=dFVsNWZPWTdyT3NYOWRnT25GUzdJSFE6MQ#gid=0
Sorry for your inconvenience.
Begin forwarded message:
From: Jeroen Janssen jejan...@gmail.com
Date: 26 oktober 2010 18:30:58
On 26 October 2010 18:07, Dupont Corentin corentin.dup...@gmail.com wrote:
But how can I write the evaluator for Map?
Where do values for PlayerNumber come from? Unless I'm mistaken, the
only thing that Map can be used with is Obs [PlayerNumber], a list of
values PlayerNumber which we have no
Hello all,
I've recently taken over maintenance of MissingPy, and pushed version
0.10.5 to hackage[1]. This includes two notable improvements:
- fix build errors for python = 2.5
- allow calling into multi-threaded python code (requires python = 2.3).
I'm trying to provide support for as many
Hey Chris!
Values for PlayerNumber are acquired at evaluation time, from the state of
the system.
I have not included the evaluation of AllPlayers.
Here how it looks:
evalObs AllPlayers = return . pure = gets players
But when you build your Obs, you have yet no idea how much players it will
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).
On 25/10/2010 11:01 PM, Lauri Alanko wrote:
On Mon, Oct 25, 2010 at 10:10:56PM +0100, Andrew Coppin wrote:
Type theory doesn't actually interest me, I just wandered what the
hell all the notation means.
That sounds like an oxymoron. How could you possibly learn what the
notation means without
On Tue, Oct 26, 2010 at 5:11 PM, Dupont Corentin
corentin.dup...@gmail.com wrote:
Hello again café,
I have a command line program that takes input from various handles
(actually network sockets) like this:
s - hGetLine h
etc.
I'd like to unit test this. How can I do?
If all you ever do
On 26/10/2010 11:33 AM, Joachim Breitner wrote:
Hi,
Until this is offered in an official position, this might be helpful if
you ignore the Debian-related columns:
http://people.debian.org/~nomeata/platform.html
That's quite useful. It doesn't list the version numbers for GHC itself
or for
Just curious if Haskell can or will generate cross-platform executable code,
e.g., generate code for Linux from a Windows machine.
Thanks,
Hong
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 26 October 2010 19:29, Andrew Coppin andrewcop...@btinternet.com wrote:
I don't even know the difference between a proposition and a predicate.
A proposition is an abstraction from sentences, the idea being that
e.g. Snow is white, Schnee ist weiß and La neige est blanche are
all sentences
Great thanks! All work right now.
2010/10/26 Stephen Tetley stephen.tet...@gmail.com
The lexer was wrong - but it was the lexer function not the lexer spec
- try the one below.
Note that you have to take 'len' chars from the original input.
Previously you were taking the whole of the
On 26/10/2010 07:54 PM, Benedict Eastaugh wrote:
On 26 October 2010 19:29, Andrew Coppinandrewcop...@btinternet.com wrote:
I don't even know the difference between a proposition and a predicate.
A proposition is an abstraction from sentences, the idea being that
e.g. Snow is white, Schnee ist
On Oct 26, 2010, at 12:43 PM, Andrew Coppin wrote:
Propositional logic is quite a simple logic, where the building
blocks
are atomic formulae and the usual logical connectives. An example
of a
well-formed formula might be P → Q. It tends to be the first
system
taught to undergraduates,
On 26 October 2010 20:43, Andrew Coppin andrewcop...@btinternet.com wrote:
Propositional logic is quite a simple logic, where the building blocks
are atomic formulae and the usual logical connectives. An example of a
well-formed formula might be P → Q. It tends to be the first system
taught
Instead of answering your question directly, I'll give you some code
for a different DSL:
data Exp ref a where
EVar :: ref a - Exp ref a
ELam :: (ref a - Exp ref b) - Exp ref (a - b)
EAp :: Exp ref (a - b) - Exp ref a - Exp ref b
-- simple data structures
EPair :: Exp ref a
On Tue, Oct 26, 2010 at 11:11 AM, Dupont Corentin
corentin.dup...@gmail.com wrote:
Hello again café,
I have a command line program that takes input from various handles
(actually network sockets) like this:
s - hGetLine h
etc.
I'd like to unit test this. How can I do?
I'd like to inject
On 10/26/10 8:51 AM, Alexey Khudyakov wrote:
On 24.10.2010 03:38, wren ng thornton wrote:
I don't care much about the name of the class, I'd just like support for
monoids, semirings,... when they lack a group, ring,... structure.
Then what about following type class hierarchy? I think it
On 27/10/2010, at 7:29 AM, Andrew Coppin wrote:
I didn't say people think Haskell is scary because type theory looks crazy.
I said people think Haskell is scary because the typical Haskeller thinks
that type theory looks *completely normal*. As in, Haskellers seem to think
that every
Hi all,
I was just looking for mail libraries on hackage. You know libraries
where I can construct an email, or retrieve on from the server.
With retrieving an email I mean something with a bit more structure than
a String, or, God help me, a ByteString.
Where are we on this subject? I
You have to figure out here how you can use the function which is the argument
to map.
It seems you want to end up with a function of type a - Evaluator b, to be
used as an argument to mapM.
One idea is to add a new constructor Var to represent variables, and something
like
evalVar :: Obs b -
On 27/10/2010, at 8:43 AM, Andrew Coppin wrote:
Already I'm feeling slightly lost. (What does the arrow denote? What's are
the usual logcal connectives?)
You mentioned Information Science, so there's a good chance you know something
about Visual Basic, where they are called
AND
On Oct 26, 2010, at 4:21 PM, Richard O'Keefe wrote:
Number theory would probably be out
except maybe in a 2nd or 3rd year course leading to cryptography.
Number theory is one of those weird cases. They are discrete
structures, but advanced number theory uses a lot of complex analysis
On 27/10/2010, at 12:55 PM, Alexander Solla wrote:
Difference equations show up in Knuth's Concrete Mathematics, his tome on
discrete mathematics. The theory of difference equations is the discrete
analogue to the theory of differential equations. Surprisingly, the
Does anybody know of any utilities in haskell for reading and writing HDF5
files?
Other number crunchy formats? Thanks.--Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I just release mime-mail[1], which can construct multipart messages.
Michael
[1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/mime-mail
2010/10/27 Günther Schmidt gue.schm...@web.de:
Hi all,
I was just looking for mail libraries on hackage. You know libraries where I
can
I'm currently working on a pretty-printer for lazy text [1] values,
basing the API on the wl-pprint [2] package.
[1]: http://hackage.haskell.org/package/text
[2]: http://hackage.haskell.org/package/wl-pprint
In terms of API decisions, there are a few things I'm not sure of and
am wondering what
Hi all,
I want use TH write some function like below:
data DataType = StringT
| IntT
| CharT
parse :: [(String,DataType)] - (TypeA, TypeB, ... TypeN)
Example:
parse [(string, StringT), (001, IntT), (c, CharT)]
will return:
(string, 001, 'c')
So how
Hi,
I think you may want to over think your types again.
Especially your Evaluator-Monad, and maybe your Map constructor.
The Problem is, due to your use of Either and the need for evalObs to
finally transform from Obs [a] type to Evaluator [a] you will end
up in another Monad for Either:
Ah, it's too early in the morning...
There is still some room to simplify (e.g. fuse the liftE (map ...)
ops).
Here a simpler Version:
evalObs (Map f obs) = liftE (map (evalObs.f.Konst)) (evalObs obs)
=
either (return.Left)
82 matches
Mail list logo
