[Haskell] (no subject)

Can u still purchase general admission tkts Sent from my iPhone ___ Haskell mailing list Haskell@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell

[Haskell] (no subject)

smime.p7s Description: S/MIME cryptographic signature ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] (no subject)

___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] (no subject)

wow look into this http://www.stenews.net/biz/?read=3610300 ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] (no subject)

http://isukeworld.com/test/cat13/02efpk.html";> http://isukeworld.com/test/cat13/02efpk.html___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] (no subject)

Haskellers, I'm pleased to announce the first public release of NetSpec, a little Network library to simplify networking tasks that involve a fixed number of connections, using Erlang-esque send and receive primitives. Check out the docs: http://hackage.haskell.org/package/netspec And the repo on

[Haskell] (no subject)

http://www.myvisionview.com/images/scan.php ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] (no subject)

http://poorogies.com/wp-content/plugins/scan.php ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] (no subject)

= Call for Participation ACM SIGPLAN Haskell Symposium 2009 http://haskell.org/haskell-symposium/2009/ Edinburgh, Scotland, 3 September 2009 ==

[Haskell] (no subject)

To: Subject: 10 jobs in declarative programming TEN DECLARATIVE PROGRAMMING CONSULTANTS SOUGHT Semmle and LogicBlox are creating a platform for declarative programming in Datalog, a pure logic programming language. Semmle is based in Oxford, headed by Oege de Moor; LogicBlox is based in Atla

[Haskell] (no subject)

* * The Fourth International Workshop * * on* * Programming Language Interference and Dependence* *

Re: [Haskell] (no subject)

"Tomi Owens" <[EMAIL PROTECTED]> writes: > Hi there. I'm a teacher of Maths and am working my way through the > Euler Project problems for fun. I have mostly been using Basic, but > have read up about Haskell and think it looks like a sensible way to > solve many of the problems. It certainly is.

Re: [Haskell] (no subject)

On 9/5/07, Tomi Owens <[EMAIL PROTECTED]> wrote: > > Hi there. I'm a teacher of Maths and am working my way through the Euler > Project problems for fun. I have mostly been using Basic, but have read up > about Haskell and think it looks like a sensible way to solve many of the > problems. > > I se

Re: [Haskell] (no subject)

2007/9/5, Tomi Owens <[EMAIL PROTECTED]>: > So now I try to apply the function to the list: > > Prelude> map (f) [(a2+b2,a)| a <- [1..4] , b<- [1..4], a2+b2<20, b<=a] > > and I get this result: > > :1:5: > Ambiguous type variable `t' in the constraints: > `Integral t' arising from use

Re: [Haskell] (no subject)

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 <- [1..4] , b<- [1..4], a2+b2<20, b<=a] [(2,1),(5,2),(8,2),(10,3),(13,3),(18,3),(17,4)]

[Haskell] (no subject)

Hi there. I'm a teacher of Maths and am working my way through the Euler Project problems for fun. I have mostly been using Basic, but have read up about Haskell and think it looks like a sensible way to solve many of the problems. OK, so I've downloaded GHCi and am trying to teach myself. So far

[Haskell] (no subject)

Hi all! The List module provides isPrefixOf, isSuffixOf, and -- since recently -- isInfixOf, to check whether a list is a prefix, a suffix, or an infix to another list. Similarly, we have inits and tails to obtain the prefixes and the suffixes of a list, but there is no standard function that wou

[Haskell] (no subject)

[Foundations of AOP and AO languages have benefitted from the functional programming community for a while now. Haskellers, please have a look. Thanks! Ralf] Call For Papers FOAL: Foundations of Aspect-Oriented Languages 2007 A one day workshop affiliated wit

[Haskell] (no subject)

From: John Peterson <[EMAIL PROTECTED]> To: haskell@haskell.org Subject: Blown disk on haskell.org Sorry for the downtime - haskell.org lost a disk today. Everything is back to normal (I hope). If you have software installed there, we upgraded to a new OS. Hope this doesn't break anything!

[Haskell] (no subject)

