HAppS' IxSet library gives relational operations but does not have a SQL
interface. Am thinking of changing the name to RelSet to make the
functionality clear. You can use HAppS.State to give ACID properties
to operations on this data structure.
-Alex-
On 8/1/09 12:15 AM, Günther Schmidt w
HAppS LLC has part-time and full-time positions open for haskell programmers to:
* improve the open source haskell codebase at HAppS.org
* implement infrastructure to make it work well in Amazon S3/EC2 environments
* make http://pass.net reliable enough to be used by live apps
* build the ma
DrIFT is a preproxessor so it makes the build process more complex. I'd like to
find a pure-haskell solution or a TH solution that doesn't require more build
complexity.
-Alex-
On Tue, 10 Apr 2007, Marc Weber wrote:
Right now, you can largely do the same thing, but you have to write the X
That is why I prefer JSON and XSLT as template languages. The client side
developer can't use them to do business logic and they are both idiomatically
closer to the world in which the client side developer lives.
Once we get the auto-conversion to XML/JSON working in HAppS, life gets really
declarations and that is good.
-Alex-
On Wed, 21 Mar 2007, Jules Bean wrote:
S. Alexander Jacobson wrote:
Conceptually, I think what I really want is the data structure equivalent
of type inference. Just as I don't want to be forced to declare my
function types, I don't want to be
There is currently a happs mailing list. I see no reason not to
broaden the subject matter to haskell web development in general.
The URL for the list is http://groups.google.com/group/happs
-Alex-
On Tue, 20 Mar 2007, David House wrote:
On 20/03/07, Marc Weber <[EMAIL PROTECTED]> wrote
haskell always sort the labels before
generating the type code.
-Alex-
On Thu, 15 Mar 2007, [EMAIL PROTECTED] wrote:
[Please follow-up to [EMAIL PROTECTED]
S. Alexander Jacobson wrote:
HLists require you to define Labels and basically only use label
values that are themselves either sc
Right now I am looking at using either SYB (Scrap Your Boilerplate) or
HList Records to eliminate boilerplate for:
* parsing URLEncoded strings into application data structures
* generating XML/JSON from application data structures
* handling adding new fields to serialized data structures
Having just done a major refactor of the HAppS HTTP API to make it
much much easier to use, I am now thinking about simplifying the
current boilerplate associated with XML serialization and state
deserialization.
In the case of XML, Currently the developer must manually write
ToElement for ev
row (a,c) (b,c)
When Arrow is defined like this, rather than write instances you just
various evaluation functions for the Arrow GADT.
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Tue, 5 Dec 2006, Neil M
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
. I've begun to think of use of implicit types as a sign a
"bad smell" in the code and if I have used one somewhere, I try to
eliminate it because doing so usually results in better code overall.
-Alex-
______
S. Alexander Jacob
how do I pass a polytype* wpn?
-Alex-
* I would have thought the word was polymorphic, but you obvoiusly
know.
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Mon, 27 Nov 2006, Simon Peyton-Jones wrote:
Implic
As long as we are doing this, perhaps we should also discourage the
use of (head list)?
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Fri, 17 Nov 2006, Donald Bruce Stewart wrote:
dons:
dmhouse:
On
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Mon, 26 Jun 2006, Simon Peyton-Jones wrote:
Simon and I have been thinking about fixing this, and we think we might
actually do so for GHC 6.6. Your message
ilman/listinfo/haskell-cafe
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
providing:
* an SMTP client,
* an HTTP client,
* or a Telnet client?
There's a significant amount to these protocols, over and above the socket
layer.
Thanks,
Lyle Kopnicky
______
S. Alexander Jacobson tel:917-770-6565
On Thu, 8 Jun 2006, Joel Reymont wrote:
On Jun 7, 2006, at 10:20 PM, S. Alexander Jacobson wrote:
Does this make sense?
Makes sense but almost sounds too good.
:-) To be clear, the separation via binary streams has not yet been
implemented. I plan to do so only if I need it. If you get
x out at 1m requests per second. Note: I don't know what the cap
is, but reading binary from stdin is orders of magnitude simpler than
prcessing HTTP and TCP so getting a 100x improvement should not be
that hard.
Does this make sense?
-Alex-
_______
list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskel
client
lib to talk to paypal so YMMV.
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Thu, 25 May 2006, Joel Reymont wrote:
Folks,
I'm curious about how the following bit of Lisp code would transla
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
ing your application code.
-Alex-
__________
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Wed, 12 Apr 2006, Graham Klyne wrote:
I'm interested, but I don't have the time to look right now (or in the next
couple of months, as far as I can see).
What would real
ay hi.
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I am looking for Haskell code that does credit card authorization?
e.g. paypal website pro does not supply a Haskell lib.
Does anyone know where to find something like this?
-ALex-
__
S. Alexander Jacobson tel:917-770-6565 http
Has anyone written a pure haskell xslt interpreter? If not, how
difficult would it be to do so?
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe
to rethink your business logic.
FYI: I actually created a Haskell application server based on this
logic called HAppS (see http://happs.org) and am in the process of
getting binaryIO added to it.
-Alex-
______
S. Alexander Jacobson tel:91
;t work because there's no instance Read ThreadId.
Cheers,
Simon
On 21 September 2005 21:14, S. Alexander Jacobson wrote:
More particularly, is there a getAllThreadIds function somewhere?
-Ale-
On Wed, 21 Sep 2005, S. Alexander Jacobson wrote:
Is the general pattern to write all thre
More particularly, is there a getAllThreadIds function somewhere?
-Ale-
On Wed, 21 Sep 2005, S. Alexander Jacobson wrote:
Is the general pattern to write all threadIds to a file, and then have a
separate function that takes the file and kills them?
Or is there something more clever?
-Alex
Is the general pattern to write all threadIds to a file, and then have
a separate function that takes the file and kills them?
Or is there something more clever?
-Alex-
On Wed, 21 Sep 2005, Simon Marlow wrote:
On 16 September 2005 20:42, S. Alexander Jacobson wrote:
If I am running a
If I am running a server interactively. (using ghci).
Is there any way to kill its running threads without terminating the
interpreter?
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
a better example
http://www.intertwingly.net/blog/2005/07/22/REST-vs-API
On Mon, 12 Sep 2005, S. Alexander Jacobson wrote:
On Mon, 12 Sep 2005, Joel Reymont wrote:
Why not XML-RPC?
REST is more appropriate for the applications on which I work.
See http://webservices.xml.com/pub/a/ws/2002
On Mon, 12 Sep 2005, Joel Reymont wrote:
Why not XML-RPC?
REST is more appropriate for the applications on which I work.
See http://webservices.xml.com/pub/a/ws/2002/02/20/rest.html
-Alex-
__
S. Alexander Jacobson tel:917-770-6565
/searchpath.org/default.map
src/MyApp.hs
$ MyApp
HAppS and the chat applications are still works in progress, but I
have this running successfully internally already!
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.co
(=<<) :: (Monad m) => (a -> m b) -> m a -> m b
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Mon, 16 May 2005, Tomasz Zielonka wrote:
On Mon, May 16, 2005 at 02:57:42PM -0400, S. Alexand
What is the name of the monadic generalization of concatMap?
In which lib is it located?
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
Am I misunderstanding the regex docs?
*MyMod> subRegex (mkRegex "\\." ) "foo.bar" "blah"
"foo*** Exception: Text.Regex.Posix.regcomp: error in pattern
-Alex-
______
S. Alexander Jacobson te
Would it be harder/easier better/worse to use Linux device drivers
from hOp/House as opposed to writing new disk I/O stuff in Haskell?
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Tue, 22 Mar 2005, Keean
I am concerned about making mistakes.
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
_
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
__
Wow! Did you also implement tcp in Haskell?
Does hOp or House also have the ability to write to disk?
(With HAppS, I've gotten rid of the AMP part of LAMP, it would be
really cool to get rid of the L as well!)
-Alex-
______
S. Alex
unction in System.Directory?
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ation datatypes.
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Peter Simons told me that someone has written a DNS resolver in
Haskell that doesn't rely on an FFI call. I'd love to look at it if
it is available...
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexja
ly safe, though
not implicit:
coerceRight :: Either a b -> Either c b
coerceRight (Right b) = Right b
Regards,
Stefan
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Ha
pechecker
then claims my type is wrong. How do I fix that?
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Wed, 2 Mar 2005, Henning Thielemann wrote:
On Wed, 2 Mar 2005, Ben Lippmeier wrote:
You can play games
uct values just for type checking reasons, especially if your
type has many more constructors than (Either a b).
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Hask
ase this question as why not
simplify instance declarations to be:
instance ToSet where
toSet = Set.fromList
And let the typechecker take care of figuring out what instance is
being specified here?
-Alex-
__
S. Alexander Jacobson
not an instance of Table, I don't see why there should be
an overlap.
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haske
pS is available at
http://HAppS.org/HAppS/happs.tar.gz. HAppS is also available via
darcs:
darcs get http://happs.org/HAppS
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Ha
Is there documentation somewhere about how to name
third party libraries?
For example, if I have HTTP and SMTP libraries,
what should I call them?
-alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
s...
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
t know what this error even means. But it
goes away if I put the union implementation in the
instance rather than in the class.
Bot these error messages seem unreasonable. Can
someone clarify?
Note: I am using GHC 6.2.2
-Alex-
__________
27;t know why it
would. Then this stack is consumed by the rest of
the program.
Can you provide some guidance on interpreting this
data?
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Wed, 26 Jan 2005, Sim
..10]::[(Int,Int)]
theMap = Map.fromList zipped
-Alex-
__________
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
S. Alexander Jacobson writes:
After actually running the correct test, I am
still getting semi-ridiculous spa
p.empty zipped
fm = length $ Map.keys produce
main = print $ fm
Can someone tell me what I can do to make this
more efficient?
-Alex-
__________
S. Alexander Jacobson tel:917-770-656
anyone help?
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Tue, 25 Jan 2005, Jorge Adriano Aires wrote:
Just did a search after my last post and learned
that FiniteMap is bad. Discoverd that Data.Map is
the
used minimal memory.
I think Map picked up a lot of speed because it
doesn't spaceleak, but am not sure.
-Alex-
On Tue, 25 Jan 2005, Ketil Malde wrote:
"S. Alexander Jacobson" <[EMAIL PROTECTED]> writes:
Just did a search after my last post and learned that FiniteMap is
bad
-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
main = print $ fm
And it apparently consumes more than 45MB of heap
and won't run unless I give it at least 3M of
stack space.
I assume I doing something wrong here, but have
no idea what it is.
-Alex-
______
S. Alexander Jacobson te
or which is causing a stack overflow...
What sort of code causes that?
-Alex-
__________
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Mon, 24 Jan 2005, Iavor Diatchki wrote:
hi,
programs compile with GHC have a bunch of command l
9:09 -0500 (Eastern Standard Time), S.
Alexander Jacobson <[EMAIL PROTECTED]> wrote:
Thank you iavor. But the -K option doesn't appear
to work with ghci. And I guess the bigger
question is what sort of code causes a
stack overflow. If 5M is enough stack for most
programs then I obviously h
code causes that?
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
On Mon, 24 Jan 2005, Iavor Diatchki wrote:
hi,
programs compile with GHC have a bunch of command line switches.
you can see them by typing:
myProg
100k
item FiniteMaps. I don't think that should exceed
the memory on my laptop
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
Ha
I assume there is a standard name for this
class/function:
instance Foo [] where
foo [] = mzero
foo (x:_) = return x
instance Foo (Maybe x) where
foo Nothing = mzero
foo Just x = return x
-Alex-
__
S. Alexander
Hmm cool. Binary does not appear in the GHC
docs... Is it new?
-Alex-
On Thu, 9 Dec 2004, Duncan Coutts wrote:
> On Thu, 2004-12-09 at 11:04 -0500, S. Alexander Jacobson wrote:
> > Or is there a better way to (de-)serialize
> > FiniteMaps?
>
> There's a neat trick tha
series (time
interval model). Is there some pre-existing
data structure that does this or do I need to roll
my own?
Or is there a better way to (de-)serialize
FiniteMaps?
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http
on't understand how makeList
could produce this error...
-Alex-
______
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://w
Oops, I just found the examples directory.
So the next question is: Is there a way to use
DRift directly from GHCI? If I have to hmake
regularly, that will get annoying fast.
-Alex-
On Wed, 27 Oct 2004, S. Alexander Jacobson wrote:
> Does someone have an example of how to use DRIFT
&
Does someone have an example of how to use DRIFT
to convert a Haskell type into XML?
The documentation appears rather sparse...
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
to
reconstruct all its in memory state?
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman
s threads that way?
If the OS does run threads that way, are you
saying that forkOS is *very* inefficient (or does
the forkOS implementation in e.g. GHC solve the
problems you describe)?
-Alex-
__________
S. Alexander Jacobson tel:917-770
which OS thread is
> used to make foreign calls. See this paper we submitted to the Haskell
> Workshop this year:
>
> http://www.haskell.org/~simonmar/papers/conc-ffi.ps.gz
> Hope that sheds some light.
Ah. Very interesting. Thank you.
-Alex-
___
the
framework and use these features. I'll post
when the design is more proven and its time to
reach those performance levels.
-Alex-
_____
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
emptive?
-Alex-
_________
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel:917-770-6565 http://alexjacobson.com
On Wed, 23 Jun 2004, Thomas Hallgren wrote:
> Simon Marlow wrote:
>
> >It's a hard problem. Trying t
keXMVar (XMVar lock mvar) val =
withMVar lock (\_->tryTakeMVar mvar)
But, I think it would be more sane simply to
have a tryReadSampleVar somewhere.
-Alex-
_____
S. Alexander Jacobson mailto:[EMAIL PROTE
he lib functions
(modifyMVar and tryPutMVar) are atomic but seem to
require that you know in advance the MVar's state.
Is there a solution to this or do I have to
refactor?
-Alex-
_________
S. Alexander Jacobson ma
do waitQSem logSem; y <- x; signalQSem logSem; return y
as follows:
withLogSem $ rotate curLogPos
Am I misunderstanding QSem?
-Alex-
_____
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel:917-77
verhead for a simple
operation.
Is there a better way or is forkIO so efficient
that I shouldn't care?
-Alex-
_________
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel:917-770-6565
(where all I care about is throughput)?
-Alex-
_
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel:917-770-6565 http://alexjacobson.com
___
Haskell
book about multi-media
apps in Haskell (I've seen a chapter somewhere
from Conal Elliot) but I don't remember what it
was.
-Alex-
_________
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel:917-770-6565
know know if
this is an in-principle problem or just an in-fact
problem.
-Alex-
_____
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel:917-770-6565
But isn't the point of this code that you don't
need that type signature? If I knew in advance
that it was an Integer then I wouldn't need to
passs "Integer" in the list.
-Alex-
On Thu, 29 Apr 2004, Chung-chieh Shan wrote:
> On 2004-04-28T23:33:31-0400, S. Ale
I don't think this works. I just tried it with:
main = print $ lookupRead 1 [(1,("Integer","100"))]
How would Haskell know that typ actually does
equal typeOf?
-Alex-
_________
S. Alexander Jacobson
t right now, thats not possible because
I need to be able to (read) them.
-Alex-
_________
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel:917-770-6565 http://alexjacobson.com
On Mon, 26 Apr 2004,
knowing our code will work at arbitrary
scale or the ecstacy of having it run fast today?
Put differently, would you rather cope with
hardware limitations today or software limitations
tomorrow?
-Alex-
_____
S. Alexander Jacobson
knowing our code will work at arbitrary
scale or the ecstacy of having it run fast today?
Put differently, would you rather cope with
hardware limitations today or software limitations
tomorrow?
-Alex-
_____
S. Alexander Jacobson
t
that also handles side-effects correctly right
now. It is part II of the rdbms, appserver,
web/mail server triad that I plan to use for a
variety of different web apps.
_____
S. Alexander Jacobson mailto
-
_
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel:917-770-6565 http://alexjacobson.com
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
My point is that I am reading in name/value pairs
and once I know the name, I know the type of the
value, but I don't want to have to pass that
information programatically to the point in the
code where I am doing the read.
-Alex-
On Mon, 12 Apr 2004, Sven Panne wrote:
> S. Alexander
I mean catch the read exception without escaping
all the way out to the IO monad.
-Alex-
On Mon, 12 Apr 2004, S. Alexander Jacobson wrote:
> I want to read strings that look like "2" or
> "hello" into values of type Integer or String.
> The problem is that read re
ively, to catch a read
exception, and do something sane?
-Alex-
_________
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel:917-770-6565 http://alexjacobson.com
n't deduce
context for (>>>). I don't understand why, but
I've tried a variety of permutations of
constraint declarations (m b needs to be a Monad
as well...).
-Alex-
_____
S. Alexander Jacobson mailto
to a
useful beginners page once I reach the point where
I think I can create a useful document.
_
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel:917-770-6565 http://alexjacobson.com
ve already made
these mistakes. Oh well.
-Alex-
_________
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel:917-770-6565 http://alexjacobson.com
___
Haskell-Ca
String?
-Alex-
_________
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel:917-770-6565 http://alexjacobson.com
On Tue, 23 Mar 2004, Jon Fairbairn wrote:
> On 2004-03-23 at 16:58EST "S. Alexander Jacobson&q
t the notion of being
able to guarantee a roundtrip in and out of an
arbitrary datatype seems useful and powerful.
-Alex-
On Tue, 23 Mar 2004, Jon Fairbairn wrote:
> On 2004-03-23 at 16:58EST "S. Alexander Jacobson" wrote:
> > Implementing Reverse from before, I am running
&
When checking kinds in `Monad (Reverse a s)'
In the instance declaration for `Monad (Reverse a s)'
I have no clue what this error message means.
-Alex-
_________
S. Alexander Jacobson mailto:[EMAIL PROTECTED]
tel
Monad
library, but nothing there looks like it. Instead
all I can find are special purpose things like
fromJust and even uglier stuff for Either.
-Alex-
_____
S. Alexander Jacobson mai
assume this
problem is sufficiently common that there is a
well worked out idiom for this such that I don't
have to hand-code and prove inverse functions for
all my data structures. I just don't know what it
is.
-Alex-
_____
S.
1 - 100 of 109 matches
Mail list logo
