of August.
The full vacancy text and application procedure can be found here:
https://vacatures.uva.nl/UvA/job/Postdoc-Position-on-Digitally-Enforceable-Data-Sharing-Contracts/771937302/
For more information, contact me at l.t.vanbinsber...@uva.nl.
Kind regards,
Dr. L. Thomas van Binsbergen
Amsterdam I refer to the vacancy description linked to above.
Kind regards,
Thomas van Binsbergen
Assistant Professor, University of Amsterdam
Email: l.t.vanbinsber...@uva.nl
Twitter: https://twitter.com/lthomasvb
___
Haskell mailing list
Haskell@haskel
...it's true that without HTTPS someone could man-in-the-middle you and
get you to join a secret, ILLEGAL haskell mailing list, for NEFARIOUS
purposes. Some say demons wander those hills, seeking to lure the
unwary to the unhallowed lands of javascript...
On 02/27/2018 08:23 AM, T
GNU mailman passwords are explicitly _*NOT*_ secure!
_*DO NOT REUSE MAILING LIST PASSWORDS!*_
They ARE stored in plaintext and will be mailed back to you periodically
on some setups to confirm that you want to remain subscribed.
On 02/25/2018 12:44 AM, 姓名 wrote:
Hi there,
I become aware o
I just learned that ZuriHac will overlap (on Fr-Sa) with the C++ standards
committee meeting in the very same venue:
http://open-std.org/JTC1/SC22/WG21/docs/papers/2017/n4673.pdf
The PDF by the way also includes useful hotel and travel information.
___
UNNC:
http://www.nottingham.edu.cn/en/engineering/departments/computer-science/index.aspx
Best regards
Thomas
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
i
Good work, Ivan. Despite your numerous previous pointers, I still
haven't look at this API. I'm glad to see this release, it's great
motivation and I'll probably look through it this weekend.
Thanks for all the graph library work you do,
Thomas
On Fri, Apr 27, 2012 at
You probably have some packages of yours installed as user and some
others globally. Have a look at:
http://www.haskell.org/cabal/FAQ.html#dependencies-conflict
I recommend that as soon as you have a running Haskell Platform to
always install new packages with cabal install ... --user
Thomas
ot;g :: Traversable t, Traversable u => t a -> m (u b)" given "f :: a -> m
b"?
Thanks for any comments!
Thomas
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
st of projects).
EQUIPMENT:
You should bring a laptop with wireless (802.11). Ethernet is unavailable.
Registration:
Please RSVP by e-mailing thomas.dubuisson+hacpdx at gmail.com, as well
as add your name to the attendees Wiki page (see above URL).
Hope to see you there,
T
On 7 Feb 2011, at 03:23, Mark Wotton wrote:
> If you're going to use C anyway, why not bind bcrypt?
Better yet, bind the password storage API on platforms where it exists (e.g.
keychain access on OS X)
Tom Davie
___
Haskell mailing list
Haskell@has
It's still available at http://haskell.cs.yale.edu/yarrow/
I believe the correct new location will be on community server. See
http://community.haskell.org/ for instructions on how to get an
account there.
On 10 December 2010 12:23, Frank Rosemeier wrote:
>
> Dear Haskellers,
> today I have no
I created http://www.haskell.org/haskellwiki/MigratingWikiContent to
list known issues and workarounds. Please feel free to extend that
page where needed.
/ Thomas
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo
ermissions to fix this -- or even access to the old wiki data.
Otherwise, I'm on it, though. ;)
Once that is fixed a systematic clean-up would be nice. I'll send out
a separate mail regarding the new wiki, as some Wiki features have
changed which might break old markup.
/ Thomas
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
with the slab allocator, this can double the number of some common
> values that can be put in a cache line.
Interesting. How do you distinguish 'Just e' from 'Just _|_'? Do
you need the whole program assumption to disprove that the latter case
can happen?
/ Thomas
___
with us at the Functional
Programming Laboratory, on a subject in relation to a new project:
Implementation of a dependently-typed programming language using a verified
core-language.
The supervisors will be: Dr Thomas Anberree in China, Dr Thorsten Altenkirch in
Nottingham.
Applicants should
Sorry to be That Guy, but:
Your use of rounded borders for the boxes is skewing the correct
perception of the data. The rounded borders remove more area from the
smaller bars than the from the larger bars, so smaller bars will seem
even smaller in comparison. In general, never ever try to make
d
Hiya all,
I'm trying to build a library that can be called from C code. The
ghc manual implies that this can be done, but does not specify the
compiler options that I need to throw at it, and into which files I
should put initialisation/end routines. Does anyone know the magic I
need t
On 26 Apr 2009, at 18:24, Michael Dever wrote:
Hi,
The first release of Haskell File Manager has been uploaded to
http://code.haskell.org/haskellfm
This is a program for viewing/managing the files on your computer.
It has all the common functionality you would expect from your
current fi
On 3 Apr 2009, at 09:25, Benjamin L.Russell wrote:
On Fri, 3 Apr 2009 09:09:26 +0200, Jean-Philippe Bernardy
wrote:
On Fri, Apr 3, 2009 at 7:12 AM, Marc A. Ziegert wrote:
how about an octopus?
I could not resist the opportunity to combine two great ideas and
give
you the haskell octop
On 1 Apr 2009, at 16:31, Daniel Lincke wrote:
Hi Haskellers,
I am looking for a parser which can parse Haskell code and build an
syntax tree out of it. The syntax tree should be storable in some
reasonable file format in order to use it as an input for applications
like programm transformation
On 4 Feb 2009, at 13:33, Benjamin L.Russell wrote:
On Sat, 31 Jan 2009 21:34:34 +0100, Thomas Davie
wrote:
I noticed recently that HOC has moved over to google code, and
seems a
little more active than it was before. Is there a mailing list where
I can talk to other users and get myself
I noticed recently that HOC has moved over to google code, and seems a
little more active than it was before. Is there a mailing list where
I can talk to other users and get myself kick started, or is it a
case of just using the standard Haskell ones?
Bob
_
Hi Neil,
This is a great addition! There's several packages up there that I
want to search. A couple of small bug reports though:
1. Searching using a package name that isn't all lower case results in
nothing (e.g. (a -> b) -> f a -> f b +InfixApplicative gives no
results, while (a ->
check.
- It's rather slow (then again you don't run it very often)
I'm using it for the GHC source code, and it works rather well now.
If anyone is interested we could certainly release a version that
works with 6.10.1 (or if someone wants to backport it, go ahead).
Cheers,
Thomas
Hi,
I've written the programme below.
The lircLoop should never terminate. Unfortunately it does. Worse, no error
messages are generated.
Not even the final line "Closing down" is printed.
How is this possible?
Thanks for your help.
import Hmpf.Tree as T
import Control.Concurrent hiding (forkI
s_guide/data-type-extensions.html#type-synonyms
Seems like the mystery is solved now..
At any rate, this has been discussed before in other threads.
Thanks Thomas for your help
P.
You're welcome,
Thomas
___
Haskell mailing list
Ha
> On 12/04/2008, Thomas van Noort <[EMAIL PROTECTED]> wrote:
>
>> That's a good question. Unfortunately, only Haskell98 types are
>> currently
>> supported by the Generic Haskell compiler.
>
> I thought constrained types were Haskell 98, but now I
rated structure type.
Regards,
Thomas
> On 12/04/2008, Thomas van Noort <[EMAIL PROTECTED]> wrote:
>
>> Generic Haskell includes the following features:
>>
>> * type-indexed values -- generic functions that can be
>>instantiated on all Haskell data types.
&
PROTECTED]
[1] Thomas van Noort. Generic views for generic types. Master's thesis,
Utrecht University, 2008.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Hi Haskell Hackers!
There are only 4 days left until the fourth Hackathon (http://
www.haskell.org/haskellwiki/Hac4) at Chalmers University in
Gothenburg, Sweden.
If you haven't registered, yet, please do so now!
Registration deadline: Tuesday, April 8, 2008
To register, go to http://
(http://www.cs.utexas.edu/~EWD/ewd07xx/EWD786a.PDF,
That would make for a nice script font :) Oh, wait, there is one
already: http://lucacardelli.name/Fonts.htm
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/
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
definitions
pfe slice -- extract a slice by eliminating unused defintions
For more information, and downloads, see
http://www.cse.ogi.edu/~hallgren/Programatica/download/
Thomas H
Durward McDonell wrote:
> Hello. This seems like a basic question, but I haven't
> been able
Hi,
I've met an interesting problem in terms of how to type a data
structure and the functions that operate upon it.
The problem centres around a single data type. This data type can be
constructed in multiple ways using different functions, depending on
the options the user specifies.
On 3 Oct 2006, at 23:09, Tony Morris wrote:
[Tangent]
Please excuse my ignorance, but it seems there is assumption of
general
acceptance that CPS incorporates "Evil code". Are you able to support
this or refer to a document that does? Thanks for any pointers.
Tony Morris
http://tmorris.net/
Hello list,
I am in the process of testing a debugger, and need some examples
to throw at it. It's based on hat, so the normal rules about nothing
that uses glasgow extensions or ffi apply. But I'm hitting a bit of
a wall. Do any of you have some examples of nasty uses of higher
order
Also of note, this channel is in large part made up of university
lecturers, researchers, and PhD students. I really wouldn't be
surprised if one of them were to notice the assignment they set
cropping up here.
Bob
On 12 Aug 2006, at 13:58, Thomas Davie wrote:
Hi,
While this
Hi,
While this is an interesting question, the haskell mailing list is
not really the appropriate place to ask it.
Questions here should be of the form of:
• How do I work this feature of Haskell
• What the hell does this error mean
• Wouldn't it be cool if Haskell did this?
• Is there a fo
Hi All,
On 7/31/06, Einar Karttunen wrote:
My main objection to the TLS is that it looks like normal IO,
but changing the thread that evaluates it can break things in ways
that are hard to debug. E.g. we have an application that uses
TLS and passes an IO action to a library that happens to use
I would also note that some form of transaction-local variable would
also be really handy for STM usage.
Tom
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Hi All,
I'm not quite sure I've even got the question right, but here goes anyway
I am using STM for a concurrent BTree implementation. My plan is to
have a cache of file pages that have been read from disk. A "pointer"
within the BTree will either dereference to a page address for a page
Hi,
I was just wondering what the status of porting GHC to intel mac
was these days? I've finally beaten Apple into submission, and got
them to replace my broken iBook with a MacBook, so a nice fast
version would be nice.
Bob
___
Haskell maili
On Thu, 2006-01-26 at 20:29 -0800, [EMAIL PROTECTED] wrote:
> circumstances, many things break, including the ST monad. One can
> indeed break the essential guarantee of the ST monad -- for example,
> create a top level STRef *and* fruitfully use in arbitrary ST
> computations. The enclosed code do
I have a program that I *know* can run faster... I know there's
duplicated effort in there somewhere, the question is where. The
heap profile reflects exactly what I would expect it to, so I want a
reasonably accurate time profile. Is there any way to get such a thing?
Thanks
Bob
___
Sorry, I could have done with answering a bit more there...
On 11 Nov 2005, at 23:09, David Frech wrote:
I'm curious. Can you be more specific about what you thought
wanted/needed changing in nhc98's VM and/or compiler?
Basically, nhc98's backend had several problems, most notably not
being po
On 11 Nov 2005, at 23:09, David Frech wrote:
On 11/11/05, Neil Mitchell <[EMAIL PROTECTED]> wrote:
Just so that people don't get the wrong idea ...
- It's just an experiment of mine with the backend that turns out to
have sparked some interest. It seems to compile most of Haskell 98
(at
lea
Yes that's a good idea, I would have tidied things up somewhat if I'd
known it was going to be announced on the mailing list :-)
Cheers
Tom
Tomasz Zielonka wrote:
On Fri, Nov 11, 2005 at 12:24:49PM +, Neil Mitchell wrote:
- It's very much work in progress, indeed the source code in the
Announcing the York Haskell Compiler - a Haskell 98 compiler with
roots in nhc98. It's not totally finished, but is getting there
quickly, and could well be of interest to Haskell developers.
Webpage: http://www-users.cs.york.ac.uk/~ndm/yhc/
Project Blog: http://yhc06.blogspot.com/
Project Wiki:
,2] in [x,x])
[[1,1],[1,2],[2,1],[2,2]]
*Reflection> reify (let x :: Int; x = reflect [1,2] in [x,x])
[[1,1],[2,2]]
Of course, in case of no explicit type signature, the monomorphism
restriction plays an infamous role and the behavior depends on the flag
-fno-monomorphism-restriction.
Thomas
_
I've been trying to get hs-plugins working on a box, to use the Eval
module, but the register script seems not to register the eval
package, or the printf module, which judging by the readme:
---
And to unregister (maybe as root). Note that the unistall order
matters:
$ ghc-pkg -r pr
It seems to me that this sort of thing is why haskell is difficult to
compile to efficient code. I have the impression that relaxed
semantics wouldn't hurt 99% of programs while make the compiler-writer
job easier. The only disadvantage is that tricks like the above one
wouldn't work any more.
An
On 28 Jun 2005, at 10:58, Simon Marlow wrote:
We've finally digested the results of the GHC survey, and you can find
our analysis here:
http://www.haskell.org/ghc/survey2005-summary.html
There's a lot to take in, but it's an interesting read. Enjoy!
I feel compelled to point out that for al
Hi,
I'm getting an odd link error trying to build with ghc 6.2.2 on OS
X, and can't figure out what's going on. From it's form, I assume
that the symbol is part of the runtime, but greping the files in /usr/
local/lib/ghc-6.2.2 returns no results.
dhcp2934:~/Documents/hat tatd2$ make
cd src
to the Haskell
> list?
>
> You know about Filliatre's bibtex2html, I presume? It isn't a
> replacement for bibtex, but it runs bibtex and uses the output via an
> OCaml program to generate html.
>
> I'm curious as to what your interest is.
>
> Cheers,
> J
Thanks, this was exactly the sort of thing I was looking for.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Does anyone know of any work being done on Latex with Haskell?
I am particularly interested in finding a Haskell replacement to Bibtex.
Thanks.
Tom
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
...
For example, what if Functor T *is* defined explicitly, but in a later module?
I guess it would be the same as what happens now if you accidentally
declare the same instance in different modules, i.e., the system would
complain about overlapping in
Hi,
I'm attempting to call Haskell functions from Objective-C (a
required parser is gonna come out much nicer in Haskell than in
Objective-C). As far as I can make out HOC is the only way to do
this (damn, knew I shouldn't have upgraded to GHC 6.4). Does anyone
know of any other way to
I may be barking up the wrong tree here, but I think the key to this
discussion is that real numbers are not bounded, while doubles are
bounded. One cannot say what the smallest or largest real number are,
but one can say what the smallest or largest double are (and it is
unfortunately impleme
trecht University, The Netherlands
Kris de Volder, University of British Columbia, Vancouver, Canada
Andrew Wendelborn, University of Adelaide, Australia
ORGANIZING COMMITTEE:
Thomas Noll, RWTH Aachen University, Germany
Joost Visser, University of Minho, Braga, Portugal
Eric van Wyk, University of
On 11 Nov 2004, at 22:02, karczma wrote:
Thomas Davie writes:
This method unfortunately depends on having a seed first though.
Which "this method"? Please, quote the text you are referring to
*before*
your answer.
One must use a different value every time the program is started,
common
This method unfortunately depends on having a seed first though. One
must use a different value every time the program is started, commonly
time or the first few bytes from /dev/random. Any one of these is
going to require a monadic function to generate (i.e. it must come from
the environment
Hi,
I'm glad that there's interest for a tool like hat-anim. I should warn you however that the current version is far from perfect - it has some problems with displaying infinite lists and with some lambda expressions and worst of all has a pretty nasty memory leek problem (there's what I get for
It's really irritating when people expect their homework to be done on line.
It undermines the effectiveness of the mailing list by trying to take
advantage of other people's good will.
On Thu, 7 Oct 2004 01:18, ldou wrote:
> I have a string,e.g. "1245670398", now I want to select two
> element f
University of British Columbia, Vancouver, Canada
Andrew Wendelborn, University of Adelaide, Australia
ORGANIZING COMMITTEE:
Thomas Noll, RWTH Aachen University, Germany
Joost Visser, University of Minho, Braga, Portugal
Eric van Wyk, University of Minnesota, Minneapolis, USA
IMPORTANT DATES
p://www.haskell.org/ghc/contributors.html
How about publishing there, that somebody is wanted as a
porter/packager for Cygwin? That could be a first, initial step.
Regards
Thomas
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
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
while expecting
interactive user input.
* A person experienced in porting darcs to MS W recommended me to look
for a pure Cygwin port of GHC.
In a ``pure'' Cygwin port all system calls should go through the
Cygwin libraries, of course.
Regards
Thomas
_
You're not really doing anything wrong. You're just another victim of
line buffering.
Try this,
import IO
main = do
hSetBuffering stdout LineBuffering
main2
main2 = do
x<-hGetLine stdin
putStrLn x
main2
On Mon, 09 Feb 2004 11:06 am, S. Alexander Jacobson wrote:
> This code works echos l
())
to store values in arrays of records of various types. Is there a
convenient way to do things like this without _casm_?
--
Thomas H
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
In Haskell, data types and contructors must be designated by
names whose first letter is capitalised.
So,
> data currency = ...
is illegal.
Instead use,
> data Currency = Dollar Double | Pound Double | Zloty Double | Euro Double
Above are four data constructors and they can be used to contruct
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
If anyone ports this to work with GHC6.0 please let us know.
Tom
On Wed, 5 Nov 2003 09:58 am, Peter Simons wrote:
> S Alexander Jacobson writes:
> > Is there a reasonably efficient Haskell httpd
> > implementation around that uses poll/select?
>
> There is a web server written in Haskell: HWS-W
On Thu, 23 Oct 2003 12:20 pm, Pratik Bhadra wrote:
>
> data Expr = Lit1 Int | Lit2 Bool | Var String | BinOp Op Expr Expr
>
> My evaluate code is as follows...
>
> evaluate :: Expr -> Store -> Expr
>
> evaluate ( Lit1 n ) st = n
> evaluate ( Lit2 n ) st = n
A function must match its type signature
ope: `A.--'
HBC: "B.hs", line 5, syntax error on input:=
(treats -- as the start of a comment)
Hugs: ERROR "B.hs":4 - Undefined qualified variable "A.--"
NHC98: Identifier A.-- used at 4:6 is not defined.
PFE: B.hs:5,1, before : syntax error
(A.-- is lexed as A.-
| v <- vars])
where
pats = [ Pvar $ show n | n <- [1..i] ]
vars = [ var $ show n | n <- [1..i] ]
So, I can now define a function f,
f :: [String] -> (Int, Bool)
f = $(cast 2) . $(listToTuple 2)
but I can still see no way to infer the size of the tuple purely from the declared
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
I'm struggling to write the following function in Template Haskell.
I have a phantom type,
>data HTMLPage a = HTMLPage FilePath
This type points to an HTML file, where 'a' refers to the return type of
the posted form.
So, mostly, I would expec
Strange. I have used this form many times without difficulties.
Perhaps, it is a platform-dependant bug.
Tom
On Fri, 13 Jun 2003 03:33 pm, Filip wrote:
> Hi,
>
> I have function
> f:: a -> b
>
> and I need something like this:
>
> myaccept:: Socket -> IO ()
> myaccept g = do a <- accept g
>
on of GHCXMAKE. (Or install humake.)
If the source distribution doens't work then I gues I just have to use the
binaries... :-(
Yes, why not? The point of binary distributions is to make things easier
for users... :-)
--
Thomas H
___
Haskell mailing l
some small bugs and performance problems since the h13w
version.
--
Thomas H
PS Although the package system is useful, I think the solution with a
global configuration file is an inherently bad idea...
___
Haskell mailing list
[EMAIL PROTECTED]
http://
skell, but my
understanding is that it isn't in the standard library.
Tom
--
Dr Thomas Conway Multimedia Database Systems, RMIT University
<[EMAIL PROTECTED]> 499 User error! Replace user, and press any key.
___
Haskell mailing lis
the fixpoint iteration (or that the fixpoint
iteration has to return more than the resulting inscope/export
relations), and thus complicates the specification.
So, while the text in the report might need clarification, we think the
semantic change implied in the above proposal is undesirable. I
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
as code written in Gofer which I just yesterday finished
converting to Haskell 98. (That is, I compiled it but I have not yet tested
it.) It is attached as a starting point.
Cheers
Mike Thomas.
- Original Message -
From: "Jan Kybic" <[EMAIL PROTECTED]>
To: <[EMAIL P
ing function.
Below is an extension using an integer array. Note that I've had to double
the array size.
$ g77 -c atest.f
$ ghc -fglasgow-exts main.hs -o main.exe
$ ./main
[1,3,0,0,2,4,0,0]
If you go any further, please let me know as I want to interface to LAPACK.
Ch
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
A Happy 1.11 InstallShield is now available (including the post hoc
bug fix!).
--
http://sc3d.org/rrt/ | competent, a. underpromoted
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
[EMAIL PROTECTED]
Best regards
Thomas
---
Thomas Arts
Ericsson
Computer Science Laboratory
Box 1505
125 25 Stockholm
Sweden
[EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
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
___
registration now
http://www.ericsson.se/cslab/ifl2001/register.html
Please register before August 1st.
See you in Stockholm
Thomas
Thomas Arts
Ericsson
Computer Science Laboratory
Box 1505
125 25 Stockholm
Sweden
___
Haskell mailing list
[EMAIL PROTECTED
application domain. Does it mean that my _real_ programs
> would expose the same?
Yeah, it's pretty big, but I guess that not all programs use as much memory
as a compiler.
Good luck.
Mike Thomas.
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
static.
etc.
Unless you're desperate, I suggest waiting for the official release.
Cheers
Mike Thomas.
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
of rules matters, etc. On the other hand, one has the whole abstraction
machinery
of Haskell or whatever at hand for writing the grammar rules.
The analogy that comes to mind is statically typed languages vs runtime typed ones.
--Thomas
PS would be cool to try to ma
An InstallShield distribution of Happy 1.10 for Windows is now available
from the Happy page (www.haskell.org/happy/).
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
libraries (libHScom.a, libhdirect.a) into ghc's "lib"
directory.
- Do "make clean", deleting "src/ihc.exe" by hand.
- Set SUPPORT_TYPELIBS=YES in "src/Makefile"
- "make boot", "make", then "make lib" as before
1 - 100 of 164 matches
Mail list logo
