- Haskell - Haskell.org

Please reconsider
by rob and lynne rindzevicius 29 Aug '02

29 Aug '02

Please take a few moments to read this. Your very soul is at risk, because you are performing this barbaric form of murder. How can you sleep at night? All the money that you are making from this procedure is not going to help you when you have to stand and face your God. Don't fool yourself and think that nothing will happen to you. I am begging you to stop this practice.Vol. 36 No. 16 - The Blessed Mother Mary - April 18, 1993 (dictated on February 27, 1993) "I am not old-fashioned, I am a realist. And I am telling you of the realities of the karma of abortion. If abortion has entered your life, I say, call upon the violet flame for the healing of the soul in pain for its mission cut off. Call on the law of forgiveness for yourself. Do not condemn yourself, for I, Mary, do not condemn you, but I urge you to seek early the opportunity of serving life and caring for children that you might learn to love your own inner child and balance the karma of abortion. And pray that in due course you might have a family and bring in the soul or souls whom you aborted through ignorance in an hour when you were perhaps distraught, misled, faced with choices without being given the facts about the life that was aborning in your womb-or perhaps you knew and denied what you knew. Blessed ones, America is not fulfilling her mission because millions of souls are not in life, are not growing up, are not taking their places at your side." Vol. 34 No. 18 - Beloved Jesus Christ - May 5, 1991 (dictated on Easter Sunday, March 31, 1991) "Blessed hearts, let us love this day! Let us enter the love feast! And let us release such a powerful love that it does cast out fear in those who are desiring to seek me and know me and to walk on the road to Emmaus with me-and who would walk out of their churches and follow me down the highways of life to bring in those souls who can yet save an age and can yet put to an end the very possibility of nuclear war and earth changes and all of those karmic predictions that will surely come, I tell you, if this nation does not stop the practice of abortion, legalized and government-sponsored and [tax-]supported abortion. Blessed hearts, it is the karma of a people. It is becoming heavy and heavier until no power will be able to stop it from descending. Therefore if you have love for those in embodiment who have been led astray [by the Supreme Court's decision to legalize abortion] and love for those young women who are bringing forth babes, even at an early age, as Mary did bring me forth from her womb, [you must see to it that] these young ones know the Truth, for the Truth is in their hearts. They need be told only once. For these young maidens, beloved, are surely of my Heart and surely desire to truly know me. I present myself to them, beloved, and I present myself to them through you. They must have a teaching they can understand. They must have a spiritual path instead of a path that is of a dead ritual. Religion is not necessarily spirituality. Therefore let the spiritual path be opened unto them! Let their spiritual eyes be opened! So many of them have the courage to carry their young ones in the face of all adversity and obligations. Blessed hearts, I praise the angels who tend them and their pure hearts who are bringing forth souls. And they are bringing forth souls of Light and many of them are being reared in homes where there is Light and where there is opportunity. This is the hour indeed to be on your knees daily in prayer unto my Mother that you might have from her again the empowerment of the Immaculate Heart. It is the day and the hour to do penance on behalf of the sin of a nation, to atone for that sin by speaking the Word and preaching it. Do not fear the reaction of the world! Do not fear to become unpopular! Do not fear to be put down! Only call upon me and upon Archangel Michael and the hosts of the LORD for your protection and the protection of the ears and the hearts who must know this truth! For they are thirsting for it, they are hungering after this truth and they must know that that soul is integral to that body, to that mind, to that memory, to that sheath of desire, all coming together in that embryo, in that fetus in the womb, beloved. Now I say to you, if this entire momentum of Death and Hell be turned around, nothing shall be impossible to the Church of God upon earth, to his people! For this [abortion of unborn children] is the most deadly of all plots against humanity and the children of Light. It is greater than nuclear war itself, for the destruction of the nucleus of life that is God is the most horrendous crime that is (or can be) practiced, that is (or can be) committed against the backdrop of eternity. Before it is too late, beloved, I say to you, take my staff this day, take my hand. I shall walk with you. I AM he! I AM Jesus and I will keep my promise. I will be at your side in the defense of life-all life, any part of life. Wherever you defend the right of life to be the full expression of God in embodiment in a healthy body, a harmonious home and on a path of Light, wherever you defend the right of the individual to know the truth of my message of all ages that is the path of the resurrection and the ascension in the Light, I will be with you! This is my promise. May you not lose it by departing into old patterns." Vol. 33 No. 41 - Beloved Mother Mary - October 21, 1990 (dictated on Friday, October 26, 1990) Think, then, what is the karma of abortion! The karma is that one day, should you pass from the screen of life not having fulfilled your mission [on earth] and not having balanced sufficient karma [to enter heaven's gates], which would have allowed you to pass through [the initiations of] the resurrection and the ascension, you yourself will be seeking entrée to the physical octave through the portals of birth. And at that moment, beloved, the karma of having performed or had an abortion may greet you with the denial [of opportunity] to once again enter earth's schoolroom because you have denied life to another. This is the law of karma. It is real and it is true. Therefore there be souls at inner levels, beloved, who have been denied that life who have a tremendous anguish and frustration that they are not in embodiment to help you meet the crisis of your cities and your nations [and] every [other] crisis that besets you this day. One of the principal reasons why there is such crisis is that those whom God has sent to be here when these challenges were to come upon earth are not in embodiment. They are crying on the astral plane and in the etheric octave because they do not stand [at your side] to assist you. Thus, the woes shall come upon this earth, beloved, for this karma of the nations. Therefore I ask you to pray to my Immaculate Heart and to give the New Age rosary as I have given it to this Messenger, which does avail much for yourself and much for the world. There are things that can be mitigated, beloved, and then there are freewill decisions made in spiritual blindness by those in embodiment that do upset the cycles of the turning of the ages." Vol. 32 No. 14 - Beloved Peace and Aloha - April 2, 1989 (dictated on Sunday, June 10, 1984)

