Re[2]: Polymorphic recursion

and that explains how to increase the limit. As a complement, I remembered Milner himself talked about this extension in one of his papers. I am curious why the original poster would need this feature. To support nested datatype, for example? sincerely, Shin-Cheng Mu Academia Sinica, Taiwan.

A compliment for www.haskell.org

A comment made by a friend of mine who wanted to learn Haskell and tried to find relevant information himself. From: [EMAIL PROTECTED] (Spencer Yu) To: [EMAIL PROTECTED] (Shin-Cheng Mu) Date: Wed, 20 Jan 1999 13:19:12 +0800 (CST) blah blah blah deleted. www.haskell.org is surprisingly friendly

Re: Lists and FP (was Re: Functions allowing either 0 or 1 parameters?)

like to know whether the state-of-the-art Haskell compilers are able to handle these cases and how it is done other than massively trying to deforest everything. sincerely, Shin-Cheng Mu Academia Sinica, Taiwan.

Re: lines --- to derive, or not to derive ;-)

while the Prelude version only wastes a pair cell for every line. Why is the Prelude version slower? Can someone give an explanation? sincerely, Shin-Cheng Mu

Re: Inverse Indices

. Science of Computer Programming, 12(2):93-104. sincerely, Shin-Cheng Mu

Re: monadic source of randomness

what you want but you may find it interesting. F. Warren Burton and Rex L. Page. Distributed random number generation. Journal of Functional Programming, 2(2):203-212, April 1992. sincerely, Shin-Cheng Mu Norman Ramsey wrote: Does anybody know of work using monads

Deforestration harmful?

you very much. sincerely, Shin-Cheng Mu ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

[Haskell] Polymorphic types without type constructors?

constructors (for example [forall a. a-a], a list of for-all's, is illegal). But is this the reason why exp cannot be typed? If so, is there a reason for such a restriction? Thank you very much! sincerely, Shin-Cheng Mu ___ Haskell mailing list Haskell

[Haskell] Re: Polymorphic types without type constructors?

Hi, Shin-Cheng Mu wrote: exp2 = \m::N - \n::N - \f::(b - b) - \b::b - n [b-b] (m[b]) f b Oops.. it should be exp2 = \m::N - \n::N - \f::(b - b) - \b::b - n [b] (m[b]) f b sincerely, Shin-Cheng Mu ___ Haskell mailing list

[Haskell] Re: help with some basic code that doesn't work

Malcolm Wallace [EMAIL PROTECTED] wrote: Just a comment, since a couple of people have made similar statements. Haskell will derive Eq for arbitrarily complex types - there is no restriction to simple types, whatever they might be. Now that this topic is brought up... Occasionally I would need to

[Haskell] WGP 2011: Call for Papers

polymorphism, * object-oriented generic programming, * and so on. Organizers -- Co-Chair Jaakko Järvi, Texas AM University, USA Co-Chair Shin-Cheng Mu, Academia Sinica, Taiwan Programme Committee --- Dave Abrahams, BoostPro Computing, USA Magne Haveraaen

[Haskell] 2nd CFP: ACM SIGPLAN 7th Workshop on Generic Programming (WGP 2011)

-oriented generic programming, * and so on. Organizers -- Co-Chair Jaakko Järvi, Texas AM University, USA Co-Chair Shin-Cheng Mu, Academia Sinica, Taiwan Programme Committee --- Dave Abrahams, BoostPro Computing, USA Magne Haveraaen, Universitetet i Bergen, Norway

[Haskell] CFP: APLAS 2011, Kenting, Taiwan

Vafeiadis (MPI-SWS, Germany) Kapil Vaswani (MSR, India) Martin Vechev (IBM, USA) Peng Wu (IBM, USA) Hongseok Yang (Queen Mary U. London, UK) Pen-Chung Yew (Academia Sinica, Taiwan) ORGANIZERS: Mike Dodds, U. Cambridge (Poster chair) Shin-Cheng Mu, Academia Sinica, Taiwan (Local arrangement chair) Noam

[Haskell] Call for Papers: PEPM 2013, Partial Evaluation and Program Manipulation

-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia) * James R. Cordy (Queen's University, Canada) * R

[Haskell] PEPM 2013: Second Call for Papers

via the workshop web site. PROGRAM CO-CHAIRS Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria

[Haskell] PEPM 2013: Final Call for Papers

, Germany): Partially Static Operations See the workshop web site homepage for abstracts. PROGRAM CO-CHAIRS Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia

