Re: ANNOUNCE: GHC version 5.04.2 released
Hi, Are there going to be SuSE rpms available anytime soon? Anyone working on them? Thanks, J.A. ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
Re: fundeps question
On Monday 16 December 2002 18:18, Ashley Yakeley wrote: > In article <[EMAIL PROTECTED]>, > > Hal Daume III <[EMAIL PROTECTED]> wrote: > > I spent about a half hour toying around with this and came up with the > > following, which seems to work (in ghci, but not hugs -- question for > > smart people: which is correct, if either?)... > > Both are correct. Hugs fails (correctly) because it doesn't have > anything like -fallow-overlapping-instances. Urr... I think hugs "invented" overlapping instances - or at least Mark Jones did... ;-) Try `+o'. --Jeff ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
RE: Running out of memory in a simple monad
Alastair Reid writes: > The workaround is simple enough: add a dummy argument to the CAF (so > that it is not a CAF any more): > >main _ = loop 5 > > and then specify the extra argument when invoking it: > >main () > > (This is a pretty standard optimisation technique: we're trading time > to recompute a result for the space taken to store the result. Coming > from other languages where actions (i.e., monadic computations) are > not first class values, this is a bit surprising but, from a Haskell > perspective, it is completely uniform.) Careful: this isn't guaranteed to turn a CAF into a function. In particular, GHC will "optimise away" this trick when optimisation is turned on (and perhaps even when it isn't). The point is that adding dummy arguments isn't really a technique that should be relied upon. You might well argue that there ought to be a way to control the operational behaviour of the program w.r.t. CAFs (and in fact sharing in general), and I'd be inclined to agree. Also, GHCi retains CAFs in the same way as Hugs, the difference is that GHCi can be configured to throw away the results after evaluation (:set +r). Cheers, Simon ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
Foundations of Object-Oriented Languages (FOOL10): Call for Participation
Call for Participation == 10th International Workshop on Foundations of Object-Oriented Languages (FOOL10) January 18, 2003 - New Orleans, Louisiana Following POPL 2003 URL: http://www.cis.upenn.edu/~bcpierce/FOOL/FOOL10.html E-mail: [EMAIL PROTECTED] The search for sound principles for object-oriented languages has given rise to much work on the theory of programming languages during the past 15 years, leading to a better understanding of the key concepts of object-oriented languages and to important developments in type theory, semantics, and program verification. The FOOL workshops (http://www.cis.upenn.edu/~bcpierce/FOOL/index.html) bring together researchers to share new ideas and results in these areas. Program: 8:55 Start 9:00-10:00 Invited Talk: Andrew Kennedy - Microsoft Reasearch Cambridge UK: "Parametric Polymorphism for Popular Programming Languages", 10:00-10:30 Break 10:30-12:00 Session 1 1) "External Uniqueness" Dave Clarke, Tobias Wrigstad 2) "Enforcing Resource Usage Protocols via Scoped Methods" Gang Tan, Xinming Ou, David Walker 3) "Subtyping Mobile Classes and Mixins" Lorenzo Bettini, Viviana Bono, Betti Venneri 12:00-14:00 Lunch 14:00-15:00 Session 2 1) "Static Analysis for JML's assignable Clauses" Fausto Spoto, Erik Poll 2) "A Model of Garbage Collection for OO Languages" Rob Hunter, Shriram Krishnamurthi 15:00-15:30 Break 15:30-17:00 Session 3 1) "Abstract Data Types in Modular and Object-Oriented Programming: Algebraic and Flat Modeling " Philippe Narbel 2) "A Nominal Theory of Objects with Dependent Types" Martin Odersky, Vincent Cremet, Christine Rockl, Matthias Zenger 3) "Regular Object Types" Vladimir Gapeyev, Benjamin C. Pierce Details about registration and hotel reservation can be found at the FOOL10 web site http://www.cis.upenn.edu/~bcpierce/FOOL/FOOL10.html, while more information on POPL 2003 can be found at http://www.csd.auth.gr/~setn02/en/index.htm. We are looking forward to meeting you in New Orleans in January. Prof. Giorgio Ghelli, PhD Universita' di Pisa, Dipartimento di Informatica, Via Buonarroti 2, I-56125, Pisa, ITALY mailto:[EMAIL PROTECTED] http://www.di.unipi.it/~ghelli ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