1 0

SAS'02 Call for Participation -- Early Registration: * September 3 *
by SAS2002 28 Aug '02

28 Aug '02

[ Please Distribute -- Apologies for Receiving Multiple Copies ] [ CALL FOR PARTICIPATION: Early Registration Extended: * September 3 * ] [ EU funded student grants available ] -------------------------------------------------------------------------- CALL FOR PARTICIPATION SAS'02 The 9th International Static Analysis Symposium Madrid, Spain 17 - 20 September 2002 -------------------------------------------------------------------------- On-line Registration and Hotel Reservations: http://clip.dia.fi.upm.es/SAS02/ Early registration date is ** September 3, 2002 ** -------------------------------------------------------------------------- SAS'02 is Organized by: Department of Computer Science, Technical University of Madrid ---------------------------------------------------------------------- The Ninth International Static Analysis Symposium (SAS'02) will be held at the Technical University of Madrid (UPM), co-located with Logic-based Program Development and Transformation (LOPSTR'02), the APPIA-GULP-PRODE Joint Conference on Declarative Programming (AGP'02), and a number of workshops. Static Analysis is increasingly recognized as a fundamental tool for high performance implementations and verification systems of high-level programming languages. The series of Static Analysis Symposia has served as the primary venue for presentation of theoretical, practical, and application advances in the area. Invited Talks include: Static Program Analysis via 3-Valued Logic Thomas Reps, University of Wisconsin Open Modeling in Multi-stakeholder Distributed Systems: Research and Tool Challenges Robert J. Hall, AT&T Labs Research An Algebraic Approach to the Static Analysis of Concurrent Software Javier Esparza, University of Edinburgh Secrets of Software Model Checking Thomas Ball, Microsoft Research Accepted papers: Static Analysis of the Numerical Stability of Loops Martel Matthieu Modular Control Flow Analysis for Libraries Christian Probst On termination of programs with real numbers computations Alexander Serebrenik and Danny De Schreye Polynomial Constants are Decidable Markus Müller-Olm and Helmut Seidl Normalizable Horn clauses, Strongly Recognizable Relations and Spi Flemming Nielson, Hanne Riis Nielson, and Helmut Seidl Detecting Optimal Termination Conditions of Logic Programs Fred Mesnard, Etienne Payet, and Ulrich Neumerkel Representing and approximating transfer functions in Abstract Interpretation of hetereogeneous datatypes Bertrand Jeannet Improving the Precision of Equality-Based Dataflow Analyses Erik Ruf >From Secrecy to Authenticity in Security Protocols Bruno Blanchet Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation Charles Hymans Refinement of LTL Formulas for Abstract Model Checking Maria del Mar Gallardo, Pedro Merino, and Ernesto Pimentel Making Abstract Model Checking Strongly Preserving Francesco Ranzato and Francesco Tapparo Static Confidentiality Enforcement for Distributed Programs Andrei Sabelfeld and Heiko Mantel More Precise Yet Efficient Type Inference for Logic Programs Claudio Vaucheret and Francisco Bueno A Few Graph-Based Relational Numerical Abstract Domains Antoine Mine' Pipeline Modeling for Timing Analysis Marc Langenbach, Stephan Thesing, and Reinhold Heckmann Compactly Representing First-Order Structures for Static Analysis R. Manevich, G.Ramalingam, J. Field, D. Goyal, and M. Sagiv Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties Damien Masse States vs. Traces in Model Checking by Abstract Interpretation Roberto Giacobazzi and Francesco Ranzato Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis Stephen Adams, Thomas Ball, Manuvir Das, Sorin Lerner, Sriram K. Rajamani, Mark Seigle, and Westley Weimer Analysing Approximate Confinement under Uniform Attacks Alessandra Di Pierro, Chris Hankin, and Herbert Wiklicky Reuse of results in termination analysis of typed logic programs Maurice Bruynooghe, Michael Codish, Samir Genaim, and Wim Vanhoof Backward Type Inference Generalises Type Checking Lunjin Lu and Andy King Security Typings by Abstract Interpretation Mirko Zanotti Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library R. Bagnara, E. Ricci, E. Zaffanella, and P. M. Hill Reliable Optimization for Imperative Languages: Proving Nullspace Properties of Compilers Todd L. Veldhuizen and Andrew Lumsdaine Representation Analysis for Coercion Placement Karl-Filip Faxen Ensuring Termination of Offline Partial Evaluation in Polynomial Time (A New Finiteness Analysis) Chin Soon Lee Automated Verification of Concurrent Linked Lists with Counters Tuba Yavuz-Kahveci and Tevfik Bultan An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages John Whaley and Monica Lam An Improved Constraint-Based System for the Verification of Security Protocols Ricardo Corin and Sandro Etalle Nonuniform Alias Analysis of Recursive Data Structures and Arrays Arnaud Venet -------------------------------------------------------------------------- Organized by: ------------- Department of Computer Science, Technical University of Madrid Program Chair: Conference Chair: -------------- ----------------- Manuel Hermenegildo German Puebla Program Committee ----------------- Manuel Hermenegildo Technical University of Madrid, Spain German Puebla Technical University of Madrid, Spain Radhia Cousot Ecole Polytechnique, France Saumya Debray The University of Arizona, USA Manuel Fahndrich Microsoft Research, USA Roberto Giacobazzi Univerity of Verona, Italy Chris Hankin Imperial College, UK Giorgio Levi Univerity of Pisa, Italy Kim Marriott Monash University, Australia Alan Mycroft Cambridge University, United Kingdom Ganesan Ramalingam IBM T.J. Watson Research Center, USA Martin Rinard Massachusetts Institute of Technology, USA Shmuel Sagiv Tel-Aviv Univerisity, Israel Reinhard Wilhelm Universitat des Saarlandes, Germany -------------------------------------------------------------------------- EU funded grants are available for European full-time students or researchers with limited budget. For more info please visit: http://clip.dia.fi.upm.es/SAS-LOPSTR-AGP/grants.html Grants include accommodation for the days of the conference and a registration waiver. -- ----------------------------------------------------------------------------- 9th International Static Analysis Symposium SAS'02 17-20 September 2002, Madrid Spain Technical University of Madrid http://clip.dia.fi.upm.es/SAS02/ sas02(a)clip.dia.fi.upm.es ----------------------------------------------------------------------------- -- ----------------------------------------------------------------------------- 9th International Static Analysis Symposium SAS'02 17-20 September 2002, Madrid Spain Technical University of Madrid http://clip.dia.fi.upm.es/SAS02/ sas02(a)clip.dia.fi.upm.es -----------------------------------------------------------------------------

1 0

RE: ugliness with state parameter in ST stuff
by Simon Peyton-Jones 28 Aug '02

28 Aug '02

I don't know what you are trying to do, but I do know why your program is rejected. The *whole point* of a value of type (STArray s Int Int) is that it can only be read by a state thread with the same type parameter 's' as the array. Given your decls > class Foo a where > foo :: a -> IO Int > > data Bar s = Bar (STArray s Int Int) > > instance Foo (Bar s) where ... it is absolutely right that you are going to fail. To implement the instance decl, you need to make foo :: forall s. Bar s -> IO Int But you can read an STArray parameterised by an *arbitrary* state type s using the IO monad! Of course not! There is even a theorem in 'State in Haskell' that makes just this point: separate state threads really are separate, and you can't read a reference from one in another. No, no, no! Simon | -----Original Message----- | From: Hal Daume III [mailto:hdaume@ISI.EDU] | Sent: 06 August 2002 19:20 | To: Haskell Mailing List | Subject: ugliness with state parameter in ST stuff | | | Sorry for the flood of emails this morning, but I've got | something which has really got me scratching my head. | | Suppose I have a class: | | > class Foo a where | > foo :: a -> IO Int | | and a datatype with a single function: | | > data Bar s = Bar (STArray s Int Int) | > | > getFirst :: Bar s -> ST s Int | > getFirst (Bar arr) = readArray arr 0 | | Now, I want to make (Bar s) and instance of Foo. But I can't | seem to do this. If I use: | | > instance Foo (Bar s) where | > foo = stToIO . getFirst | | GHC complains: | | Cannot unify the type-signature variable `s' | with the type `RealWorld' | Expected type: Bar s -> IO Int | Inferred type: Bar RealWorld -> IO Int | In the expression: stToIO . getFirst | In the definition of `foo': stToIO . getFirst | | and if I use: | | > instance Foo (Bar s) where | > foo = return . runST . getFirst | | GHC complains: | | Inferred type is less polymorphic than expected | Quantified type variable `s' escapes | Expected type: ST s a -> c | Inferred type: (forall s1. ST s1 a) -> a | In the first argument of `(.)', namely `runST' | In the second argument of `(.)', namely `runST . getFirst' | | Is there no way to do this? I can change the definition of Foo to: | | > class Foo2 a where | > foo2 :: (forall s . a s) -> IO Int | | I can define: | | > instance Foo2 Bar where | > foo2 = stToIO . getFirst | | Which I suppose works, but the problem is that in real life, | "Foo" is "Binary" and I can't really change it. | | Suggestions? (Other than simply moving all my ST stuff over to the IO | monad?) | | - Hal | | -- | Hal Daume III | | "Computer science is no more about computers | hdaume(a)isi.edu | than astronomy is about telescopes." -Dijkstra | www.isi.edu/~hdaume | | _______________________________________________ | Haskell mailing list | Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell |

1 0

RE: difference between (evaluate . runST) and stToIO
by Simon Peyton-Jones 28 Aug '02

28 Aug '02

They aren't identical. runST guarantees to run a complete state thread that can't interact with any other. stToIO runs some imperative actions that might interact with other stToIO calls. You might find it helpful to read 'State in Haskell' if you havn't already done so. Simon | -----Original Message----- | From: Hal Daume III [mailto:hdaume@ISI.EDU] | Sent: 06 August 2002 18:55 | To: Haskell Mailing List | Subject: difference between (evaluate . runST) and stToIO | | | I can't seem to figure out what the difference is between using | | evaluate (runST action) | | and | | stToIO action | | when in the IO monad and running something in ST...they seem | to behave identically...are they? | | If they are, why do they have different type signatures (one | is ST RealWorld a -> IO a, while the other is (forall s. ST s | a) -> IO a)? | | - Hal | | -- | Hal Daume III | | "Computer science is no more about computers | hdaume(a)isi.edu | than astronomy is about telescopes." -Dijkstra | www.isi.edu/~hdaume | | _______________________________________________ | Haskell mailing list | Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell |

1 0

RE: GHC bug,or Hugs feature?
by Simon Peyton-Jones 28 Aug '02

28 Aug '02

There are two things going on. 1. Hugs deals with mutual recursion in a more sophisticated way than GHC. Mark T is absolutely right, and the THIH paper explains. 2. Furthermore,GHC implements the H98 requirement that the context of all functions in a mutually recursive groups must be the same. So f :: Eq a => ... g :: Ord a => ... is illegal if f and g are mutually recursive. Both these things arise from the way GHC translates mutually recursive overloaded defns. Consider f :: Ord a => a -> a -> a f x y = ...(x==y)...(x>y)...(f y x)... GHC translates it thus: f ord_dict = let gr = select_gr ord_dict eq_dict = select_eq ord_dict eq = select_eq eq_dict fm x y = ...(eq x y)...(ord x y) ...(fm y x)... in fm Note that all the dictionary selection (and sometimes construction) is done outside the loop, implemented by 'fm'. Matters get more complicated when there is mutual recursion; suffice it it say that in order to pull the dictionary manipuation outside the loop, all the contexts must be the same. Arguably, H98 and GHC are wrong, and the restrictions should be lifted. GHC usually errs on the side of lifting restrictions (with -fglasgow-exts) but on this occasion the benefit seemed slight, while it turns out that the cost of changing the way let/where is dealt with is not inconsiderable. So I've let sleeping dogs lie. I think it's a corner case that seldom matters. Counter examples to this claim would be interesting. At least I hope this explains what's happening. Simon | -----Original Message----- | From: Mark Tullsen [mailto:mtullsen@cse.ogi.edu] | Sent: 09 August 2002 20:31 | To: haskell(a)haskell.org | Cc: Arthur Baars | Subject: Re: GHC bug,or Hugs feature? | | | I believe the incompatibilities are explained thus: | | In section 4.5.1 of the Haskell Report it only states that | "A dependency analysis transformation is first performed | to increase | polymorphism" | | But hugs appears to be using a more refined version of the | dependency | analysis as explained in section 11.6.3 of Mark Jones' paper Typing | Haskell in Haskell. Read that section. | | - Mark | | | Arthur Baars wrote: | > In Mark Jones' paper Typing Haskell in Haskell, I found the | following | > example(in the section on binding-groups): | > | > f :: Eq a => a -> Bool | > f x = x==x || g True | > g y = y<=y || f True | > | > According to the paper the inferred type of g should be: | g::Ord a => | > a -> Bool | > | > Hugs infers this type but GHC infers the following | *ambiguous* type: | > *Main> :i g | > -- g is a variable, defined at Test.hs:25 | > g :: forall a. (Eq a) => Bool -> Bool | > | > When adding an explicit type signature for g, Hugs happily | accepts the | > code, but GHC gives the following error: | > | > f :: Eq a => a -> Bool | > f x = x==x || g True | > g :: Ord a => a -> Bool | > g y = y<=y || f True | > | > Test.hs:24: | > Couldn't match `{Ord a}' against `{Eq a1}' | > When matching the contexts of the signatures for | > g :: forall a. (Ord a) => a -> Bool | > f :: forall a. (Eq a) => a -> Bool | > The signature contexts in a mutually recursive group | should all be | > identical | > When generalising the type(s) for g, f | > Failed, modules loaded: none. | > | > I think the problems are caused by differences in the binding group | > analysis in Hugs and GHC. | > | > Malcolm, could you check what NHC says about the examples above? | > | > Cheers, | > Arthur | > | > _______________________________________________ | > Haskell mailing list | > Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell | > | | | _______________________________________________ | Haskell mailing list | Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell |

1 0

RE: ambiguous type variables in existential classes
by Simon Peyton-Jones 28 Aug '02

28 Aug '02

Hal I don't quite understand the intuitions behind your program, but the bug is easy enough: | instance (Eq e, Foo p) => Foo (Wrap p) where | foo (Bar p) e q = foo p e q This instance declaration is guaranteed to give problems if it is ever used, and GHC should probably bleat about it. Suppose you have the constraint Foo (Wrap T) where T is some type. Using the instance declaration we can simplify this to the constraints Eq e Foo T where e is a fresh type variable. But we are never going to learn any thing more about 'e', and so it is correctly reported as ambiguous. It's like writing reverse :: Eq x => [a] -> [a] Any call to this 'reverse' will give a constraint (Eq x) that is ambiguous. Really, GHC should reject the instance declaration. Simon

1 0

Evaluation order, ghc versus hugs, lazy vs. strict
by Jan Kybic 28 Aug '02

28 Aug '02

Hello, I am wrestling with having Haskell (using ghc(i) version 5.02.2) evaluate things in good order and to garbage collect what he no longer needs. I could simplify the problem to this simple example: main = print $ sum [0..1000000] When you use a sufficiently large number (perhaps 10000000 instead of 1000000), both ghci and ghc terminate with "Stack space overflow". On the other hand, Hugs (dated December 2001) runs the example OK and produces the result of 500000500000. I have the following questions: 1. Why does this happen? Why does not ghc Haskell generate the list lazily, summing as he goes and forgetting what he no longer needs? 2. How can I find out what happens? The normal profiling ( -prof -auto-all ) does not seem to be very helpful. Could not we get some kind of tracing, printing out what is being evaluated? 3. How can I tell Haskell what I want ? a) that the (+) in sum is strict. It is in this case but in other more complex, like "foldl1 f [0..1000000]" I end up with closures f ( f ( f ( f ( ....)))) which are not evaluated until the end. b) that the list [0..1000000] should be lazy, e.g. evaluated only as needed I will be very grateful for any help. I am trying to use Haskell for numerical calculations but so far I am not very satisfied: the code is very elegant but runs of the order of many magnitudes slower than the corresponding C implementation. Please help me avoid going to C again. Thanks, Jan -- ------------------------------------------------------------------------- Jan Kybic <kybic(a)ieee.org> Odyssee, INRIA, Sophia-Antipolis, France or <Jan.Kybic(a)sophia.inria.fr>,tel. work +33 492 38 7589, fax 7845 http://www-sop.inria.fr/robotvis/personnel/Jan.Kybic/

