Durward McDonell wrote:
> Yes, this is exactly what I wanted! Thanks, and thanks for writing
> it all in the first place. :-)
>
> However, I haven't quite been able to get it to work fully. ... What am I
> doing wrong?
If you use pfesetup to create the project, prelude and library modules will
Hi,
The pfe command line tool from the Programatica Project has functionality that
seems to fit fairly well with what you are asking for:
pfe deps -- lists function level dependencies
pfe needed -- lists everything needed by a definition
pfe dead -- lists unused defini
Simon Peyton-Jones wrote:
| >
| > class Functor f where fmap :: ...
| > class Functor m => Monad m where
| >...the usual stuff...
| >fmap = liftM
| >
It seems overkill to have a whole new language feature to deal with one
library issue.
Perhaps it is...
For example, what i
Thomas Hafner wrote:
Are somewhere GHC binaries for Cygwin available? I tried to cross
compile from Linux, but didn't succeed.
Maybe one want to answer me: ``Why is a cygwin port needed? There's
already a great MS W port!'', but: ...
In a ``pure'' Cygwin port all system calls should go through the
Henrik Berg wrote:
... I was able to compile Fudgets when I removed 6.0.1, using
only 5.04.3.
Still don't understand why I coudn't get it compile with 6.0.1,
though.
fudgets-030806.src.tar.gz compiles with GHC 6.0.1.
Fudgets does not yet compile with GHC 6.2, however, since _casm_ (which
very
reused in the
Haskell refactoring project at the University of Kent.
--
Thomas Hallgren
The Programatica Project
http://www.cse.ogi.edu/PacSoft/projects/programatica/
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo
Marcin 'Qrczak' Kowalczyk wrote:
A... should be split into "A.." and "."
I found a compromise: let's make it a lexing error! :-)
At least that agrees with what some Haskell compilers implement. No
current Haskell compiler/interpreter agrees with what the report seems
to say, that is that
Bas van Dijk wrote:
In hsrc/ghmklib and Contrib/Makefile, there are options for which make
tool to use. I think the 030414 version uses humake by default.
env GHCFUDGETS=../GhcFudgets ../bin/ghuxmake -batch -cpp -O2 ContribFudgets.hs
../bin/ghuxmake: line 44: ghumake: command not found
The Contrib
Bas van Dijk wrote:
Great! it's working now...
I accidently downloaded the newest untested version (April 2003) from the
Fudget website. That version gave errors while making.
In hsrc/ghmklib and Contrib/Makefile, there are options for which make
tool to use. I think the 030414 version uses hum
Hi,
Simon Peyton-Jones wrote:
Folks
Another minor H98 glitch.
Are you saying that you think the report doesn't fully define the
meaning of the module system, or just that difficult to understand and
needs to be clarified?
Consider this:
| > > module D (module Char) where
| > > { import q
Hi,
The Haskell report seems pretty clear about the meaning of numeric
literals and negation in expressions: -2 should be interpreted as negate
(fromInteger 2). That is, negated literals are not treated specially,
the general rule -(e) ==> negate (e) applies. (See section 3.2 and 3.4
of the H
really easy to
reuse for this purpose!
Regards,
Thomas Hallgren
Nicholas Nethercote wrote:
>On Mon, 18 Mar 2002, Kevin Glynn wrote:
>
>> > Are there any programs to strip comments and blank lines from a Haskell
>> > source file, that work on normal and literate programs?
ing with ideas from papers like [3]
and [4].
>My implemention mood has
>suddenly past.
>
Does this mail do anything for your implementation mood?
Thomas Hallgren
PS By the way, perhaps theorems for free (e.g., [5]) also have something
to contribute to the solution of this problem?
[1] htt
essions would all reduce to String, and they
would all compute to the expected results (i.e., the result you would
get by manually disambiguating the types, e.g., show ([]::[Int])).
The same trick applies to the Eq class, so that, e.g., [] == [] would be
unambiguous and compute to True.
So, obviously, the ne
Wolfgang Lux wrote:
>Thomas Hallgren wrote
>
>>There seems to be a similar problem with qualified identifiers. The
>>production for lexeme includes varid, conid, etc, rather than qvarid,
>>qconid, etc.
>>
>Sorry we must have a different version of the report,
erate space efficient
code to begin with, but also provides heap profiling to help you find
out what kind of data is occupying all the space (constructor profile),
which functions produced the data (producer profile) which functions
have references to th
ed names are part of the lexical syntax.
The same problem is present in Appendix B.
Suggestions: include qvarid, qconid in the production for lexeme. Move
the explanation of the lexical properties of qualified names from
section 5.5.1 to section 2.4.
Thomas Hallgren
___
ional programs for the Java Virtual
Machine", Journal of Functional Programming, Vol 9, Issue 6, Nov 1999.
The translation, which is done via the -machine, is described in
detail. The article also contains performance figures with comparisons
to related implementations.
--
Thomas Hallgren
).
Hi.
Today, I put sources for Fudgets [1] version h13t on our ftp site [2]. It
compiles with HBC and GHC 4.06.
Fudgets is still maintained, although we haven't taken the time to make any
thoroughly tested releases. But it still works well enough to be used in
undergraduate teaching and in
/haskell/chalmers/untested/
[3] http://www.cs.chalmers.se/Cs/Research/Functional/Fudgets/Manual/
--
Thomas Hallgren
PS Since my home computer runs FreeBSD, I know for sure that Fudgets
compiles and runs just fine under FreeBSD :-)
get a code explosion, possibly an infinite one.)
Have I missed something fundamental that prevents this solution from working?
--
Thomas Hallgren
Jose Emilio Labra Gayo wrote:
> >
> > I agree; Haskell 2 should have existential (and universal) types. I
> > also think it should have both extensible records and extensible
> > variants. (See the following paper for more information on these.
> > TREX is an implementation of half of this syst
hat you can
allow...
Perhaps it would be a good idea to consider the work done on "Strong
Functional Programming"as part of the Haskell 2 design process. Here is one
link:
http://www.cs.ukc.ac.uk/people/staff/ajt/ESFP/Published/
--
Thomas Hallgren
guage design issues (existential
types, dependent types) written down about one year ago can be found in
http://www.cs.chalmers.se/~hallgren/Thesis/haskell-comments.html
Thomas Hallgren
sometimes want to exit(1) in some
> cases.
Real programmers can do this already. They simply use the standard library
function System.exitWith [1]. I don't like the idea of changing the type of
main to IO Int for several reasons...
Thomas Hallgren
[1] http://haskell.systemsz.cs.yale.edu/onlinelibrary/system.html
Graeme Moss wrote:
>
> Has anyone written a parser for Haskell 1.4 in Haskell 1.4?
> Has any compiler written the lexer/parser in Haskell?
Nhc13 [1] by Niklas Rojemo contains both a lexer and a parser
for/in Haskell 1.3. (The differences between 1.3 and 1.4 are small [2].)
The parsing combinato
--15FB7483794BDF32446B9B3D
Content-Type: text/plain; charset="us-ascii"
Christoph Herrmann wrote:
> I always find it annoying to have a lot of
> auxiliary functions for selecting elements of
> tuples. It would be nice to have, e.g.,
> an infix operator, say "#", that takes a tuple
> a
"Two-pass heap profiling: a matter
of life and death". In the proceedings of IFL'96.
These are available from
ftp://ftp.cs.chalmers.se/pub/users/rojemo/icfp96.ps.gz
ftp://ftp.cs.chalmers.se/pub/users/rojemo/ifl96.ps.gz
Niklas Rojemo
Thomas Hallgren
/chalmers
Send bug reports and feedback to
[EMAIL PROTECTED]
or [EMAIL PROTECTED]
Thomas Hallgren
Magnus Carlsson
? ?
more difficult to change it for a later version of
Haskell...
Regards,
Thomas Hallgren
via anonymous FTP on
ftp.cs.chalmers.se
in directory
/pub/haskell/chalmers
Bug reports and feedback to
[EMAIL PROTECTED]
or [EMAIL PROTECTED]
Thomas Hallgren
Magnus Carlsson
via anonymous FTP on
ftp.cs.chalmers.se
in directory
/pub/haskell/chalmers
Bug reports and feedback to
[EMAIL PROTECTED]
or [EMAIL PROTECTED]
Thomas Hallgren
Magnus Carlsson
Rob Turner <[EMAIL PROTECTED]> writes:
| How do you get a subtype in Haskell (or any other functional language
| come to that)? I'm thinking along the lines of (pseudo-notation):
|
| type weekday = {Mon, Tue, Wed, Thur, Fri}
| type weekend = {Sat, Sun}
| type day = weekend + weekday
33 matches
Mail list logo