[Haskell] PEPM 2013: Deadline Extension

University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia) * James R. Cordy

[Haskell] APLAS 2023 first Call for Papers

://conf.researchr.org/track/aplas-2023/posters-and-src ORGANIZERS - General Chair: Shin-Cheng Mu, Academia Sinica, Taiwan Program Chair: Chung-Kil Hur, Seoul National University, Korea Publicity Chair: Ryosuke Sato, University of Tokyo, Japan Program

Re: Failed to compile PosixProcPrim on Linux

itself would be a good test? I noticed that during some stages of compiling GHC by GHC, ghc/driver/ghc is used for the compilation rather than the installed ghc compiler in PATH. Is it a copy of the installed compiler? sincerely, shin-cheng mu Academia Sinica, Taiwan

sigcontext v.s. sigcontext_struct

there be a path to work around? Thanks. ;) sincerely, Shin-Cheng Mu Academia Sinica, taiwan

Problem making Int.mp_o (3.03)

Bombarding you again with problems compiling GHC. :) GHC complained not seeing type constructor ForeignObj when compiling Int.lhs, with GhcLibWays = mp. I attached the error message below.. I noticed that ForeignObj is defined in lib/std/PrelForeign.lhs if PARALLEL_HASKELL is NOT defined. What

3.03 on Linux -- sigset_t unknown in StgMacros.h

-Cheng Mu Academia Sinica, Taiwan

Building GHC on a PPC Mac

table" hc source for newer versions of GHC? If not, I should start from 0.29. Actually I have been trying and I started to (as expected) encounter some problems. Is it still maintained and supported? sincerely, Shin-Cheng Mu Computing Lab, Oxford

Space leak due to pairs

is hxpc.hs. There is a 1 MB sized sample input file size1m.xml. There are two simple scripts recompile and runhxpc for compiling and running the program. sincerely, Shin-Cheng Mu ___ Glasgow-haskell-users mailing list Glasgow-haskell-users

Encoding Lists with Lengths by Type Family

Hi, I understand that the type family is still an experimental feature in GHC. This is just a confirmation whether it is a bug, or is what the designers intended. I am curious how much dependent type programming I can emulate using GADT and type family. Therefore I started with the typical list

readline problem on OS X

/local/lib. For some reason, GHCi was not able to locate it, so I added a symbolic link under /usr/lib. I don't know whether I pointed GHCi to the wrong library.) Thank you very much. sincerely, Shin-Cheng Mu ___ Glasgow-haskell-users mailing list [EMAIL

Re: readline problem on OS X

it as a compiler bug to [EMAIL PROTECTED], or http://sourceforge.net/projects/ghc/. Hmm.. strange.. sincerely, Shin-Cheng Mu ___ Glasgow-haskell-users mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/glasgow-haskell-users