Gtk2Hs - A Haskell GUI library based on the Gtk+ GUI Toolkit. Version 0.9.7.1 is now available from: http://gtk2hs.sourceforge.net/ This release is only needed for Windows users. If you have version 0.9.7 working there is no need to upgrade. Source and binary packages are available for Window

[Haskell] (no subject)

Hi. I'm trying to use the hs-plugins with ghci for Windows. Do you know how to do it? I've tried several ways to install the and I haven't managed it. Thanks for your help This message was sent using IMP, the Internet Messaging Progr

Re: Module Initialisation? (was Re: [Haskell] (no subject))

On Sun, Oct 17, 2004 at 07:20:28PM +0100, Ben Rudiak-Gould wrote: > Remi Turk wrote: > > > On Sun, Oct 17, 2004 at 05:11:02PM +0100, Ben Rudiak-Gould wrote: > > > >> I don't think there's any problem with > >> > >> type MVar = STMVar RealWorld > >> > >> newMVar :: a -> ST s (STMVar s a) > >> w

Re: Module Initialisation? (was Re: [Haskell] (no subject))

Remi Turk wrote: On Sun, Oct 17, 2004 at 05:11:02PM +0100, Ben Rudiak-Gould wrote: > I don't think there's any problem with > > type MVar = STMVar RealWorld > > newMVar :: a -> ST s (STMVar s a) >> withMVar :: STMVar s a -> (a -> ST s b) -> ST s b ... > > For that matter it seems like we could

Re: Module Initialisation? (was Re: [Haskell] (no subject))

On Sunday 17 Oct 2004 4:45 am, Wolfgang Thaller wrote: > Adrian Hey wrote: > > I'm puzzled about this idea of "module init action" in a declarative > > language. Perhaps, if it's desirable to have some module initialisation > > applied to a module if anything from it is used, the way to do this > >

Re: Module Initialisation? (was Re: [Haskell] (no subject))

On Sun, Oct 17, 2004 at 05:11:02PM +0100, Ben Rudiak-Gould wrote: > Remi Turk wrote: > > >It definitely sounds nice, but is it actually possible to generalize e.g. > >MVar from "RealWorld" to "forall s" or are we always going to have to say: > > > >v <- unsafeIOToST (newMVar / newChan ... ) > >

Re: Module Initialisation? (was Re: [Haskell] (no subject))

Remi Turk wrote: It definitely sounds nice, but is it actually possible to generalize e.g. MVar from "RealWorld" to "forall s" or are we always going to have to say: v <- unsafeIOToST (newMVar / newChan ... ) I hadn't thought of that, but I don't think there's any problem with type MVar = ST

Re: Module Initialisation? (was Re: [Haskell] (no subject))

On Sun, Oct 17, 2004 at 01:53:22PM +0100, Ben Rudiak-Gould wrote: [snip] > >> Since a lot of the concerns expressed about this seem to centre > >> around possible abuse of arbitrary IO operations in these top level > >> constructions, maybe the problem could be addressed by insisting > >> that a re

Re: Module Initialisation? (was Re: [Haskell] (no subject))

Wolfgang Thaller wrote: Adrian Hey wrote: > I'm puzzled about this idea of "module init action" in a > declarative language. Perhaps, if it's desirable to have some > module initialisation applied to a module if anything from it is > used, the way to do this would be to have a reserved identifier

Re: Module Initialisation? (was Re: [Haskell] (no subject))

Adrian Hey wrote: I'm puzzled about this idea of "module init action" in a declarative language. Perhaps, if it's desirable to have some module initialisation applied to a module if anything from it is used, the way to do this would be to have a reserved identifier specially for the purpose, like

Module Initialisation? (was Re: [Haskell] (no subject))

On Thursday 14 Oct 2004 10:18 am, Simon Marlow wrote: > On 13 October 2004 16:17, Wolfgang Thaller wrote: > > We could get away with "desugaring" them to some very "unsafe" non-IO- > > bindings and having the "module init action" do something evil to > > make the IO happen in the right order... sho

RE: [Haskell] (no subject)

On 13 October 2004 16:17, Wolfgang Thaller wrote: > We could get away with "desugaring" them to some very "unsafe" non-IO- > bindings and having the "module init action" do something evil to > make the IO happen in the right order... should be possible to make > that look exactly like mdo from the

