Call for Papers: 1st International Workshop on Cyber Forensics and
Advanced Threat Investigations in Emerging Technologies (CFATI 2021)
in conjunction with the 5th International Conference on Networked
Systems (Netsys 2021) September 13- 16 2021, Lübeck, Germany
https://cfati3.conceptechint.net
Th
The Scotty web framework is currently seeking a new maintainer.
Please comment on this github issue if you are interested:
https://github.com/scotty-web/scotty/issues/234
___
Haskell mailing list
[email protected]
http://mail.haskell.org/cgi-bin/mailm
Announcing a new Haskell JSON RPC library, remote-json, that uses the remote
monad to bundle remote procedure calls, amortizing the cost of remote
execution. There are thee bundling strategies provided:
* weak (calls done one at a time),
* strong (calls bundled until a reply is needed, where
The Computer Science Department at Portland State University (PSU) is seeking
to hire faculty to work in the broad area of secure and trustworthy
cyberspace—including researchers who are applying formal methods, theorem
proving, or programming languages to security problems. We invite applicatio
On 15 Aug 2015, at 16:03, David Banas wrote:
>
> Hi all,
>
> Does anyone know why I’m getting redundant entries in my ‘cabal init’
> generated .cabal file:
>
> library
> exposed-modules: Language.Broker, Language.Broker
>
> ?
>
> Is it because I’m using a *.hsc file, as my source, and
* EXTENDED deadline for submission: 6th July
* Notification of acceptance: 14 July
Selection Committee
---
Andrew Kennedy, Microsoft Research Cambridge (chair)
Derek Dreyer, MPI-SWS, Saarbrucken
Stephanie Weirich, University of Pennsylvania
David Van Horn, University of
* Deadline for submission: 29 June
* Notification of acceptance: 14 July
Selection Committee
---
To include:
Andrew Kennedy, Microsoft Research Cambridge (chair)
Derek Dreyer, MPI-SWS, Saarbrucken
Stephanie Weirich, University of Pennsylvania
Dav
* Deadline for submission: 29 June
* Notification of acceptance: 14 July
Selection Committee
---
To include:
Andrew Kennedy, Microsoft Research Cambridge (chair)
Derek Dreyer, MPI-SWS, Saarbrucken
Kathy Gray, University of Cambridge
Dav
browser to
see latest versions. (The pages /now/ have caching prevention so this
should not be necessary again.)
And, it's nice to share your thoughts, don't you think?
-Andrew
On Fri, Dec 19, 2014 at 8:01 AM, Andrew Seniuk wrote:
> Sorry, that was my first Reddit post and I messed u
Sorry, that was my first Reddit post and I messed up.
Please use this link
http://www.reddit.com/r/haskell/comments/2pscxh/ann_deepseqbounded_seqaid_leaky/
-Andrew
On Fri, Dec 19, 2014 at 7:07 AM, Andrew Seniuk wrote:
> This trio of related packages explores strictness control in a variety
oper tracker if there's interest.
Any isssues (or comments), I'm here, or on the reddit discussion (or email).
Andrew Seniuk
rasfar on #haskell
___
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell
Kind Regards,
Andrew Seniuk
rasfar on #haskell
___
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell
Announcing blank-canvas 0.4.0, a Haskell binding to the complete HTML5 Canvas
API.
blank-canvas allows Haskell users to write, in Haskell, interactive images onto
their web
browsers, via a specialized JavaScript DSL.
First Example:
{-# LANGUAGE OverloadedStrings #-}
module Main where
import
Could you elaborate on how this is better/different from blaze-html?
I'm a bit confused - is it just the same thing but works with Haste, while
blaze-html doesn't? What's the main idea?
Thanks!
Andrew
On Wed, Jun 18, 2014 at 7:02 AM, Alberto G. Corona
wrote:
> Hi,
>
longer (published or unpublished) paper describing
completed work.
INVITED SPEAKERS:
Steve Zdancewic (University of Pennsylvania)
Magnus Myreen (University of Cambridge)
PROGRAM CO-CHAIRS:
Dan Ghica (University of Birmingham)
Andrew Kennedy (Microsoft Research Cambridge
ce package.
Hackage: http://hackage.haskell.org/package/hermit
Github (for bug reports): https://github.com/ku-fpg/hermit
Andrew Farmer
___
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell
Hi Derek,
Thanks for your comments. Yes, I am probably going to focus on making
it work as a web service and stay away from platform-specific mobile
apps. Not been thinking mobile much at all, since the quantities of
data are taxing even to my laptop, and also I'm inclined to believe
people are mo
quot;last upload" field which can replace
the version field. The codependency graph :) would be a nice metric
to add, I'll look into it. I remember seeing a package that does
this someplace on hackage. The +1 button is a good one!
In short I'll try to implement all these ideas, than
Somewhat lighter, using summarised module lists. A more sophistocated
UI with per-column filtering is in the works. I invite your comments.
Andrew
On Thu, Apr 26, 2012 at 4:05 PM, Andrew Seniuk wrote:
> Hello,
>
> This is to announce a provisional webpage to summarise hackage.ha
Should be fixed in that respect now, thanks again for pointing it out.
On Thu, Apr 26, 2012 at 4:23 PM, Andrew Seniuk wrote:
> Jonathan,
>
> On Thu, Apr 26, 2012 at 4:13 PM, Jonathan Daugherty wrote:
>>> Although I believe this is a complete list of all packages/modules in
t forgot to address it. It is
due to a false assumption on my part that the .cabal entries in the
00-index.tar file were in increasing version order.
I'll address this problem today.
Cheers,
Andrew
___
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell
s not
being maintained, and I was unable to rearouse the author's interest.
Feature requests and suggestions are welcome!
Kind Reg'ds,
Andrew Seniuk
[1] http://folk.ntnu.no/hammar/explore-hackage/
___
Haskell mailing list
Haskell@h
Linear Types in System F^o
Karl Mazurak, Jianzhou Zhao and Steve Zdancewic
*** F-ing Modules
Andreas Rossberg, Claudio Russo and Derek Dreyer
--
GENERAL CHAIR
Andrew Kennedy, Microsoft Research, Cambridge
PROGRAM CHAIR
Nick Benton, Microsoft Research, Camb
wic
*** F-ing Modules
Andreas Rossberg, Claudio Russo and Derek Dreyer
--
GENERAL CHAIR
Andrew Kennedy, Microsoft Research, Cambridge
PROGRAM CHAIR
Nick Benton, Microsoft Research, Cambridge
PROGRAM COMMITTEE
Gilles Barthe, IMDEA Software, Spain
5 October 2009 (Monday)
- Notification: 6 November 2009 (Friday)
- Final versions due: 15 November 2009 (Sunday)
- Workshop: 23 January 2010 (Saturday)
General Chair:
Andrew Kennedy, Microsoft Research, UK
Program Chair:
Nick Benton, Microsoft Research, UK
Program
Is there a list of projects that will be worked on during this, or how will
that work?
On Thu, May 21, 2009 at 5:39 PM, Brent Yorgey wrote:
> Hi all!
>
> We are in the early stages of planning a Haskell hackathon/get
> together, Hac φ, to be held this summer at the University of
> Pennsylvania, i
Positively brilliant. What else can be said? Time for Brent to sign a
"Haskell recipes" deal with O'Reilly (or whatever the next normal book
should be).
On Mon, Feb 16, 2009 at 4:29 AM, Brent Yorgey wrote:
> Hi all,
>
> If you've noticed the lack of a HWN this week, that's because I've
> been dog
Well-done! I've said for many months that we need a channel like this!
On Tue, Feb 3, 2009 at 7:15 PM, Philippa Cowderoy wrote:
> Hi folks. As I've been daft enough to get a few things rolling, it looks
> like it's fallen on me to announce the new IRC channel,
> #haskell-in-depth.
>
> #haskell ha
I would certainly join such a list. My only concer would be that
moderating such a list could be tricky. How do you judge when a
discussion has become "too technical"? And what do you do about it?
Force the members to take it to -cafe? Anyway, I like the idea of
having a more beginner-friendly list
ersity, Finland.
Program Committee
-
Bernhard Aichernig, Graz University of Technology, Austria
Andrew Butterfield (Chair), Trinity College Dublin, Ireland
Ana Cavalcanti, University of York, UK
Yifeng Chen, University of Durham, UK
Steve Dunne, University of Teesside, UK
Colin Fid
calculator - more flexible
and powerful than most others and in competition with mathematica and
mathcad etc.
(there is a large user pool!)
andrew
On 6 Sep 07 12 22, Andrew U. Frank wrote:
> On 5 Sep 07 23 28, Brandon S. Allbery KF8NH wrote:
> >
> > On Sep 5, 2007, at
On 5 Sep 07 23 28, Brandon S. Allbery KF8NH wrote:
>
> On Sep 5, 2007, at 21:10 , Tomi Owens wrote:
>
> > Prelude> let f (a,b) = a * floor (10/b)
> > Prelude> f(2,5)
> > 4
> >
> > This function works just as I want it to.
> >
> > Now I try creating a list:
> >
> > Prelude> [(a2+b2,a)| a
Henning,
This link is broken for me...
On 4/3/07, Henning Thielemann <[EMAIL PROTECTED]> wrote:
It was argued that people avoid Haskell because of terms from Category
theory like 'Monad'. This problem can now be solved by a wrapper which
presents all the WWW without monads! Start e.g. at
http
Martin,
Thanks for your work on this very interesting library. For the record,
I was able to build it here on an x86 architecture under ghc 6.6, but
only with -fglasgow-exts, and one other minor tweak. If anyone wants
details, let me know.
Andrew
On 4/2/07, Martin Erwig <[EMAIL PROTEC
, infinite streams, etc.).
On 3/28/07, Setzer, Sebastian (ext) <[EMAIL PROTECTED]> wrote:
Andrew Wagner wrote:
> Functional programming has long been recognized as an excellent
paradigm
> for Artificial Intelligence.
One reason why LISP is used for AI is (in my opinion, more important
than
Apologies to those of you who will see this announcement twice.
The time has come! Calling all Haskell programmers interested in AI!
I've established a new home base at
http://www.haskell.org/haskellwiki/AI . Functional programming has
long been recognized as an excellent paradigm for Artificial
I'm no expert, but I will point you to 2 links that I think will be
helpful on this topic on the wiki:
http://www.haskell.org/haskellwiki/Lifting (especially if you're
familiar with functors)
http://www.haskell.org/haskellwiki/Simple_StateT_use (for a simple
example with a monad transformer)
I'm
Andrzej,
I'd love to hear some of your thoughts on these things. I agree with
you about brute-force not being the best approach in haskell (or maybe
at all). I think we should switch to haskell-cafe, since that's where
much of this discussion has gone, and that's more for extended
discussions anyw
ed
support for typeclasses, compared to current practice. I wouldn't worry
much about the above error--but that said, I suspect your PState is a
type synonym, which as the error message says is forbidden (in Haskell
98).
Andrew
___
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell
n above an instance of MonadState ? (I
> always get kind errors ...)
Did you switch up the order of parameters or something? I don't get any
error using
instance MonadState Int Parser where ...
Andrew
___
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell
st ErrorT, and general Exceptions will escape.
See for example Oleg's test2.
Andrew
___
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell
what we should do.
Now it may be that the need for a filepath library is so great, and
"better" approaches sufficiently untested, that we should use whatever
exists and works right now. But that is a separate question.
Andrew
___
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell
; in a manner opposite
> from the rest of Haskell?
Perhaps it's better to think of '=' as asserting equality, than as
binding?
Andrew
___
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell
ublished by Springer as part of the Lecture Notes in Computer Science
series.
=== Programme Committee =
* Matthias Blume, Toyota Technological Institute at Chicago, USA
* Andrew Butterfield, /(Chair)/ Trinity College Dublin, Ireland.
* Clemens Grelck, University of Lübeck, Germany.
ublished by Springer as part of the Lecture Notes in Computer Science
series.
=== Programme Committee =
* Matthias Blume, Toyota Technological Institute at Chicago, USA
* Andrew Butterfield, /(Chair)/ Trinity College Dublin, Ireland.
* Clemens Grelck, University of Lübeck, Germany.
ted using unsafeInterleaveIO). As a relative newcomer
to Haskell, I got the impression that the "interact" style was always a
hack, discarded for good reason in favor of the IO monad. Is there a
strong case for interact?
Andrew
___
Haskell maili
2005 Submission deadline for post-refereeing process
* Dec 16th, 2005 Notification of acceptance/rejection
* Feb 3rd, 2006 Camera-ready papers due
== Program Committee ==
* Matthias Blume, Toyota Technological Institute, Chicago, USA
* Andrew Butterfield, (Chair) Trinity College Dublin, Irel
Pal-Kristian Engstad wrote:
On Wednesday 22 June 2005 05:38 pm, Andrew Ward wrote:
What would be the normal way for a Haskell programmer to handle the
typical shape example in beginner OO tutorials?
By not doing OO. You have to ask yourself, what is the purpose and/or benefit
of
am a c++ programmer by trade, only dabbling in Haskell when I was at
university, so it seems a disadvantage to me to not have dynamic binding
in Haskell 98.
What would be the normal way for a Haskell programmer to handle the
typical shape example in beginner OO tutorials?
Andrew
esirable for quick compile tests.
Andrew
___
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell
tance/rejection
* Feb 3rd, 2006 Camera-ready papers due
== Program Committee ==
* Matthias Blume, Toyota Technological Institute, Chicago, USA
* Andrew Butterfield, (Chair) Trinity College Dublin, Ireland.
* Clemens Grelck, University of Lubeck, Germany.
* Zoltan Horvath, Eotvos Lorand Univ
m a
I almost always end up defining it myself and use it to implement other
state transformers. I would do the same for other monad classes
(Writer, etc): provide a function that captures the general operation.
Andrew
___
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell
-> (a->Bool)
> combineTest :: (b->c->d) -> (a->b) -> (a->c) -> a -> d
> combineTest c t1 t2 = \a -> c (t1 a) (t2 a)
>
> (.&.) :: (a->Bool) -> (a->Bool) -> (a->Bool)
> (.&.) = combineTest (&&)
This can
morning, before coming to work, but the
results were inconclusive (I need to read the GHC manual to see what help
it gives for this and try again - looking at memory usage in Window's task
manager showed no significant change in memory use, even if I dropped
"tail" completely from the
now. When will this fucntional programming /
laziness deal finally become completely clear?
Cheers,
Andrew
--
` __ _ __ ___ ___| |_ work web site: http://www.ctio.noao.edu/~andrew
/ _` / _/ _ \/ _ \ / / -_) personal web site: http://www.acooke.org/andrew
\__,_\__\___/\___/_\_\_
t go with the idea.
Thanks,
Andrew
--
` __ _ __ ___ ___| |_ work web site: http://www.ctio.noao.edu/~andrew
/ _` / _/ _ \/ _ \ / / -_) personal web site: http://www.acooke.org/andrew
\__,_\__\___/\___/_\_\___| list: http://www.acooke.org/andrew
k this would be simple to implement in Prolog or Oz, for example,
where the last element of a list can be unbound. I assume the same is
possible in Haskell using laziness and closures.
However, I cannot nail it down. Can anyone help?
Apologies for the unclear description. If I could desc
rst vs breadth first copying
within the collector provide more realistic optimisation opportunities. I
believe there's been a fair amount of work on this, although specific papers
elude me at the mo.
Cheers
Andy
*****
* Andr
On Wed, Feb 18, 2004 at 02:45:15PM +0100, Daan Leijen wrote:
> On Wed, 18 Feb 2004 01:11:31 -0500, Andrew Pimlott <[EMAIL PROTECTED]>
> wrote:
> >After some pondering and fiddling, a version I like:
> >
> >notFollowedBy' :: Show a =>
On Wed, Feb 18, 2004 at 02:45:15PM +0100, Daan Leijen wrote:
> On Wed, 18 Feb 2004 01:11:31 -0500, Andrew Pimlott <[EMAIL PROTECTED]>
> wrote:
> >After some pondering and fiddling, a version I like:
> >
> >notFollowedBy' :: Show a =>
On Tue, Feb 17, 2004 at 04:57:34PM -0500, Andrew Pimlott wrote:
> What about a more prosaic implementation:
>
> notFollowedBy' :: Show a => GenParser tok st a -> GenParser tok st ()
> notFollowedBy' p= do res <-
be equivalent to:
> return ()
> presumably, because the failure was protected by the try combinator?
Or perhaps more accurately, the success (of p) was protected by the try!
Ie, the unexpected and the try together undid the tell-tale token
consumption of p.
Andrew
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
c'
Intutively, (aNoBC >> char 'b') should match "abe", but
*Main> parseTest (aNoBC >> char 'b') "abe"
parse error at (line 1, column 2):
unexpected "e"
expecting "c"
If you instead put the try around
Malcolm W - thanks for your comments. I did reply (nothing important),
but your university has my address blacklisted (dynamic ip). Sorry for
the on-list noise. Andrew
andrew cooke said:
[...]
> Halipeto generates web pages from templates (much like JSP, Zope TAL etc).
> It's
s? ;o)
- XML code is from HaXml (thanks very much!).
- Currently a simple text (file/directory) database is used, but care has
been taken (the IO monad is threaded through the code) to allow
intergration of an SQL backend.
Cheers,
Andrew
--
personal web site: http://www.acooke.org/andrew
personal
class, allowing now kinds of coordinates to be added more easily, for
example).
I hope to make public a gallery of images generated using the package
within the next week or so (which will probably be announced along with a
package for generating web pages from templates).
Andrew
--
personal web
the idea only to support "shell scripts" and not provide a
shell? - i was assuming you'd start ghci in a window and load this module
automatically when you open an xterm...)
andrew
Volker Wysk said:
> The equivalent HsUnix script looks like this:
>
> import HsUnix
&
is exercise gave great insight into the
"worse is better" philosophy.)
If you don't change this behavior, at least document it prominently
as a robustness sink! :-)
Andrew
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
this right. (Which proves the non-existence of reliable
non-trivial shell scripts!)
I have my own half-finished shell-in-Haskell that handles this. I
would be interested to know whether HsUnix does.
Andrew
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
utput from some function called with the arguments a b and c
Andrew
Graham Klyne said:
[...]
> hoped. Other packages, such as HaXml, seem to be more portable but as far
> as I'm aware are missing key functionality (notably XML namespace
> support).
[...]
--
personal web site: http
Ah. I just need to drop the context from the data type declaration.
Sorry,
Andrew
andrew cooke said:
>
> Hi,
>
> I'm trying to use type classes and suspect I've got confused somewhere
> down the line, because I've got to an error message that I don't
> und
s
f)' are
already in scope
(at least one must be universally quantified here)
When checking the existential context of constructor `Ctx'
In the data type declaration for `Context'
where line 60 is "data Context"
And I can't see what I've done w
nd how either of the suggestions you make will speed
up creation, though (I guess allocating less memory is faster). I'm
looking for a factor of tens of thousands improvement. But I will try
what you suggest.
Cheers,
Andrew
PS Thanks for the very speedy reply and thanks to whoever maintains the
Hi,
I have some code (http://www.acooke.org/andrew/ReadTest.hs) that reads
data from a file (an image in ppm format; example data (256*256 pixels) at
http://www.acooke.org/andrew/test.ppm) and stores it in an array of Word8
values. The aim is to read a file that contains 5000 * 5000 * 3 Word8
hope that's OK, because maybe
someone will find this info via Google one day and find it useful.
Cheers,
Andrew
Malcolm Wallace said:
> "andrew cooke" <[EMAIL PROTECTED]> writes:
>
>> - HaXml looks like it might do what I want, but
>> (1) seems tricky to inst
It appears that the Haskell XML Toolbox may be what I want -
http://www.fh-wedel.de/~si/HXmlToolbox/ - but any other suggestions would
be appreciated. Apologoies for relying on Haskell.org rather than
Googling (I'll mail the web page maintainers).
Cheers,
Andrew
andrew cooke said:
>
&g
at's why there doesn't seem to be anything?!
(I'm writing a simple tool that generates web pages from templates; the
tool data appears in attributes with a namespace (this is the standard
trick for mixing code generation with HTML in a way that web authoring
tools can parse). Hence the
Tomasz Zielonka said:
> On Thu, Nov 27, 2003 at 04:09:00PM -0300, andrew cooke wrote:
[...]
>> If I compile and run the code below, the file "foo" contains 10 lines
>> of output (as I would expect), but the file "bar" contains just 9 -
>> the final line
completely - my best guess is that it's
related laziness and the final result of the fold not being used.
However, in that case, I'm worried that the "join fix" isn't
guaranteed to work.
Please could someone explain what is happening and how I should
guarantee that the outp
from GHC, which would tell
me whether they are identical, I guess, but I was hoping for something
higher level (I suupose transformed Haskell code is too much to ask for?).
Should I be looking at some kind of debugging tool (never used a debugger
in Haskell)?
Thanks,
Andrew
PS Despite its sweet
terested to see the code, although it's not critical for me) - I work
shifts and won't have free time (this isn't work-related) until next
Wednesday (although I'm taking Saturday as a holiday to watch the ll3
webcast ;o).
Cheers,
Andrew
-
have in Haskell? I'm interested both in general
solutions (maybe some compilers do this anyway?) and in approaches to
structuring the program so that I can control caching in more detail.
Thanks,
Andrew
--
http://www.acooke.org/andrew
___
Ha
to worry about a pure declarative language
where support for anything "legacy" is a priority. Just a little bit.
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
hipped.
I still own the IP, though, so it may yet end up open source.
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
ng time.
As a matter of curiosity, do you have some examples as to when GHC
gets it wrong?
(We can move this to glasgow-haskell-users if you like.)
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
not be in a 1:1 correspondence
with OS threads.
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
G'day all.
On Wed, Aug 20, 2003 at 07:42:59AM +0200, Jan Scheffczyk wrote:
> I always thought that there is a tiny difference between "let" and "where":
They're semantically equivalent. See, for example:
http://haskell.org/onlinereport/decls.html#se
If the code instead was this:
let x = expensiveComputation foo in x + x
I would certainly hope that expensiveComputation wasn't called twice,
and even though the language doesn't guarantee it, I have already
written code that assumed it.
Cheers,
Andrew Bromage
G'day all.
On Sat, Aug 09, 2003 at 01:32:49AM +0200, Wolfgang Jeltsch wrote:
> ghci -fglasgow-exts -fallow-overlapping-instances compiles it without
> complaint
If it helps, ghci will complain the first time you actually try to use
it.
Cheers,
And
numeric types. There are problems with making it too fine-grained,
as well.
Until we find the "sweet spot", the problem is not solved.
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
an error a legitimate meaning doesn't always help the
programmer.
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
al behaviour quite quickly if
the programmer is not careful. Plus, what would cause this behaviour
is not their _use_ as such, but rather the number of modules imported
which have these overloaded operators defined.
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
l solution is to use an 'Additive' class
>
> class Additive a b c | a b -> c, c a -> b, c b -> a where
> (+) :: a -> b -> c
> class (Additive c b a) => Subtractive a b c where
> (-) :: a -> b -> c
Actually, that's not bad at all. It's ce
cation (unless the overloading can't be resolved
using type information). It'd make type checking NP-hard, but I
seem to recall that it's already more complex than that.
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
s.
While it makes sense that ($!) should have the same associativity as
($), I can't for the life of me figure out why ($) is right-associative.
There's probably a terribly good reason. Does anyone know what it is?
Cheers,
Andrew Bromage
___
G'day all.
On Fri, Jul 11, 2003 at 04:28:19PM -0400, Dylan Thurston wrote:
> Don't be silly [...]
Never!
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
ut that's what default() is for!
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
braries
in haskell-libs. Computable reals are definitely numbers, but they're
not even members of Eq.
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
G'day all.
On Tue, Jul 08, 2003 at 08:56:10AM +0100, Simon Peyton-Jones wrote:
> No it does not. As the paper explains.
Serves me right for playing with the toy before I read the manual.
Cheers,
Andrew Bromage
___
Haskell mailing lis
; tcs "let fix = (\\f . f (fix f)) in fix"
Not in scope: `fix'
Cheers,
Andrew Bromage
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
1 - 100 of 173 matches
Mail list logo