[Haskell-cafe] APLAS07 - Call for Participation

) Shin-Cheng Mu(Academia Sinica, Taiwan) Henrik Nilsson (University of Nottingham, UK) Michael Norrish (NICTA, Australia) Jens Palsberg(University of California, Los Angeles, USA) G. Ramalingam(Microsoft Research, India) Zhendong Su (University

[Haskell-cafe] Space leak when returning pairs?

. There is a 1 MB sized sample input file size1m.xml. There are two simple scripts recompile and runhxpc for compiling and running the program. Thank you! sincerely, Shin-Cheng Mu ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

Re: [Haskell-cafe] Space leak when returning pairs?

Dear Henning, On May 19, 2006, at 6:16 PM, Henning Thielemann wrote: On Fri, 19 May 2006, Shin-Cheng Mu wrote: idX :: [XMLEvent] - ([XMLEvent], [XMLEvent]) idX (StartEvent a : strm) = let (ts, strm') = idX strm (us, strm'') = idX strm' in (StartEvent a [] : ts

Re: [Haskell-cafe] Space leak when returning pairs?

cannot quite explain why (Anyone?). Is there a more structured solution? Can I leave the hard work to the compiler? sincerely, Shin-Cheng Mu ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Bidirectional programming in Haskell

Hi, On Tue May 26 01:21:28 EDT 2009, Artyom Shalkhakov wrote: Are there any libraries for bidirectional [1] programming in Haskell? Any related work? Some of the early work in the PSD project (closely related to the lenses) were developed in Haskell,

[Haskell-cafe] Developing Programs and Proofs Spontaneously using GADT

I am curious about the possibility of developing Haskell programs spontaneously with proofs about their properties and have the type checker verify the proofs for us, in a way one would do in a dependently typed language. In the exercise below, I tried to redo part of the merge-sort example in

[Haskell-cafe] Re: Developing Programs and Proofs Spontaneously using GADT

Thanks for the comments. I will take a look at the type family extension. The definition of plusFn proposed by Jim Apple worked nicely. The solution from apfelmus works after fixing a small typo: newtype Equal a b = Proof (forall f . f a - f b ) newtype Succ f a = InSucc { outSucc :: f (S a)

[Haskell-cafe] Re: creating graphics the functional way

On 05/08/07, Frank Buss [EMAIL PROTECTED] wrote: Is it possible to write functions with an arbitrary number of arguments? Would be nice if the average function would accept any number of pixel values. You may be interested to see Oleg Kiselyov's discussion on polyvariadic functions in

[Haskell-cafe] WGP 2011: Call for Papers

polymorphism, * object-oriented generic programming, * and so on. Organizers -- Co-Chair Jaakko Järvi, Texas AM University, USA Co-Chair Shin-Cheng Mu, Academia Sinica, Taiwan Programme Committee --- Dave Abrahams, BoostPro Computing, USA Magne Haveraaen

[Haskell-cafe] CFP: APLAS 2011, Kenting, Taiwan

Vafeiadis (MPI-SWS, Germany) Kapil Vaswani (MSR, India) Martin Vechev (IBM, USA) Peng Wu (IBM, USA) Hongseok Yang (Queen Mary U. London, UK) Pen-Chung Yew (Academia Sinica, Taiwan) ORGANIZERS: Mike Dodds, U. Cambridge (Poster chair) Shin-Cheng Mu, Academia Sinica, Taiwan (Local arrangement chair) Noam

[Haskell-cafe] 2nd CFP: ACM SIGPLAN 7th Workshop on Generic Programming (WGP 2011)

-oriented generic programming, * and so on. Organizers -- Co-Chair Jaakko Järvi, Texas AM University, USA Co-Chair Shin-Cheng Mu, Academia Sinica, Taiwan Programme Committee --- Dave Abrahams, BoostPro Computing, USA Magne Haveraaen, Universitetet i Bergen, Norway

[Haskell-cafe] CFP: APLAS 2011, Kenting, Taiwan

Vafeiadis (MPI-SWS, Germany) Kapil Vaswani (MSR, India) Martin Vechev (IBM, USA) Peng Wu (IBM, USA) Hongseok Yang (Queen Mary U. London, UK) Pen-Chung Yew (Academia Sinica, Taiwan) ORGANIZERS: Mike Dodds, U. Cambridge (Poster chair) Shin-Cheng Mu, Academia Sinica, Taiwan (Local arrangement chair) Noam