by our work of (A)FRP, an embedded language.
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Yes, but in that case the specific implementations are required to be
denotationally equal to the default versions.
Yes, obviously. My only point was that I believe () should remain
a class operation.
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED
Please find enclosed the call for papers and demos for AADEBUG 2003:
Fifth Int. Workshop on Automated and Algorithmic Debugging,
Ghent, Belgium, September 8-10, 2003
Apologies for multiple copies.
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED
regards,
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
AADEBUG'2003
Fifth Int. Workshop on Automated and Algorithmic Debugging
Ghent, Belgium, September 8-10, 2003
Call for papers and demos
Over the past
of
the discussion shortly.
All the best,
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
would look
at options pertinent to itself.
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
is a bit more flexible in that it can be
applied to a subset of the bindings in a do-construct.)
Best regards,
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL PROTECTED]
http
-MonomorphismRestriction #-}
saving typing in the common case.
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
to a new, uniform base-line language
that everyone can agree upon. And then the process can start over again! ;-)
Best regards,
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL
when GHC is looking for files.
Actually, I suggested putting it *after*. But putting it before might
be quite nice, actually. So credit where credit is due!
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED
or as little as you like, and you can call the top-level directory
whatever you like, including A.B, since the compiler does not care about
that name.
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
___
Glasgow
to best organize their source code.
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
, not be too hard to structure
the makefile to deal with that.
Regards,
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo
It's all bad once that VPATH word gets mentioned ;).
Granted!
But other work-arounds can be even worse!
And again, if an implementor for some reason thinks he or she could benefit
from using a mechanism like VPATH, it's good if that's not too painful.
/Henrik
--
Henrik Nilsson
Yale
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
nice to me and is part of what
we suggested. The only extra addition would be to associate prefixes
with directories in the search path. Is that really complicated?
Regards,
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED
,
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
in the interest of facilitating writing portable code, then
the various Haskell implementation also have to agree on this rule, and
making that rule as simple and as intuitive as possible seems like a good
idea.
All the best,
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
Hello Haskell-users,
I am planning to add some extensions to Hugs/Gofer to make it even
more usable. Possibly so that it can be used for things that currently
Perl and Tcl are popular for.
I would like to hear from people doing or interested in similar things.
Among my (still wooly) plans
Dear friends!
We've dealed with funtional programming since last semetre. Until now we've
worked with Gofer, but Gofer is small. It isn't possible to compile and run big
programms with Gofer.
Is there any bigger compiler for DOS or Windows? If yes, where can I get it?
Please
Will a random reduction order always terminate if there is
any reduction order that will terminate?
I am also interested in pointers into the litterature (preferrably
by FTP).
/Sverker
x)
instance (Bounded a, Enum a) = FromInt a where
fromInt x = succ (minBound x) x
---
I would be very interested and grateful for any comments on these and related
subjects. (Please try to be polite about my ignorance, though, if possible...)
Sverker Nilsson
----
Simon L Peyton Jones wrote:
The point is, if I *want* to have several behaviours in one run I can
always use this second technique. But Haskell as it now stands prevents
me from using the first, even when I *don't* want several behaviours in one
run. I'd be prepared to pay the pain if I
Simon Peyton Jones wrote:
It was Just Too Painful to pass the flags everywhere. For example, deep in
some dark corner of the transformation system there's a constant that
says how big a function body can be before GHC inlines it. Threading
the command-line arguments all the way to that site
timeStarted = performOnceBeforeMain (getCurrentTime)
Just like that one would do with unsafePerformIO, but with
safer semantics (hopefully) and blessed by Standard Haskell.
I see some serious problems:
a = (performOnceBeforeMain m1,performOnceBeforeMain m2)
In which order
I just tested the strides program in hbc.
It runs out of space in it too. :-(
A natural consequence of the current implementations of Haskells??
Sverker
length[1 .. n] seems to run in constant space (that is, space
independent of n), as expected.
However, length[1 ..] runs out of
they did it like this...
Sverker Nilsson
- Michael Hobbs
Fergus Henderson wrote:
On 10-May-2000, Sverker Nilsson [EMAIL PROTECTED] wrote:
Relevance for Haskell would be that you wouldnt be able to fork a
program written in C into a protected environment (functional
sandbox?) and know that its result would depend only on its input
arguments
PROTECTED]
To join, just goto http://www.haskell.org/mailman/listinfo/haskelldoc.
Best regards,
Armin Groesslinger [EMAIL PROTECTED]
Simon Marlow[EMAIL PROTECTED]
Henrik Nilsson [EMAIL PROTECTED]
Jan Skibinski [EMAIL PROTECTED]
Malcolm Wallace [EMAIL
ified
(the graphics library uses the names bracket and bracket_ itself for
other purposes), so you actually would have to import IO like this:
import qualified IO (bracket, bracket_) as Utils
I hope this helps.
/Henrik
--
Henrik Nilsson
Yale Universi
getting close to the
limit.
Best regards,
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Please find enclosed the Call For Papers for the 2004 Haskell Workshop,
to be held on 22 September in Snowbird, Utah, USA in association with
ICFP'04.
My apologies for multiple copies.
Best regards,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University
Call For Papers in PDF/HTML format.
My apologies for multiple copies.
Best regards,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]2004 Haskell Workshop
Snowbird
/HW2004/ for further details, including
Call For Papers in PDF/HTML format.
My apologies for multiple copies.
Best regards,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been scanned but we cannot
Apologies for multiple copies.
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been checked for viruses but the contents of an attachment
may still contain software viruses, which could damage your
Dear Colleague,
Please find enclosed the second call for papers for
Trends in Functional Programming (TFP) 2006.
My apologies for duplicate copies.
Best regards,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED
Dear Colleague,
Please find enclosed the second call for papers for
Trends in Functional Programming (TFP) 2006.
My apologies for duplicate copies.
Best regards,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED
apologies for duplicate copies.
Best regards,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been checked for viruses but the contents of an attachment
may still contain software viruses, which could
,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been checked for viruses but the contents of an attachment
may still contain software viruses, which could damage your computer system:
you are advised
Dear Colleague,
Please find enclosed the call for participation in
Trends in Functional Programming (TFP) 2006.
Registration deadline: 17 March.
My apologies for duplicate copies.
Best regards,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University
Hi Dominic,
Does anyone know where the source code for Yampa Arcade can be found?
It's included with the (now very old) afrp-0.4 distribution available
from
www.haskell.org/yampa
It's in the examples/SpaceInvaders directory.
Hope that helps!
All the best,
/Henrik
--
Henrik Nilsson
-workshop/1995
Thanks to Paul Hudak for helping locating the proceedings
and arranging for them to be scanned into PDF.
All the best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been checked
computer science.
For further information on the studentship and the project,
please contact Henrik Nilsson:
[EMAIL PROTECTED]
http://www.cs.nott.ac.uk/~nhn
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has
, Germany)
Kohei Honda(Queen Mary, University of London, UK)
Atsushi Igarashi (Kyoto University, Japan)
Suresh Jagannathan (Purdue University, USA)
Annie Liu (State University of New York at Stony Brook, USA)
Shin-Cheng Mu (Academia Sinica, Taiwan)
Henrik Nilsson
, UK)
Atsushi Igarashi (Kyoto University, Japan)
Suresh Jagannathan (Purdue University, USA)
Annie Liu (State University of New York at Stony Brook, USA)
Shin-Cheng Mu (Academia Sinica, Taiwan)
Henrik Nilsson (University of Nottingham, UK)
Michael Norrish(NICTA, Australia
discarded.
As you can see, there is a notion of proved properties in ScalaCheck,
which was introduced to support the exists method.
Of course, if the property is non-trivial ScalaCheck has a hard
time finding a proof.
Regards,
Rickard Nilsson
___
Haskell
get at the old
content before the old server is decommissioned?
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman
Loogen (Philipps University Marburg, DE)
Jay McCarthy(Brigham Young University, USA)
Henrik Nilsson (University of Nottingham, UK)
Rex Page(University of Oklahoma, USA)
Ricardo Pe~na (Chair) (Complutense University
the best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
This message and any attachment are intended solely for the addressee and may
contain confidential information. If you have received this message in error,
please send it back to me
, if you could forward to colleagues who might be interested,
I would be much obliged.
Apologies for multiple copies!
All the best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
This message and any attachment are intended solely
.
Apologies for multiple copies!
All the best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
This message and any attachment are intended solely for the addressee and may
contain confidential information. If you have received this message
the best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
This message and any attachment are intended solely for the addressee and may
contain confidential information. If you have received this message in error,
please send it back to me
extended:
* Abstracts: 8 February
* Full papers: 18 February
Apologies for multiple copies!
All the best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
This message and any attachment are intended solely for the addressee and may
contain
!
All the best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
This message and any attachment are intended solely for the addressee and may
contain confidential information. If you have received this message in error,
please send it back to me
: Alex McLean, University of Leeds
Program Chair: Henrik Nilsson, University of Nottingham
Publicity Chair: Michael Sperber, Active Group GmbH
Program Committee:
Sam Aaron, Cambridge University
David Duke, University of Leeds
Kathleen Fisher, Tufts University
Julie Greensmith, University of Nottingham
Workshop Chair: Alex McLean, University of Leeds
Program Chair: Henrik Nilsson, University of Nottingham
Publicity Chair: Michael Sperber, Active Group GmbH
Program Committee:
Sam Aaron, Cambridge University
David Duke, University of Leeds
Kathleen Fisher, Tufts University
Julie Greensmith
papers and demos is not far behind
(11 May).
Call for papers enclosed.
Apologies for cross-postings.
All the best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
This message and any attachment are intended solely for the addressee and may
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
This message and any attachment are intended solely for the addressee and may
contain confidential information. If you have received this message in error,
please send it back to me, and immediately delete
of Music, University of Leeds
Program Chair: Henrik Nilsson, University of Nottingham
Publicity Chair: Michael Sperber, Active Group GmbH
Program Committee
-
- Sam Aaron, Cambridge University
- David Duke, University of Leeds
- Kathleen Fisher, Tufts University
- Julie Greensmith
...@easychair.org
To: Henrik Nilsson n...@cs.nott.ac.uk
FARM 2015
3rd ACM SIGPLAN International Workshop on
Functional Art, Music, Modelling and Design
Vancouver, Canada, 5 September, 2015
The ACM SIGPLAN International Workshop on Functional Art
appreciated.
Thanks!
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
This message and any attachment are intended solely for the addressee
and may contain confidential information. If you have received this
message in error, please send
,
and the submission deadline is 25 January.
The call for papers can be found here:
http://eoolt.org/2016/index.php?id=cfp
and general information about EOOLT 2016 here:
http://eoolt.org/2016/
All the best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n
- program construction and verification, category theory,
recursion operators, coinductive types.
Henrik Nilsson - functional reactive programming, modelling and
simulation, probabilistic languages, and design and implementation of
declarative domain-specific languages in general.
See below
and
debugging
• Mathematical formalisms for simulation semantics
• Code generation for real-time systems, embedded
system, multi-core platforms, and distributed
systems
• Tools for analyzing or optimizing equation-based
models
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n
Nilsson - functional reactive programming, modelling
and simulation languages, domain-specific languages,
generalized notions of computation
Graham Hutton - program construction and verification,
category theory, recursion operators, coinductive types.
See http://www.nottingham.ac.uk
somehow thinks the system's ar
supports -input.
* The build system fails to detect when ar failed in the first
place.
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been scanned but we cannot
to ar.
Of course, it isn't just libHSreadline.a that does not get generated
correctly. So, in order to complete the build, I did a make clean
in the library subdirectory, and then restarted make from the top
level. That worked, as far as I know.
/Henrik
--
Henrik Nilsson
School of Computer Science
? (The test command, and its
shorthands, which seemed like the obvious choice at first, only seem
to allow testing for files being longer than 0.)
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been
sent, or something like it,
can be used as a work-around.
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been scanned but we cannot guarantee that it and any
attachments are free from viruses
in various
versions of ar now or in the future? That's why I thought
looking for concrete evidence that the right thing actually
had happened might be a more solid solution.
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED
,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been scanned but we cannot guarantee that it and any
attachments are free from viruses or other damaging content: you are
advised to perform your own checks
Hi Simon,
Simon Marlow wrote:
You need to 'autoreconf' rather than 'autoconf' these days.
Indeed, yes. That worked much better.
(Someone might want to update the comment in configure.ac that says
that autoconf should be used to process the file.)
Many thanks!
/Henrik
--
Henrik Nilsson
School
What do others think? It'd be dead easy to replace
`thing'
by
thing
in GHC's error messages, if that's what a majority want.
Double quotes looks preferable to me.
All the best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University
!
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
at all.
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
, because the operators may
come from various external libraries that one really would like to use.
The list comprehension interference is strictly confined to modules
where quasiquoting is enabled.
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
a syntactic shorthand for signatures with the
foralls mentioned explicitly.
Best regards,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been scanned but we cannot guarantee that it and any
attachments
.
Best regards,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been checked for viruses but the contents of an attachment
may still contain software viruses, which could damage your computer system
is useful.
I plan to tackle it in the next couple of months.
Would this also address how plain old Algebraic Data Types and type
classes work together? The issues seems related.
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
libraries really rely on this, it would be
nice to know that this is universally supported by all ar programs, linkers,
compilers, etc.
Alternatively, maybe one should reconsider how object files are named.
/Henrik
--
Henrik Nilsson
Yale University
Department of Computer Science
[EMAIL PROTECTED
are a rather surprising use of list literals.
Maybe. But not more surprising than how, say, numeric literals
are used in many EDSLs.
I also like George's proposal.
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
are not.
No, I agree completely with Malcolm: not taking the time to
quote ONLY what is of relevance to provide the immediately
relevant context for a point one wishes to make is a failure
of communication and, indeed, an abuse of other's time.
Thanks, Malcolm, well said!
/Henrik
--
Henrik Nilsson
School
something? E.g. is the idea that sharing of fields
only applies to fields of monomorphic type, i.e. whose type can be
declared globally?
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
to overloading of literals
for a specific case.
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
integrated
into the HP.
So, for (general) teaching, at least, stability over new features any
day.
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
This message and any attachment are intended solely for the addressee and may
contain
convenience of essentially
one-to-one mappings between module and file names, I think this
proposal would be a step in the right direction, if feasible.
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science
The University of Nottingham
n...@cs.nott.ac.uk
This message and any attachment
,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been checked for viruses but the contents of an attachment
may still contain software viruses, which could damage your computer system:
you are advised
, as the code would continue to work).
But maybe other people have a somewhat difference experience,
and feel that this is less of an issue than I believe it is?
All the best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED
Hmm. Seems I missed sending this to haskell-prime.
Sorry.
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been checked for viruses but the contents of an attachment
may still contain software
the idea, but it would be nice if the RHS of a pattern
synonym definition really coudl be any Haskell pattern, without any
additional restriction (except that it has to be acyclic).
All the best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University
,
/Henrik
Ideals are like stars. You may never be able to reach them, but you
can navigate by them.
Not terribly accurately though, which is why they invented GPS.
:-)
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED
, please, to the extent possible, let's keep the file system
out of the Haskell' definition!
All the best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been checked for viruses but the contents
there were the possibility of naming our haskell files whatever we
liked.
And I'd like to second that!
But not a Haskell' issue (I hope).
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has
hope it
would be possible to put a type signature next to the actual definition
as well, though, unless that would be terribly complicated for some
reason (in which case I'd personally stick with the unannotated
export list).
/Henrik
--
Henrik Nilsson
School of Computer Science and Information
, is potentially quite
big.
But of couse, the above discussion on likely change
impact is just my gut feeling.
My key argument is that MPTCs and thus some form of FDs/ATs
are really important in practice.
All the best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information
where
FRPTask.lhs: class Monad m = StateMonad s m | m - s where
FRPTask.lhs: class Monad m = EnvMonad env m | m - env where
FRPTask.lhs: class GTask t = MsgTask t m | t - m where
FRPTask.lhs: class MsgTaskMap mt m nt n | mt - m, nt - n where
/Henrik
--
Henrik Nilsson
School of Computer Science
mentioned in other contexts,
specifically for records, and I don't like it there either for the
same reasons.
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been checked for viruses
this to the 'Cons' list.
Henning, I'm afraid I don't quite understand what the conses are?
Could you clarify the concrete ill effects of the proposal, please?
Best,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message
complicates all language
tools without need.
I'll add that a recommendation for improved error messages has been
suggested as an alternative remedy.
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
This message has been
1 - 100 of 149 matches
Mail list logo