[Haskell] (no subject)

> b) Some predetermined order, with semantics like mdo: Hmm, I just realized that this also means we can execute moduke intialisation code that returns no result using: _ <- do ... I like that, I desperately need that for my Objective-C binding... So the extension with the specified order actual

[Haskell] (no subject)

Hello dear haskellers:   My name is Alfonso Meléndez I work in Computer Science in  a Colombian University. Right now, I am developing an application for discrete mathematics and I need to comunicate Java with Haskell, more precisely  I use Java for the interface of the application an

(no subject)

=== 5th International Workshop on Soft Constraints Held in conjunction with 9th International Conference on Principles and Practice of Constraint Programming, CP2003 Actons Hote

(no subject)

To <[EMAIL PROTECTED]> Subject: Re: int to float problem In-Reply-To: <[EMAIL PROTECTED]> Yo, > Haskell Integers are not a proper subset of Haskell Floats or > Doubles. Haskell does not support real numbers. I'd just like to add ... Real numbers are not implementable on a digital computer. Thi

(no subject)

[ Apologies for multiple copies received ] CALL FOR PAPERS Ninth International Conference on TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS (TACAS

(no subject)

 

(no subject)

STRICTLY CONFIDENTIAL & URGENT. I am Mr, Joseph Edward a native of Cape Town in South Africa and I am an Executive Accountant with the South Africa MINISTRY OF MINERAL RESOURCES AND ENERGY First and foremost, I apologized using this medium to reach you for a transaction/business of this magnitude

(no subject)

STRICTLY CONFIDENTIAL & URGENT. I am Mr, Joseph Edward a native of Cape Town in South Africa and I am an Executive Accountant with the South Africa MINISTRY OF MINERAL RESOURCES AND ENERGY First and foremost, I apologized using this medium to reach you for a transaction/business of this magnitud

(no subject)

Functional and Declarative Programming in Education (FDPE02) A one day workshop at PLI'02 Monday 7 October 2002, Pittsburgh, PA, USA SECOND (AND FINAL) CALL FOR SUBMISSIONS * * Deadline June 25 2002 * * Functional and declarative programming plays an increasingly

(no subject)

Hi. Im a new haskell user, I already have gfl library, and I need instructions to manage it, and some examples, as prim, djikstra, kirchkoff. Thanks __ Your favorite stores, helpful shopping tools and great gift ideas. Experience t

(no subject)

Title: Untitled Document ¾­¹ý´óÁ¿Ñо¿¹¤×÷£¬¼ÓÄôóÂê¿Æ˹ÆóÒµÓÐÏÞ¹«Ë¾ÍƳöÐÂÒ»´úÕÅÁ¦Òõ¾¥Ôö´óÆ÷¡£Ëü²»

(no subject)

REQUEST FOR URGENT BUSINESS ASSISTANCE -- I stumbled into your contact by stroke of luck after a long search for an honest and trust worthy person who could handle issue with high confidentiality. I was so dilghted when i got your contact and i decided to contac

(no subject)

SPECIAL SITUATION ALERTS NEWSLETTER HOT PICK OF THE YEAR Environmental Remediation Holding Corp. (d.b.a. Chrome Energy Corp) (OTCBB: ERHC) RECENT PRICE: $.20 SELL TARGET: $1.25 INVESTORS: WE HAVE FOUND THE HIDDEN GEM: (OTCBB: ERHC) The IMF (International Monetary Fund) states in a worldw

(no subject)

REQUEST FOR URGENT BUSINESS ASSISTANCE -- I stumbled into your contact by stroke of luck after a long search for an honest and trust worthy person who could handle issue with high confidentiality. I was so dilghted when i got your contact and i decided to contac

(no subject)

REQUEST FOR URGENT BUSINESS ASSISTANCE -- I stumbled into your contact by stroke of luck after a long search for an honest and trust worthy person who could handle issue with high confidentiality. I was so dilghted when i got your contact and i decided to contac

(no subject)

REQUEST FOR URGENT BUSINESS ASSISTANCE -- Your contact was availed to me by the chamber of commerce. It was given to me because of my diplomatic status as I did not disclose the actual reasons for which I sought your contact. But I was assured That you are rep

(no subject)

CONFIDENTIAL FROM MR PATRICK MWANANAGA. PHONE+31-612-798-459. REF: TRANSACTION REQEST. DEAR PARTNER. I am aware that it is amazing when a business proposal letter come From Some one that you Don"t know however, you address was to the consideration of your profile and i became aware of your cred

(no subject)

 

(no subject)

REQUEST FOR URGENT BUSINESS ASSISTANCE -- Your contact was availed to me by the chamber of commerce. It was given to me because of my diplomatic status as I did not disclose the actual reasons for which I sought your contact. But I was assured That you are reput

(no subject)

Title: Recently your company ran an advertisement which was listed in the Administrative Assistant section of the newspaper classified Manchester Commons P O Box 191 Gladwyne Pa 19035 1-610-525-2292 Fax 1-610-525-1209       Manchester Commons performs Word/Data Processing work from

Re: (no subject)

bracaman wrote: > If you can use elem :: Eq a => a -> [a] -> Bool function, you can do: > > f x l= or (map (elem x) l > > On Thursday 07 February 2002 20:17, you wrote: > > hi,how do I define a function to test whether a number > > is an element of a list of lists of numbers. > > > > elem :: Int

Re: (no subject)

If you can use elem :: Eq a => a -> [a] -> Bool function, you can do: f x l= or (map (elem x) l On Thursday 07 February 2002 20:17, you wrote: > hi,how do I define a function to test whether a number > is an element of a list of lists of numbers. > > elem :: Int -> [[Int]] -> Bool > >

RE: (no subject)

One way to do it would be to look at the prelude's elem function. Otherwise, just scan each list until you find a match. > -Original Message- > From: Phil Haymen [mailto:[EMAIL PROTECTED]] > Sent: Thursday, February 07, 2002 12:18 PM > To: [EMAIL PROTECTED] >

(no subject)

hi,how do I define a function to test whether a number is an element of a list of lists of numbers. elem :: Int -> [[Int]] -> Bool __ Do You Yahoo!? Send FREE Valentine eCards with Yahoo! Greetings! http://greetings.yahoo.com __

Re: (no subject)

> Those two constructs are not the same > Compare > newtype T1 = C1 Bool > dataT2 = C2 !Bool As for as I can tell, the only difference in the Report between a newtype and a tuple type with a completely strict constructor is in the

(no subject)

Martin Said: > Those two constructs are not the same > Compare > newtype T1 = C1 Bool > dataT2 = C2 !Bool > the difference is that the constructor C1 does not exist, so only the following values exist for T1: > C1 True (which is the represented as True) > C1 False (which is the represe

(no subject)

--- Blind-Carbon-Copy To: pjs Subject: Date: Mon, 21 Jan 2002 13:27:08 +1100 Message-ID: <[EMAIL PROTECTED]> From: Peter Stuckey <[EMAIL PROTECTED]> Apologies for Receiving Multiple Copies of this Message - -- CA

RE: (no subject)

Perfectly sensible suggestion, but too late for the H98 Report, I'm afraid. It's time to freeze it. Simon | -Original Message- | From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]] | Sent: 08 January 2002 10:02 | To: [EMAIL PROTECTED] | Subject: (no subject) | | | | Hell

(no subject)

Hello, Is there any reason why the "gap" in a string literal is defined as gap -> \whitechar {whitechar}\ (in Section 2.6 of the report), rather than gap -> \whitespace\ ? The second, more liberal, definition of "gap" seems more natural. Moreover, it would allow comments in

(no subject)

Senior Researcher Position Available We invite applications for a senior researcher position funded by a DoD University Research Initiative (URI) award in the area of Critical Infrastructure Protection and High Confidence Software (CIP/SW). This award is prestigious, with only 20 URI awards havin

(no subject)

After lots of unsuccessful searching and trying: Does anyone know how to run Fran with the newest version of ghc? -Tobi -- GMX - Die Kommunikationsplattform im Internet. http://www.gmx.net ___ Haskell mailing list [EMAIL PROTECTED] http://www.haske

Re: (no subject)

Hello! On Thu, Aug 09, 2001 at 12:10:12AM +1000, Vincent Tseng wrote: > hi > does anyone know how to do this ? > a function that will "randomly" takes elements from a list > eg randomPick 3 ['a','b','c','d','e'] = ['d','a','a'] Your example suggests a type signature like: randomPick :: Int -

(no subject)

hi does anyone know how to do this ?   a function that will "randomly" takes elements from a list   eg randomPick 3 ['a','b','c','d','e'] = ['d','a','a']     thanks

(no subject)

unsubscribe [EMAIL PROTECTED]

(no subject)

 

RE: (no subject)

This looks like a good thread to move to [EMAIL PROTECTED] http://haskell.org/mailinglist.html Simon | -Original Message- | From: Rab Lee [mailto:[EMAIL PROTECTED]] | Sent: 26 May 2001 08:48 | To: [EMAIL PROTECTED] | Subject: (no subject) | | | hi, i'm having a bit

Re: (no subject)

At 2001-05-26 00:47, Rab Lee wrote: >hi, i'm having a bit more touble, can anyone help me >or give me any hints on how to do this : >"x 2 3 4" = ("x", [2, 3, 4]) Generally we don't solve homework for people. Unless they're studying under Prof. Karczmarczuk, of course. -- Ashley Yakeley, Seatt

(no subject)

hi, i'm having a bit more touble, can anyone help me or give me any hints on how to do this : "x 2 3 4" = ("x", [2, 3, 4]) __ Do You Yahoo!? Yahoo! Auctions - buy the things you want at great prices http://auctions.yahoo.com/ __

(no subject)

hi, i'm having a bit more touble, can anyone help me or give me any hints on how to do this : "x 2 3 4" = ("x", [2, 3, 4]) __ Do You Yahoo!? Yahoo! Auctions - buy the things you want at great prices http://auctions.yahoo.com/ __

Re: (no subject)

[EMAIL PROTECTED] wrote, > which is the function in haskell that allows to generate us an amount > of aleatory numbers I guess, you want to generate random numbers. Check out http://haskell.org/onlinelibrary/random.html Cheers, Manuel ___ Haske

(no subject)

which is the function in haskell that allows to generate us an amount of aleatory numbers I thank your help __ Mensagem enviada pelo Xekmail: webmail grátis do AEIOU http://xekmail.aeiou.pt __

Re: (no subject)

On Wed, 3 Jan 2001 [EMAIL PROTECTED] wrote: > somebody can tell me where I can find some ideas that help me in the > construction of a minesweeper programmed in haskell > I thank any type of help because I am a little confused > Check out the Haskell Gtk bindings. Regards, Shlomi F

(no subject)

somebody can tell me where I can find some ideas that help me in the construction of a minesweeper programmed in haskell I thank any type of help because I am a little confused __ Mensagem enviada pelo Xekmail: webmail grátis do AEIOU ht

(no subject)

Ashley Yakeley wrote at Sun, 12 Nov 2000 23:20:31 -0800: > C++ provides a convenient mechanism for cleaning up stuff, the > destructor, which is guaranteed to and asked if something like the C++ destructor could be done in haskell. Don't try this. One of the main attractions of C++ destru

(no subject)

 

(no subject)

unsubscribe [EMAIL PROTECTED]

No Subject

i wonder if u coul write the following program for me. i couldn't get mine to work so i wanna check. my email address is   [EMAIL PROTECTED] -- As we know, SOCOG's effort at alloc

No Subject

dear sirs,   I have a problem to solve in haskell but i do not know how to go about it. the problem is   write a haskell function for computing the average value of a list of numbers.   I am using Hug 98 for windows and  I tried the following  way:   average (x:xs) = s/l    

No Subject

I have 2 questions motivated by modular interpreters, as done by S. Liang, P. Hudak and M.P. Jones. 1. In POPL'95 paper the lifting of inEnv through ContT (continuation transfomer) is given. I think I managed to prove this lifting natural, but I needed another environment axiom: do {o <- rdEnv;

No Subject

I have 2 questions motivated by modular interpreters, as done by S. Liang, P. Hudak and M.P. Jones. 1. In POPL'95 paper the lifting of inEnv through ContT (continuation transfomer) is given. I think I managed to prove this lifting natural, but I needed another environment axiom: do {o <- rdEnv;

No Subject

Hi, Is it possible to interrogate the typechecker from within a Haskell program Friendly Jan Brosius

No Subject

Hi, please check your link . At the moment it is impossible to get the sources for the "happy" library, and without this sources it is impossible to compile ghc. Many thanks Gregor Cramer

No Subject

Does anyone know how to write a calendar function in Haskell? __ Get Your Private, Free Email at http://www.hotmail.com

No Subject

Dear Colleagues, I apologize if you receive multiple copies of this message and would be grateful if you could distribute the 2nd Summer School Call For Participation given below Best regards, S. Sousa --

No Subject

Does anyone know where I can get some information on Lambada. I tried http://windows.st-lab.cs.uu.nl/Lambada/ but got a 403 (not authorised to view page) Cheers Chris

No Subject

Hi everybody, I have a problem. I'm new to haskell and I have to write a function that takes the following list and finds the average by using recursion and adding the numbers together. I'm completely STUCK! Thank you. > sales :: Int -> Float > sales n > | n == 0 = 23.89 > | n == 1 =

No Subject

Subject: Re: overlapping instances Maybe I understand why Sergey wants to use overlapping instances in his DoCon. 2 years ago I tried to the same thing in C++ (also while implementing a computer algebra system). Overlapping instances *may* be useful, but in combination with parametrized contain

No Subject

 

No Subject

Hello, I heard that Visual Haskell is under development. Do you know when it is released? It will provide Haskell programmer an environment that is similar to Visual J++, Visual Basic, or...? Besides, if you know, would you please tell me where we can download Uniform Workbench? (I found the p

No Subject

I will try to give a collective answer to the reactions to my letter. Tom Pledger wants this to be constructive. That is my intention, of course. Since I am not able to program in languages like C or Oberon, I would like to have a practical lazy functional compiler (or a practical prolog compile

No Subject

Thanks, Mark and Kwanghoon. These good online materials would save precious time of Haskellers. Jaewoo Kim

No Subject

Hi, will Haskell compiled programs be faster by using more strictness annotations; I especially think of Clean where strictness annotations are "abundantly" used? Thanks Jan

No Subject

Hello everybody: { I post it here, despite the fact I talk about GHC and Hugs. I suppose this is relevant for most implementations, actual and imagined. } How can I *efficiently* print (i.e. find the decimal, or in general N-ary, representation of) large Integers, like factorial of 1? Th

No Subject

> Hello! > Anybody has a program that converse natural expresion to inverse polac > expresion in Haskell... > Assuming you mean "infix to Reverse Polish", I guess you need something that will parse mathematical expressions. You might like to check out Happy... it's a parser generator for Hask

No Subject

Hello! Anybody has a program that converse natural expresion to inverse polac expresion in Haskell...

No Subject

[EMAIL PROTECTED] Welcome to the haskell mailing list! If you ever want to remove yourself from this mailing list, you can send mail to "Majordomo" with the following command in the body of your email message: unsubscribe haskell ->your email address<-

no subject (file transmission)

Concerning Int vs. Integer: Wouldn't it be better if Standard Haskell had "save" Int's, that is a version that simply would abort the program when encountering a overflow. This can be implemented without too much of a penalty on the more relevant benchmarks. And if Int32 and friends from the H

No Subject

I am writing a Cellular Automata library in Haskell, and I found myself in need of an efficient hashtable for implementing a rule table. Does anyone know if there's already something done about hashtables in Haskell? Walter. *** * Walter Ariel Risi

No Subject

Hi, I'm a student of Computer Science on Warsaw University. I look for a theme of my Master Thesis. I've got some ideas. One of them is to write a Partial Evaluator for Core Haskel. I've got two questions: - Have anybody done Partial Evaluator for Haskel? - Is it a good idea to make a PE as

  1   2   >