8 16

Re: Pretty printing (was: Standard Library for text formatting?)
by Zdenek Dvorak 26 Aug '02

26 Aug '02

Hello, > > After doing some searching, it seems that "pretty printing" is > > a prominant "Haskell way" of doing text output. I still am > > interested in finding a library of standard text formatting > > (String formatting) functions, but it seems like it might > > be worth my while investigating pretty printing. > >Pretty printing is not very suited for printf like formatting, I have looked for something simmilar some time ago, but unsuccesfully. Pretty printing libraries are not very useful for breaking paragraphs into lines, distributing spaces evenly, etc. (at least I was not able to persuade them to work like that). I have written following module that implements stupid first-fit algorithm for these purposes; the interface is simmilar to the pretty printing libraries. Zdenek Dvorak module ReportPrinter ( LowDoc,HighDoc, (<>),(<+>),($$),(<$>), int, lowText, text, empty, colon, comma, space, semi, period, brackets, parens, vcat, sep, punctuate, high, nest, par, render ) where data LowDoc=Text String | Join LowDoc LowDoc | Append LowDoc LowDoc | Empty deriving (Show) data HighDoc=HLowDoc LowDoc | Paragraph Int HighDoc | Nest Int HighDoc | Above HighDoc HighDoc | Beside HighDoc HighDoc deriving (Show) (<>)::LowDoc->LowDoc->LowDoc x <> Empty = x Empty <> x = x x <> y = Join x y (<+>)::LowDoc->LowDoc->LowDoc x <+> Empty = x Empty <+> x = x x <+> y = Append x y (<$>)::HighDoc->HighDoc->HighDoc x <$> HLowDoc Empty=x HLowDoc Empty <$> x=x x <$> y=Beside x y ($$)::HighDoc->HighDoc->HighDoc x $$ HLowDoc Empty=x HLowDoc Empty $$ x=x x $$ y=Above x y lowText::String->LowDoc lowText=Text text::String->LowDoc text str=sep $ map lowText $ words str int::Int->LowDoc int=text . show empty::LowDoc empty=Empty colon::LowDoc colon=lowText ":" comma::LowDoc comma=lowText "," space::LowDoc space=lowText " " semi::LowDoc semi=lowText ";" period::LowDoc period=lowText "." brackets::LowDoc->LowDoc brackets doc=lowText "[" <> doc <> lowText "]" parens::LowDoc->LowDoc parens doc=lowText "(" <> doc <> lowText ")" sep::[LowDoc]->LowDoc sep=foldl (<+>) empty high::LowDoc->HighDoc high=HLowDoc vcat::[HighDoc]->HighDoc vcat=foldl ($$) (high empty) punctuate::LowDoc->[LowDoc]->[LowDoc] punctuate _ [] = [] punctuate _ [x] = [x] punctuate pun (h:t) = (h <> pun) : punctuate pun t nest::Int->HighDoc->HighDoc nest=Nest par::Int->HighDoc->HighDoc par=Paragraph render::Int->HighDoc->String render width doc=highRender width 0 0 doc "" highRender::Int->Int->Int->HighDoc->String->String highRender width indFirst indRest doc rest= case doc of HLowDoc lowDoc -> lowRender width indFirst indRest lowDoc rest Paragraph ind pDoc -> highRender width indFirst (indRest+ind) pDoc rest Nest ind pDoc -> highRender width (indFirst+ind) (indRest+ind) pDoc rest Above doc1 doc2 -> highRender width indFirst indRest doc1 $ highRender width indRest indRest doc2 rest Beside doc1 doc2 -> error "Rendering two HighDocs beside not supported." lowRender::Int->Int->Int->LowDoc->String->String lowRender width indFirst indRest doc rest= stringRender width indFirst indRest strs rest where (strs,_) = stringify False doc [] stringify False (Text txt) rest = ((txt,length txt):rest,False) stringify True (Text txt) [] = ([(txt,length txt)],False) stringify True (Text txt) ((txt',len'):rest) = ((txt++txt',length txt+len'):rest,False) stringify join Empty rest = (rest,join) stringify join (Append doc1 doc2) rest = let (rest',join')=stringify join doc2 rest in stringify join' doc1 rest' stringify join (Join doc1 doc2) rest = let (rest',_)=stringify join doc2 rest in stringify True doc1 rest' stringRender::Int->Int->Int->[(String,Int)]->String->String stringRender width indFirst indRest [] rest=rest stringRender width indFirst indRest strs rest= let (lne,rst)=cutLine (width-indFirst) strs rest'=stringRender width indRest indRest rst rest in lineRender (rst==[]) width indFirst lne rest' cutLine tot ((txt,len):t)=(txt:lne',rst) where (lne',rst)=cutLine' (tot-len) t cutLine' ml []=([],[]) cutLine' ml r@((tx,ln):t') | ml>ln = let (lne'',rst')=cutLine' (ml-ln-1) t' in (tx:lne'',rst') | otherwise = ([],r) lineRender::Bool->Int->Int->[String]->String->String lineRender last width ind lne rest=indent ind rslt where totlen = sum $ map length lne words = length lne reqlen = totlen + words - 1 havelen = width - ind distsp = if havelen > reqlen && not last then havelen - reqlen else 0 count = words `div` 2 rslt = distribSpaces count distsp words lne rest indent n = (take n (cycle " ") ++) distribSpaces::Int->Int->Int->[String]->String->String distribSpaces _ _ _ [h] rest = h ++ '\n' : rest distribSpaces count minus plus (h:t) rest = h ++ ' ' : spaced where (spaced,count') = recount count rest' = distribSpaces (count'-minus) minus plus t rest recount cnt | cnt < 0 = let (spaced',cnt')=recount (cnt+plus) in (' ':spaced',cnt') | otherwise = (rest',cnt) _________________________________________________________________ Join the worlds largest e-mail service with MSN Hotmail. http://www.hotmail.com

1 0

future business ��Ѻ�س!
by future＠businez.com 26 Aug '02

26 Aug '02

> >��蹵�� Ѻ�š��áԨ��Թ��絔 >��ǡѺ��¹�ŧ��˭� >��Ѻ�ٻẺ�ͧ�ҹ��͹Ҥ� ��ؤ�ͧ�š��ᴹ �ѹ�� >�ҹ��¹�ŧ͹Ҥ��ҧ��Թ�ͧ�س��ʹ� > �Ѻ�ҹ价��ѹ�� >��ö�� 8,000 � 50,000 �ҷ/��͹ > >�Ѻ��Ѥ÷�駼��ͧ�� ѹ�� 2-3 �� ͧ��Ш� > >��ԡ�� http://www.zthefuture.com/advanced >�� http://www.thaiworkathome.com/advanced > > > >��ҷ�ҹ��ͧ��â��Ţ��ù�� CLICK�� >http://www.thaiworkathome.com/unsubscribe.php

1 0

Haskell on FreeBSD
by Oliver Braun 26 Aug '02

26 Aug '02

Hi Haskellers on FreeBSD, I have committed a bunch of new Haskell ports to the FreeBSD ports tree. The FreeBSD ports tree contains now 18 Haskell related ports: devel/c2hs devel/drift devel/green-card devel/haddock devel/happy devel/hat devel/hmake devel/hpl devel/popenhs graphics/hgl lang/generic-haskell lang/ghc lang/ghc-doc lang/hugs lang/nhc98 textproc/haxml x11-toolkits/frantk x11-toolkits/gtk+hs Is any Haskeller on FreeBSD interested in giving me some feedback, working with me on more Haskell ports or on the improvement of the existing ports. Please feel free to drop me a note or file a PR. Regards, Olli [lets start a "Haskell on FreeBSD" project] -- «: IST & IIS _ INF _ UniBwM :: obraun(a)informatik.unibw-muenchen.de :» «: Tele-Consulting GmbH :: obraun(a)Tele-Consulting.com :» «: FreeBSD Commmitter :: obraun(a)FreeBSD.org :»

1 0