formatting, so it's
really a one-liner if you know the locations of the files (OK, big "if" on a
Unix system...).
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
Hi all,
I have seen many systems used backends for the literate part of a literate
Haskell source file. There is the old literate system from GHC (now dead?),
straight HTML, straight TeXinfo, straight LaTeX, {Wiki,Smug,No,Funnel,...}web
and many personal LaTeX style files or programs which
George Russell writes:
"D. Tweed" wrote:
Documentation is a vague term: certainly it'd be undesirable for a
specification to the libraries to just a literate copy of the code
itself. But if you're thinking in terms of an open source project where
people fix bugs in the libraries
DocBook stylesheets, Haskell-specific stylesheets, probably
also PDFlatex; concepts: SGML, DocBook, DSSSL) that is required to
handle his literate code; as if installing GHC wasn't hard enough? :)
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.
relation goes the other direction.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
Jan Brosius writes:
Frank Atanassow [EMAIL PROTECTED] wrote:
Anyway, I don't think the choice of markup is all that crucial, but I
think markup for documenting Haskell should also be as functional and
elegant as possible. Is Lout a thing to consider?
Yes, I
Ketil Malde writes:
Frank Atanassow [EMAIL PROTECTED] writes:
[a nice development environment] is easier to do this in LISP and
Smalltalk because they are dynamically typed. You could try for some
sort of reflection in Haskell, for example by starting with the
public Haskell parser
I also agree that we should not shoot for too much; but I
think we should agree on what we shoot for, first.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
to be strict.
I admit I can't think of any just now, though... :) Maybe someone else can
think of an example?
--
Frank Atanassow, Dept. of Computer Science, Utrecht University Padualaan 14,
PO Box 80.089, 3508 TB Utrecht, Netherlands Tel +31 (030) 253-1012, Fax +31
(030) 251-3791
find more general descriptions of the
language/compiler.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
hat we
should prefer (-) to (-), although he was working with a relational calculus
rather than a functional one.)
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
Frank Atanassow writes:
Using - in type signatures has the advantage that the first thing you see in
a signature is what is produced, rather than what is necessary to produce,
which is sometimes what you want when you have a set of algebraic functions
like John Hughes' pretty-printing
w irrefutable matching is used in general?
Why and when it is used, etc.
I'm pretty sketchy on this too.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
, and the methods for class InstrumentMonad (yuck) in an
instance for class InstrumentMonad.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
are really doing in these cases is trying to outsmart the
compiler('s designers), which is IMO a pointless exercise. (Think: "the
compiler as a black box".)
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31
ystem. It
slowly stirs the output of these gathering programs into a pool of
entropy, much like the linux kernel device, and allows other programs
to read out random bits from this pool.
* GPG = GNU Privacy Guard
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Paduala
n Computer Science, IEEE Computer Society Press,
pp. 230-241, 1996.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
have to
exist, even if I haven't seen any of them yet - this is not acceptable in
constructive logics).
[haven't read the papers on a correspondence for classical logic yet, but
I assume they exist, for otherwise I would contradict Frank Atanassow ;-]
Here's a nice example, which you
uot; models (are you even aware that Haskell's type system is
unsound?), and the fact that the domain is multi-sorted. But those facts do
not bear on the distinction between the two terms on either side of the
equivalence above.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
Frank Atanassow writes:
Jan Brosius writes:
Why do some computer scientists have such problems with the good logical
forall
and exist. Remember that good old logic came first.
On it was build SET theory.
On it was built topological space
To prove some theorem
we need a model. A model needs a domain of elements
to draw from. Therefore we need a domain. OK?
--
Frank Atanassow, Dept. of Computer Science, Utrecht University Padualaan 14,
PO Box 80.089, 3508 TB Utrecht, Netherlands Tel +31 (030) 253-1012, Fax +31
(030) 251-3791
etric quantification. This is irrelevant. You can
try to incorporate increasingly large parts of your metatheory into the object
theory, but it will never become a closed system.
However more complicated bounded forall's can be considered.
In general let alpha(x) be a formula about a variable x
http://research.microsoft.com/Users/luca/Papers/OnUnderstanding.{US,A4}.{ps.pdf}
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
of pencil work, and you can spend this
time rolling on the ground and laughing at the people who claim that
Haskell is useless for practical computations, because they don't know
how to implement some middle-Chinese chess in it.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
.
I hope more papers of this kind will appear in the future.
I'm asking for (er, rather, trying to encourage you to write) a paper on your
QM modules, and your perspective on QM vs. FP as well. (I'm going to look at
Jerzy's paper next.)
--
Frank Atanassow, Dept. of Computer Science
as probably already reported on it.
[These citations are courtesy of the Annals of Improbable Research,
http://www.improbable.com.]
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
important to Haskell as its
evaluation regime, and I find it hard to imagine a reasonable embedding of it
in Eiffel's. It seems far easier to do the reverse!
BTW, the most interesting thing I discovered was that DejaNews hosts a forum
which mirrors the Haskell list. It's called "fa.haskell&quo
JServ/JSP/Apache installation.
Eh? "zipless"?
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
Chris Angus writes:
Aren't most of these "java additions" MS J++ or MS specific
rather than java/jdbc "run-anywhere" though?
Not as far as I know, but maybe Erik and Daan will clarify.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO
Manuel M. T. Chakravarty writes:
Frank Atanassow [EMAIL PROTECTED] wrote,
Chris Angus writes:
Aren't most of these "java additions" MS J++ or MS specific
rather than java/jdbc "run-anywhere" though?
Not as far as I know, but maybe Erik a
ot very hard to draw a
distinction: you just have to show an appropriate embedding of
lambda-calculus.
If your language has no semantics, then you are in for a world of trouble
anyway, and the question of whether your language is (higher-order) functional
will be the least of your worries.
--
F
papers, written by researchers for researchers, which
describe a lazy machine, and take a guess that your particular implementation
uses much the same thing. And hardly anyone will bother to go that far.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utr
Of course, IANAH (I Am Not A Hacker) so you may take my hypocritical remarks
with a grain of salt or three.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
Sorry, I got carried away with my silly "hacker" post.
Manuel M. T. Chakravarty writes:
Frank Atanassow [EMAIL PROTECTED] wrote, Proposition Hackers can like
FP. [..] Proof 1: By contradiction.
Nothing could be more obscure or esoteric to a hacker than FP. (They
and the official designation of this one is a Type G,
or the G-machine; it was sometimes called the counter machine or
"Zahlwerk-Enigma", because it has a letter counter.
Will this hinder the adoption of Haskell compiler technology in France and
Israel...?
--
Frank Atanassow, I
it OK if I show off and steal some thunder? :)
"(It's) An old pond! The sound of water steadily dripping in..."
--
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030)
;kawazu" was the old form of modern
"kawarazu" (`without changing'). Modern `frog' is "kaeru", though, and the
transitive form of "kawaru" (`change') is also "kaeru", so I suppose there is
some linguistic relationship. "tobikomu" makes much
ctures.Trees" and "...Graphs" from plural to
singular. Same for "Data.Encoding.Bits". But not "Data" to "Datum"! :)
* Maybe change "Data.Structures" and "Data.Encoding" to one name each,
"DataStruct" and "Dat
a denotational description of the normal forms to one
for the entire language, which is automatically sound for the equational
theory.
Which sounds useful to me for writing interpreters.
--
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht
American bladdernut.
You need any more, just holler, y'hear?
---
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508TB Utrecht, The Netherlands
Tel +31 (0)30 253-3261 Fax +31 (0)30 251-3791
___
Haskell
In other words, funlhs is redundant.
---
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508TB Utrecht, The Netherlands
Tel +31 (0)30 253-3261 Fax +31 (0)30 251-3791
___
Haskell mailing list
[EMAIL PROTECTED
? Possibly. But as you suggested, the idea
is to make the audience as _wide_ as possible, not as _rich_ as possible. ;)
--
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-3261 Fax +31 (030) 251-379
, a
definition for substitution, etc.
--
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-3261 Fax +31 (030) 251-379
___
Haskell mailing list
[EMAIL PROTECTED
Bizarro (I love that word :) extension
which will only ever be implemented in some obscure researcher's pet compiler
project.
--
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-3261 Fax +31 (030) 251-379
of limitations in Yacc-style
parser technology; for example, static analyzers and type checkers are usually
context-sensitive. But if your second-stage parser emits abstract syntax
trees, maybe you could have a third-stage parser which emits declaration
blocks or modules.
--
Frank Atanassow
,
particularly the book by Hennessy, Pitts' course material on it, Nielson
Nielson's semantics book, Mike Gordon's notes on specification and
verification, and Pfenning's course notes on theorem proving and deduction.
http://www.cs.uu.nl/~franka/ref.html
--
Frank Atanassow, Information Computing Sciences
Functor has arity *. This works because
(-) a = (a -)
The outer parentheses are only there to ensure that the expression gets parsed
as one argument, and not two.
--
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31
., it is a unary relation on types), with the argument being of kind
*-*. This is one of the infelicities of the class system.
--
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-3261 Fax +31 (030) 251-379
anything suspicious.
BTW, the link above says that
The worm does not install itself and contains no other payload.
so I guess it is sort of chain-letter worm, and relatively benign.
--
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht
programming on the
way. I just know how to import file, declare types
and display output.
Your help and guidelines is most appreciated.
From,
Lee Ling Ling
--
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31
, ...). If you look at the demo
included with the distribution you will see a slide with a copy of the Ocaml
interpreter running inside a DVI page.
Files using ActiveDVI specials are still viewable with, for example, xdvi, but
of course most of the features are absent or mangled.
--
Frank Atanassow
David Bergman wrote (on 26-11-02 01:29 -0500):
I would like to know if anyone (maybe Mark P) knows the status of
Cartesian classes in different Haskell implementations. I.e., does
anyone implement the suggested functional dependencies or the less
general parameterized type classes?
I have
John Hughes wrote (on 02-12-02 10:27 +0100):
On Mon, 2 Dec 2002, Andrew J Bromage wrote:
... If you mention a term like design patterns,
well I love design patterns, it's just that in Haskell-land
they are called higher-order functions, or polymorphic functions, etc.
-- Johannes
Andrew J Bromage wrote (on 03-12-02 09:52 +1100):
On Mon, Dec 02, 2002 at 08:26:06AM +0100, Johannes Waldmann wrote:
well I love design patterns, it's just that in Haskell-land
they are called higher-order functions, or polymorphic functions, etc.
Can I safely translate that as We use
[EMAIL PROTECTED] wrote (on 03-12-02 18:18 +0100):
Perhaps I should rephrase:
There's too much mathematics in it, I'm not a mathematician
..and later...
lot of mathematics. One of the things I like about FP is that it
demands more mathematical sophistication of its practitioners, which,
Dmitry Malenko wrote (on 09-02-03 21:57 +0200):
As part of my research I'm going to create prototype system implementing
some extentions concerning at most module system to the language and to
toy with it a little. So I wonder what is the best way to do that?
Should I cope with compiler
Andrew J Bromage wrote (on 20-02-03 10:26 +1100):
All that is required of a theorem is that it is correct.
A tool, on the other hand, not only has to work (i.e. it has to
correctly accomplish some task), it also has to be safe to use, its
controls must be meaningful to the intended user, it
Gustavo Villavicencio wrote:
Hi all,
I am trying to understand the algebraic laws and operators
behind a functional expression...
f = g \equiv g* . f
in the Kleisli Star context. Is this right?
Yep.
If it is so, can I combine g*.f with a fork for example?
What do you mean by a fork?
Gustavo Villavicencio wrote:
Frank Atanassow said:
What do you mean by a fork?
So, the question is, if i have
f : A - T B and g : A - T C
where T is a monad, i.e. an endofunctor, can i combine f and g as
f,g : A - T (BxC)
knowing that T involves side effects?
I guess you are asking
Frank Atanassow wrote:
Gustavo Villavicencio wrote:
Hi all,
I am trying to understand the algebraic laws and operators
behind a functional expression...
f = g \equiv g* . f
in the Kleisli Star context. Is this right?
Yep.
Oops, or rather, not quite.
m = g
means
g* m
The Kleisli composition (-)* . (-) is sometimes written as (@@):
(@@) :: (Monad m) = (b - m c) - (a - m b) - (a - m c)
(f @@ g) x = let m = f x in m = g
Man, I can't get anything right today. I meant:
(g @@ f) x = let m = f x in m = g
Apologies for the flooding.
Regards,
Frank
On Thursday, Aug 28, 2003, at 08:47 Europe/Amsterdam, Steffen Mazanek
wrote:
Thank you all for your help. I will try this ghc-flag.
It is interesting as well, that in contrast to Haskell Standard ML
ensures,
that pattern-matches are exhaustive and irredundant.
SML has the same limitations
On zaterdag, sep 20, 2003, at 13:01 Europe/Amsterdam, Dominic Steinitz
wrote:
Can anyone tell me why the following doesn't work (and what I have to
do to
fix it)? I thought by specifying the type of coalw as rank-2 would
allow it
to be used both at a and (a,b).
This will never work. A function
On maandag, sep 22, 2003, at 00:07 Europe/Amsterdam, Brandon Michael
Moore wrote:
Can anyone tell me what's wrong with the following derivation?
Without going through your derivation completely, the problem is almost
certainly polymorphic recursion. Vector is a nested datatype---its
definition
On woensdag, sep 24, 2003, at 17:46 Europe/Amsterdam, John Hughes wrote:
What's needed is a parser that can parse
comments, and tie them to the *right place* in the abstract syntax
tree.
Figuring out what a comment is really commenting is probably extremely
hard...
The commenting conventions of
On Dec 24, 2003, at 2:29 AM, Sean L. Palmer wrote:
It occurs to me that Haskell would be quite a bit easier for OO and
traditional programmers to grasp if Haskell would actually use the
correct, or at least more commonly used, names for things.
I don't think changing a few keywords will have
In the near future I expect to have need of an implementation of some
basic term rewriting system algorithms, most notably:
- term matching and unification
- same, modulo associativity
- same, modulo associativity and commutativity
The first, of course, is easy to do myself; the second, I
On Mar 10, 2004, at 8:56 AM, [EMAIL PROTECTED] wrote:
Example (readers familiar with the problem may
skip this):
salutationDear Mr.nameRobert Smith/name./salutation
This structure is represented by the XML Schema
xsd:element name=salutation
xsd:complexType mixed=true
xsd:sequence
xsd:element
Hi guys,
I'm using GHCI to run code output by Generic Haskell. As I'm sure
you're aware, GH is a preprocessor. Every once in a while, I
accidentally load a .ghs file (GH input) rather than the resulting .hs,
and GHCI crashes with a segmentation fault:
merulo 536
Dunno if you actually consider this a bug or not, but since the message
says to report it... This is on Mac OS X 10.3.5 with GHC 6.2.1.
$ ghci
^Cghc-6.2.1: internal error: main thread has been GC'd
Please report this as a bug to [EMAIL PROTECTED],
or
/or "block-swapping" (using the Unicode private-use areas, for
example), but then, that subverts the purpose of Unicode.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
of the Jyouyou,
so there are actually more kanji available, and the problem is not quite so
severe. However, for Chinese names I can imagine it being quite restrictive.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31
let
bindings?)
I had in mind both, and all other kinds of scoping as well, e.g., module
imports.
--
Frank Atanassow, Dept. of Computer Science, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-1012, Fax +31 (030) 251-3791
in a typed language,
because its apparent from the source code, and/or automatically checkable by
merely compiling the source code.
---
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508TB Utrecht, The Netherlands
Tel +31 (0)30 253-3261 Fax +31
something to that effect,
that it's not the paradigm which matters, but rather the existence of nice
properties, or effectively simple semantics, as you said. But C is not such
a language.
---
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508TB
choice by treating free variable environments as
(multi-)sets. (Of course, you lose that advantage when you package up your
environment in a closure, because Haskell distinguishes between a - b - c
and b - a - c, even though they are isomorphic.)
---
Frank Atanassow, Information Computing
(of kind
*). So there is a kind mismatch. Try this instead:
data SuperSet a = SuperSet (SetAsList a)
instance Set SuperSet a where
...
--
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-3261 Fax
, there are 10 people who would say the
opposite. Shall we take a poll?
--
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-3261 Fax +31 (030) 251-379
. You can always apply these to
a stream, and they will never fail. But if you try that with lists, you will
raise an error once you get to the end of it.
--
Frank Atanassow, Information Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030
David Roundy wrote (on 21-09-02 07:30 -0400):
Here is what I'd like to do:
\begin{code}
data D = A String | B String
instance Show D where
show = showD
instance Read D where
readsPrec _ = readsD
readD s = (readsA s) ++ (readsB s)
\end{code}
A is formatted like ``A
Jerzy Karczmarczuk wrote (on 22-10-02 13:05 +0200):
What do you think, what
is the Rational form of 2.3 ? (GHCi says 23/10).
The answer is:
2589569785738035 % 1125899906842624
Er, why?
Because 2.3 is not representable using a double precision float or something?
--
Frank
Frank Atanassow wrote (on 22-10-02 15:08 +0200):
Jerzy Karczmarczuk wrote (on 22-10-02 13:05 +0200):
What do you think, what
is the Rational form of 2.3 ? (GHCi says 23/10).
The answer is:
2589569785738035 % 1125899906842624
Er, why?
Because 2.3 is not representable using
Lauri Alanko wrote (on 20-12-02 11:26 +0200):
For what it's worth, I will probably be doing my MSc thesis on
adapting eval (and reflection in general) to a statically typed
language. Essentially you need a run-time representation of the
environment and the typing context, and a type system
On donderdag, sep 18, 2003, at 14:44 Europe/Amsterdam, Graham Klyne
wrote:
My problem is this: how does it make sense to define an equality of
morphisms without some well-defined concept of equality on the
underlying objects to which they apply? That is, given object X and
an object Y, it is
On vrijdag, sep 26, 2003, at 09:16 Europe/Amsterdam, John Meacham wrote:
On Fri, Sep 26, 2003 at 08:59:12AM +0200, Ketil Z. Malde wrote:
I think there is a problem with too much overloaded syntax. Perhaps
it is time to put non-ASCII characters to good use?
For instance, function composition could
On dinsdag, nov 4, 2003, at 00:39 Europe/Amsterdam, Frank Atanassow
wrote:
For example, our translator takes the Schema type doc (representing a
bibliographic entry) ... to a certain ugly datatype X.
Oops. For X I should have written E_doc, that is, the translation of
Schema type doc is named
On May 6, 2004, at 6:59 PM, S. Alexander Jacobson wrote:
I think someone wrote a book about multi-media
apps in Haskell (I've seen a chapter somewhere
from Conal Elliot) but I don't remember what it
was.
Probably Paul Hudak's The Haskell School of Expression.
http://www.haskell.org/soe/
I had
On May 3, 2004, at 5:52 PM, [EMAIL PROTECTED] wrote:
I've got an interesting task this week for my job. (Note that this
will undoubtably last for longer than a week). I'm evaluating several
high-level languages as development vehicles for our next suite of
applications. The languages I'm
On Jun 9, 2004, at 9:39 AM, Jerzy Karczmarczuk wrote:
I have *nothing* to add, just a question.
Do you /anybody/ know of any edible work on ADJUNCTIONS in the context
of Haskell structures? Perhaps instead of searching for 'inverses' one
should think more about adjoints?...
Yes, I think this is
First, concerning your question about monads and multiplication: a
monad on category C is exactly a monoid object in the category [C-C]
of endofunctors on C, and natural transformations between them. A
monoid in a category is, as you expect, an object X with arrows
m:X*X-X and u:1-X satisfying
On Jun 29, 2004, at 6:46 PM, Iavor S. Diatchki wrote:
In Haskell, natural transformations are polymorphic functions, tau
:: f a - g a. For example, maybeToList :: Maybe a - [a].
actually i think this is a good approximation. not all polymorphic
functions are natural transformations, but simple
On Aug 9, 2004, at 5:00 PM, Simon Peyton-Jones wrote:
Closed classes are certainly interesting, but a better way to go in
this case is to allow the programmer to declear new kinds, as well as
new types. This is what Tim Sheard's language Omega lets you do, and
I'm considering adding it to GHC.
92 matches
Mail list logo
