#1820: Windows segfault-catching only works for the main thread
-+--
Reporter: simonmar |Owner: igloo
Type: bug | Status: new
#3317: Ctrl-C is not received during a call to runProcess
--+-
Reporter: judah |Owner: simonmar
Type: bug| Status: new
Priority: normal |
#3317: Ctrl-C is not received during a call to runProcess
--+-
Reporter: judah |Owner: igloo
Type: merge | Status: new
Priority: normal |
#3166: recompilation checking too optimistic about infix ops
-+--
Reporter: roland|Owner: simonmar
Type: bug | Status: closed
Priority: high
#3049: STM with data invariants crashes GHC
-+--
Reporter: simonpj |Owner:
Type: bug | Status: closed
Priority: normal|
#3327: Cannot paste into ghci on windows
+---
Reporter: boml | Owner:
Type: bug | Status: new
Priority: normal | Component: GHCi
Version: 6.10.3 | Severity:
#3323: panic: funArgTy
+---
Reporter: simonmar |Owner: simonpj
Type: bug | Status: new
Priority: normal |
#3316: Deadlock in non-threaded RTS with hPutBuf
-+--
Reporter: ganesh|Owner: simonmar
Type: bug | Status: new
Priority: normal|Milestone: 6.12.1
Component:
#3327: Cannot paste into ghci on windows
-+--
Reporter: boml | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
Component: GHCi |Version:
On Jun 24, 2009, at 02:27 , Sittampalam, Ganesh wrote:
Brandon S. Allbery KF8NH wrote:
Sure - but it hurts more when in some environments you get away with
it and others you don't.
You'll still have that though, it'll just be a different set of
environments. The next failure mode after this
| I would thus like to propose the following formalisation of the
| ExplicitForall extension:
What you suggest would be fine with me. Presumably ExplicitForall would be
implied by RankNTypes and the other extensions?
There is a danger of having too *many* choices.
On 23/06/2009 22:28, Bulat Ziganshin wrote:
i have started http://haskell.org/haskellwiki/GHC/Memory_Management -
not much written yet
You could link to the recent paper about the parallel GC, it has plenty
of information about the architecture of the GC (not just relevant to
parallel GC):
On 24/06/2009 07:33, Brandon S. Allbery KF8NH wrote:
On Jun 24, 2009, at 02:27 , Sittampalam, Ganesh wrote:
Brandon S. Allbery KF8NH wrote:
Sure - but it hurts more when in some environments you get away with
it and others you don't.
You'll still have that though, it'll just be a different
What you suggest would be fine with me. Presumably ExplicitForall would be
implied by RankNTypes and the other extensions?
Yes, that's the idea. Rank2Types, RankNTypes, PolymorphicComponents,
ScopedTypeVariables and LiberalTypeSynonyms would all imply
ExplicitForall.
There is a danger of
one thing that isn't so good is that we lack a library of GHC-related
papers. ideally, i just have to add a link to some GHC/Papers#GC that
contains everything ever published about this topic.
http://haskell.org/haskellwiki/Research_papers#Categories
On Jun 24, 2009, at 05:04 , Simon Marlow wrote:
There's one exception: if GHC is forced to use blocking mode on a
particular FD, and you're using the non-threaded RTS, then a large
write using hPutBuf may block all Haskell threads. There doesn't
seem to be much we can do about this, except
Announcing sendfile-0.1:
A library which exposes zero-copy sendfile functionality in a portable way.
http://hackage.haskell.org/package/sendfile-0.1
Right now it supports natively linux 2.6+ (maybe older too) and windows
2000+ -- on other platforms it will fall back seamlessly to a portable
Announcing happstack-0.3.2:
It was released several days ago to hackage, but here is the official
announcement!
List of recorded changes (many improvements were not documented):
* Modularization of the example application using the component system
* All packages now require Cabal = 1.6
*
I'm in.
Mick
On Tue, Jun 23, 2009 at 6:15 AM, Benjamin L.Russell
dekudekup...@yahoo.comwrote:
On Mon, 22 Jun 2009 17:12:22 -0400, Ryan Trinkle ryant5...@gmail.com
wrote:
[...]
I would like to take this opportunity to propose the creation of a
haskell-iphone mailing list, so that all
One question that is not clear in the documentation:Is JHC just a Haskell 98
compiler? Has some extensions?
2009/6/23 John Meacham j...@repetae.net
Hi, this is to announce the release of jhc 0.6.1. The jhc homepage with
distribution information is at http://repetae.net/computer/jhc/
The
=
Call for Participation
ACM SIGPLAN Haskell Symposium 2009
http://haskell.org/haskell-symposium/2009/
Edinburgh, Scotland, 3 September 2009
Hello,
I made a GCL compiler using Alex and Happy and now I'm making the
interpreter to that program. Here's the deal:
First of all, I'm no expert in the usage of monads. Now:
Whenever a show instruction is found in any GCL program while the
interpretation is being done it is supposed to print
Sorry, I just realized I sent the e-mail to the wrong mailing list. My bad!
On Thu, Jun 25, 2009 at 5:55 PM, Hector Guilarte hector...@gmail.comwrote:
Hello,
I made a GCL compiler using Alex and Happy and now I'm making the
interpreter to that program. Here's the deal:
First of all, I'm no
Hector Guilarte wrote:
I made a GCL compiler using Alex and Happy and now I'm making the
interpreter to that program. Here's the deal:
First of all, I'm no expert in the usage of monads. Now:
Whenever a show instruction is found in any GCL program while the
interpretation is being done it
On Wed, Jun 24, 2009 at 11:59:38AM +0200, Alberto G. Corona wrote:
One question that is not clear in the documentation:Is JHC just a Haskell 98
compiler? Has some extensions?
It is mainly a haskell 98 compiler, but does have several extensions.
However, not all of them correspond to GHC
| I would thus like to propose the following formalisation of the
| ExplicitForall extension:
What you suggest would be fine with me. Presumably ExplicitForall would be
implied by RankNTypes and the other extensions?
There is a danger of having too *many* choices.
What you suggest would be fine with me. Presumably ExplicitForall would be
implied by RankNTypes and the other extensions?
Yes, that's the idea. Rank2Types, RankNTypes, PolymorphicComponents,
ScopedTypeVariables and LiberalTypeSynonyms would all imply
ExplicitForall.
There is a danger of
Hi,
Does anybody know of a Haskell library for parsing .dot graph files?
(I know Andy Gill wrote dotgen for *generating* .dot files http://hackage.haskell.org/package/dotgen
.)
Thanks,
Lee
--
http://www.cs.indiana.edu/~lepike/
___
Haskell-Cafe
2009/6/24 Lee Pike leep...@gmail.com:
Hi,
Does anybody know of a Haskell library for parsing .dot graph files? (I
know Andy Gill wrote dotgen for *generating* .dot files
http://hackage.haskell.org/package/dotgen.)
Hi,
You might be interested in http://hackage.haskell.org/package/graphviz.
This is the weird code, please see line 61.
20 cpuNew :: IO CPU
21 cpuNew = do
22 self - meterNew
23 usage - newIORef $ CPUusage 0 0 0 0 0 0 0 0
24 self `on` realize $ do
25 forkIO $ redraw self usage
33 return ()
34 return self
35 where
56 redraw self usage = do
57
Chaddaï Fouché пишет:
On Fri, Jun 19, 2009 at 1:51 PM, Fernandquarantedeu...@yahoo.fr wrote:
but the parser one needs to write must parse ByteStrings instead of Strings
(that is, something like having a Parsec Bytestring () type, unless I'm
completely misunderstanding the situation). My
Magicloud Magiclouds wrote:
61 threadDelay 1 -- ten seconds, but it just refresh crazy!
That's because threadDelay expects microseconds, not milliseconds. Try
multiplying your delay by 1000.
HTH,
Martijn.
___
Haskell-Cafe mailing list
Thanks for looking into this.
Your code does give me 2 firings. But not when I replace [] with
FMList. See the attached code.
Rules.hs
Description: Binary data
Sjoerd
On Jun 23, 2009, at 5:59 PM, Simon Peyton-Jones wrote:
| I have a rewrite rule as follows:
|
| {-# RULES
|
Up to GHC 6.10.2, there used to be an installation chapter in the GHC
User's Guide (see Chapter 2. Installing GHC at
http://www.haskell.org/ghc/docs/6.10.2/html/users_guide/installing-bin-distrib.html).
This section was very useful, for example, in determining whether it
was possible to move the
On Jun 24, 2009, at 03:47 , Benjamin L.Russell wrote:
Up to GHC 6.10.2, there used to be an installation chapter in the GHC
User's Guide (see Chapter 2. Installing GHC at
I believe this is being superseded by the Haskell Platform installer.
--
brandon s. allbery
On Mon, Jun 22, 2009 at 7:27 PM, Tim Sheard she...@cs.pdx.edu wrote:
My idea is to use types to ensure that any
sequence of operations adheres to a path on
a finite state automata. For example
if we wanted to implement the following
automata (This needs to read in a fixed width font)
On Tue, Jun 23, 2009 at 8:28 PM, Brandon S. Allbery KF8NH
allb...@ece.cmu.edu wrote:
On Jun 23, 2009, at 05:20 , Luke Palmer wrote:
obsolete now, will your code still work when they are gone? Will it still
work when the typeclass resolution algorithm is obsoleted by a superior
algorithm
Hi,
Read often throws runtime errors, which breaks the robust of the
problem. How to deal with it? Without lost too much proformance (so
reads is a no).
At least, if its error could be catched, that'd be better.
--
竹密岂妨流水过
山高哪阻野云飞
___
Haskell-Cafe
2009/6/24 Magicloud Magiclouds magicloud.magiclo...@gmail.com:
Hi,
Read often throws runtime errors, which breaks the robust of the
problem. How to deal with it? Without lost too much proformance (so
reads is a no).
Hi,
You might be interested in
I'm using tuples to index into a `UArray` created like this:
fromList :: [(Word16, Word16)] - UArray (Word16, Word16) Bool
fromList list= runSTUArray $ do
arr - empty
return arr
empty :: ST s (STUArray s (Word16,
On Wednesday 24 June 2009 5:40:28 am Magicloud Magiclouds wrote:
Hi,
Read often throws runtime errors, which breaks the robust of the
problem. How to deal with it? Without lost too much proformance (so
reads is a no).
At least, if its error could be catched, that'd be better.
There was
Hello Jason,
Wednesday, June 24, 2009, 1:55:24 PM, you wrote:
array ((0,0),(65535,65535)) [((0,0),*** Exception: Error in array index
What do I need to do to debug this?
i think that it may be a bit too large for internal Int indicies:
safeIndex :: Ix i = (i, i) - Int - i - Int
At the moment, there are at least three ways people use graph
data-structures in Haskell:
* Data.Graph from containers
* Data.Graph.Inductive from FGL
* A custom job (usually using something like IntMap).
If we look on Hackage, there are a number of graph-related packages
there,
On Mon, 22 Jun 2009, Neil Brown wrote:
I would agree to a certain extent about the warnings. Name shadowing is not
really a problem, and it's often hard to avoid shadowing names that already
exist in an imported module (why shouldn't I have a variable named lines?).
If you follow this
I'm part of a fairly large team. I'm the only person on the team who's
done more than Project Euler problems in Haskell, so we'll probably
only use Haskell if there's a library or program that does exactly
what we need for some task. Likely we'll be using Perl and Python, and
C++ if there's any
That depends on the monad library. In transformers it would be:
(Monad m, Eq a) = a - StateT [a] m Bool
State s is just a type synonym for StateT s Identity, so this works for State
as well.
I like it, it is simpler than the one using MonadState.
I had read many tutorials and wiki
On Fri, May 08, 2009 at 04:36:41PM +0200, Stephan Friedrichs wrote:
When looking for an xor function, I found one in Data.Bits but couldn't
use it for Bool, because Bool is no instance of Bits and of Num (which
would be necessary, because it's class (Num b) = Bits b). My question
is: Why not?
Hi!
I'd like to announce immediate availability of a first beta release of darcs
2.3. There is a number of improvements and bugfixes over the last stable
release (2.2). Moreover, work has been done on performance of darcs whatsnew
for large repositories. This has also introduced a slight risk of
It's not usual, but it is allowed to have values of
structs passed between functions directly instead of
using pointers: (...)
Would it be possible to allow that in Haskell FFI (...)
There are a couple problems with this. First, the storage layout for a
given C struct may be radically
Bulat Ziganshin bulat.zigans...@gmail.com writes:
array ((0,0),(65535,65535)) [((0,0),*** Exception: Error in array index
i think that it may be a bit too large for internal Int indicies:
Aren't you asking for a 4G element array here, so with a 32bit
wraparound the array will be some
Magicloud Magiclouds magicloud.magiclo...@gmail.com wrote:
Read often throws runtime errors, which breaks the robust of the
problem. How to deal with it? Without lost too much proformance (so
reads is a no).
At least, if its error could be catched, that'd be better.
You might like to try
Last year I teamed up with a guy at work who had no knowledge of any
functional programming language whatsoever. Actually, his main dialect is
C++.
We ended up trying to use plain C++, but it took us almost 6 hours to put
network and string decoding routines to work. I gave up mainly because in
Switching to Haskell Cafe; I hope you read that list, John, since it
seems more suitable to this kind of question.
John Meacham wrote:
Hi, this is to announce the release of jhc 0.6.1. The jhc homepage with
distribution information is at http://repetae.net/computer/jhc/
The main new feature
Advice, yes; leadership, no. [guidance is ambiguous between those two!]
Simon
From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On Behalf Of John A. De Goes
Sent: 23 June 2009 15:24
To: Simon Peyton-Jones; Haskell Cafe
Subject: Re: [Haskell-cafe] Haskell on the
Your FMLists are defaulting to Integer, so the rule (which
specifically mentions Int) doesn't apply. Simon's code doesn't have
this problem because of the explicit signature on upto; you could do
the same by limiting singleton to Int.
-- ryan
On Wed, Jun 24, 2009 at 12:44 AM, Sjoerd
2009/06/24 Ketil Malde ke...@malde.org:
Bulat Ziganshin bulat.zigans...@gmail.com writes:
array ((0,0),(65535,65535)) [((0,0),*** Exception: Error in array index
i think that it may be a bit too large for internal Int indicies:
Aren't you asking for a 4G element array here, so with a
Am Mittwoch 24 Juni 2009 18:50:49 schrieb Jason Dusek:
2009/06/24 Ketil Malde ke...@malde.org:
Bulat Ziganshin bulat.zigans...@gmail.com writes:
array ((0,0),(65535,65535)) [((0,0),*** Exception: Error in array
index
i think that it may be a bit too large for internal Int indicies:
Hello Jason,
Wednesday, June 24, 2009, 8:50:49 PM, you wrote:
Aren't you asking for a 4G element array here, so with a 32bit
wraparound the array will be some multiple of 4GB
It's a bit array. It'd be 512MiB.
internally it's indexed by plain Int :)
when library checks index boundary, it
2009/06/24 Daniel Fischer daniel.is.fisc...@web.de:
Am Mittwoch 24 Juni 2009 18:50:49 schrieb Jason Dusek:
2009/06/24 Ketil Malde ke...@malde.org:
So in effect, you have a zero-length underlying array, but
the array implementation still keeps track of the real
indices and tries to
Ah, thanks.
It turns out that this works:
transform t l = error urk
but this doesn't:
transform t l = FM $ error urk
So it has something to do with the newtype FMList. They are probably
already gone when rewrite rules fire?
Sjoerd
On Jun 24, 2009, at 6:32 PM, Ryan Ingram wrote:
Hello Jason,
Wednesday, June 24, 2009, 9:51:59 PM, you wrote:
It's too bad that indexes are `Int` instead of `Word` under
actually, it doesn't matter too much except for Bools. 2gb array is a
way too much for most 32-bit systems, in particular, in windows 32-bit
program cannot alloc memory
2009/06/24 Bulat Ziganshin bulat.zigans...@gmail.com:
Wednesday, June 24, 2009, 9:51:59 PM, you wrote:
It's too bad that indexes are `Int` instead of `Word` under
actually, it doesn't matter too much except for Bools. 2gb
array is a way too much for most 32-bit systems, in
particular, in
On Jun 24, 2009, at 05:11 , Johan Tibell wrote:
Oleg writes:
In this design, the operation of creating a socket and connecting it
are bundled together -- which is very common and is the case for
System V, I think (where it is called openActive, I think). If you
for
I don't believe that is
That sounds sufficient -- basically, just tell the sponsored developer
where to look to get started, give him a rough idea of what needs to
be done, and let him sort out the rest.
Regards,
John A. De Goes
N-Brain, Inc.
The Evolution of Collaboration
http://www.n-brain.net|
So now I get to write a blog post called Compact Bit Arrays
in Haskell or some such.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello Jason,
Wednesday, June 24, 2009, 10:15:14 PM, you wrote:
particular, in windows 32-bit program cannot alloc memory
block larger than 2gb
But on everything but Windows...
well, people never thought about such things until they really get
into using 4gb RAM with 32-bit systems :)
--
On Jun 24, 2009, at 07:43 , papa.e...@free.fr wrote:
I had read many tutorials and wiki articles, and saw nowhere that
there were different implementations of what seemed to be standard
libraries.
Alternative monad libraries are still fairly new, and there's a lot of
discussion still
Hi,All,
Construct a list:
[0,0.1..1]
|| || || || || || ||__ Hugs 98: Based on the Haskell 98 standard
||___|| ||__|| ||__|| __|| Copyright (c) 1994-2005
||---|| ___|| World Wide Web: http://haskell.org/hugs
|| ||
This looks like Hugs defaulting to a different type to ghci,
specifically, Hugs is defaulting to one of the high precission types
like CReal or Rational, while ghci is defaulting to Float or Double.
Bob
On 24 Jun 2009, at 21:03, Linker wrote:
Hi,All,
Construct a list:
[0,0.1..1]
Hello Linker,
Wednesday, June 24, 2009, 11:03:19 PM, you wrote:
Construct a list:
[0,0.1..1]
floats are newspeak: 2*2 may be more than 4 or less than 4 :)
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
___
On Wed, Jun 24, 2009 at 8:16 PM, Brandon S. Allbery KF8NH
allb...@ece.cmu.edu wrote:
The BSD socket protocol is explicitly driven by a state machine, btw, but
it's a fairly complex one. Also, it's generally described in terms of the
kernel's view, which includes states you normally can't
One thing I'd really like to see, now that I'm thinking about it, is
to drop the dependency on the ./configure step when building network.
If I can figure this out without changing how Network.Socket works
now, would that be something we could merge into the package?
I've love to see a Build-Type
On Wed, Jun 24, 2009 at 9:15 PM, John Van Enk vane...@gmail.com wrote:
One thing I'd really like to see, now that I'm thinking about it, is
to drop the dependency on the ./configure step when building network.
If I can figure this out without changing how Network.Socket works
now, would that
I'll take a swing at it. :) If it's as easy as it was to get HsOpenSSL
to build without the ./configure (on windows even!), it shouldn't be
too bad.
PS: If any one has contact with the maintainers of HsOpenSSL, poke
them for me. I'd like my patch included. :)
On Wed, Jun 24, 2009 at 3:25 PM,
Am Mittwoch 24 Juni 2009 21:05:50 schrieb Thomas Davie:
This looks like Hugs defaulting to a different type to ghci,
specifically, Hugs is defaulting to one of the high precission types
like CReal or Rational, while ghci is defaulting to Float or Double.
Bob
No, hugs is displaying with fewer
A search in google images for sockets state diagram comes up with some
relatively good ones
http://images.google.com/images?hl=enum=1sa=3q=sockets+state+diagrambtnG=Search+images
Most of them are just the TCP connection state logic, but I'm sure I'd find
others there if I looked closer.
- Job
On
On Wed, Jun 24, 2009 at 9:43 PM, Job Vranish jvran...@gmail.com wrote:
A search in google images for sockets state diagram comes up with some
relatively good ones
http://images.google.com/images?hl=enum=1sa=3q=sockets+state+diagrambtnG=Search+images
Most of them are just the TCP connection
Linker wrote:
Hugs [0,0.1..1]
[0.0,0.1,0.2,0.3,0.4,0.5,0.6,0.7,0.8,0.9,1.0]
Prelude [0,0.1..1]
[0.0,0.1,0.2,0.30004,0.4,0.5,0.6,0.7,0.7999,0.8999,0.]
Just floating point errors. In this case, you may be able to get away
with something
Deniz Dogan schrieb:
2009/6/20 Stephan Friedrichs deduktionstheo...@web.de:
Deniz Dogan wrote:
I (too) often find myself writing code such as this:
if something
then putStrLn howdy there!
else if somethingElse
then putStrLn howdy ho!
else ...
[...]
Hello,
I made a GCL compiler using Alex and Happy and now I'm making the
interpreter to that program. Here's the deal:
First of all, I'm no expert in the usage of monads. Now:
Whenever a show instruction is found in any GCL program while the
interpretation is being done it is supposed to print
(Also taking this to the -cafe)
Hector Guilarte wrote:
I made a GCL compiler using Alex and Happy and now I'm making the
interpreter to that program. Here's the deal:
First of all, I'm no expert in the usage of monads. Now:
Whenever a show instruction is found in any GCL program while
On Wed, Jun 24, 2009 at 3:21 AM, Ivan Lazar
Miljenovicivan.miljeno...@gmail.com wrote:
there, each of which uses one of the above approaches. However, for the
more generic packages that operate _on_ graphs (rather than using
graphs as an internal data structure),
...
I thus propose that we
On Jun 24, 2009, at 16:04 , Johan Tibell wrote:
On Wed, Jun 24, 2009 at 9:43 PM, Job Vranish jvran...@gmail.com
wrote:
A search in google images for sockets state diagram comes up with
some relatively good ones
Simon, et al,
It might be interesting to look at
CALhttp://labs.businessobjects.com/cal/as a non-blank-slate
beginning for Haskell on the JVM. To my mind there are
three things that this needs to make it a real winner:
- Much, much better Java interop. Basically, the bar to meet here is
Kamil Dworakowski wrote:
The timing per expression however
showed something useful, 70% of the time was being spent around
determining membership in the known words dictionary (Data.Map). There
are about 30 000 items in the dictionary.
Right... Python uses hashtables while here I have a tree
Yay, someone read my proposal! :p
2009/6/25 Andrew Hunter andrewhhun...@gmail.com:
This is a good idea and one I support. (I think I've been told before
that this has been tried w/o a lot of success, but, well...) My
primary concern is this: you built your class for things that operate
on
Kamil Dworakowski wrote:
On Jun 22, 10:03 am, Eugene Kirpichov ekirpic...@gmail.com wrote:
Hey, you're using String I/O!
nWORDS - fmap (train . map B.pack . words) (readFile big.txt)
This should be
WORDS - fmap (train . B.words) (B.readFile big.txt)
By the way, which exact file do you use
On Wed, Jun 24, 2009 at 11:43:25AM -0400, David Barton wrote:
the targets mechanism is extensible at run-time and I have included
native unix, win32, osx-intel and osx-powerpc targets. But certainly
many more interesting ones are possible. Some I have tested have been a
nokia N770 as a target
Magnus Therning wrote:
Erik de Castro Lopo wrote:
In Haskell there is an easy way around this. Variables can
be name a, a', a'' and so on. Since these aid in clarity
without forcing you to think up new variable names, I would
suggest that its a good idea to fix these warnings.
+1 (depending
On Wed, Jun 24, 2009 at 10:23:29AM -0300, Maurício wrote:
However, isn't just knowing the size and alignment enough to
write a generic struct handler that, by using the appropriate
calling convention, is going to work with any struct? If not,
I agree with you it's really not worth it (as we
I am looking for a good (preferably lazy) way to implement some kind of
best-first search.
The problem is, the expansion of the 'best' node in the search space
forces other 'inferior' nodes to expand too. So my function
expand :: Node - ([Node],(Node - [Node]))
does not only return some
Thanks for answering so fast.
Yes, GCL == Guarded Command Language... It is for an assigment I have in my
Languages and Machines Course.
About the nicer/Haskellier solution you proposed: If there is a way of
printing right in the moment the Interpreter finds the show instruction then
I don't
Luke Palmer wrote:
On Tue, Jun 23, 2009 at 2:20 AM, papa.e...@free.fr wrote:
Simple: the definition of MonadState uses those extensions.
Thanks, yes it helps and explains all. :^)
I suppose then that if -XFlexibleContexts is indeed required by the
standard libraries, it is a safe extension,
Hello haskell-cafe,
I would like to announce the pre-release of full-sessions,
yet another implementation of session types in Haskell.
Session types are used to statically check the safe and
consistent use of communication channels
according to protocols.
Our work is quite similar to the
Incidentally, I am looking for someone well versed in the JVM who wants
to help spearhead a JVM back end for jhc. If someone is interested,
please join the j...@haskell.org mailing list. Jhc already cross compiles
to a number of architectures so it may be an easier task than a ghc
port. (or good
On Wed, Jun 24, 2009 at 7:53 PM, Martin Hofmann
martin.hofm...@uni-bamberg.de wrote:
I am looking for a good (preferably lazy) way to implement some kind of
best-first search.
Here's what I came up with.
bestFirst :: (Ord o) = (a - o) - (a - [a]) - [a] - [a]
bestFirst rate edges = go
Jason Dusek wrote:
Why is `Int` used in so many places where it is
semantically wrong? Not just here but also in list indexing...
Indices/offsets can only be positive and I can't see any good
reason to waste half the address space -- yet we encounter
this problem over and over again.
On Wed, Jun 24, 2009 at 7:56 PM, Hector Guilarte hector...@gmail.comwrote:
Thanks for answering so fast.
Yes, GCL == Guarded Command Language... It is for an assigment I have in my
Languages and Machines Course.
About the nicer/Haskellier solution you proposed: If there is a way of
Thanks for the quick and short answer. Maybe I am already thinking too
complicated.
However, exactly your given preconditions I can not satisfy.
The preconditions for bestFirst rate edges xs are: map rate xs must
be nondecreasing,
Here lies my problem, because edges must also be applied to
Martin Hofmann wrote:
Thanks for the quick and short answer. Maybe I am already thinking too
complicated.
However, exactly your given preconditions I can not satisfy.
The preconditions for bestFirst rate edges xs are: map rate xs must
be nondecreasing,
Here lies my problem, because edges
1 - 100 of 104 matches
Mail list logo
