[Haskell-cafe] PEPM'12 Call for participation
ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM12 January 23-24, 2012. Philadelphia, PA, USA (co-located with POPL'12) Call For Participation Online registration is open at https://regmaster3.com/2012conf/POPL12/register.php Early registration deadline is December 24, 2011 The PEPM Symposium/Workshop series brings together researchers and practitioners working in the broad area of program transformation, which spans from refactoring, partial evaluation, supercompilation, fusion and other metaprogramming to model-driven development, program analyses including termination, inductive programming, program generation and applications of machine learning and probabilistic search. PEPM focuses on techniques, supporting theory, tools, and applications of the analysis and manipulation of programs. In addition to the presentations of regular research papers, the PEPM program includes tool demonstrations and `short paper' presentations of exciting if not fully polished research. PEPM has established a Best Paper award. The winner will be announced at the workshop. INVITED TALKS Compiling Math to High Performance Code Markus Pueschel (ETH Zuerich, Switzerland) http://www.inf.ethz.ch/~markusp/index.html Specification and verification of meta-programs Martin Berger (University of Sussex, UK) http://www.informatics.sussex.ac.uk/users/mfb21/ ACCEPTED PAPERS Regular research papers: Naoki Kobayashi, Kazutaka Matsuda and Ayumi Shinohara. Functional Programs as Compressed Data Kazutaka Matsuda, Kazuhiro Inaba and Keisuke Nakano. Polynomial-Time Inverse Computation for Accumulative Functions with Multiple Data Traversals Dana N. Xu. Hybrid Contract Checking via Symbolic Simplification Susumu Katayama. An Analytical Inductive Functional Programming System that Avoids Unintended Programs Roberto Giacobazzi, Neil Jones and Isabella Mastroeni. Obfuscation by Partial Evaluation of Distorted Interpreters Michael Gorbovitski, Yanhong A. Liu, Scott Stoller and Tom Rothamel. Composing Transformations for Instrumentation and Optimization Elvira Albert, Jesus Correas Fernandez, German Puebla and Guillermo Roman-Diez. Incremental Resource Usage Analysis Takumi Goto and Isao Sasano. An approach to completing variable names for implicitly typed functional languages Martin Hirzel and Bugra Gedik. Streams that Compose using Macros that Oblige Vlad Ureche, Tiark Rompf, Arvind Sujeeth, Hassan Chafi and Martin Odersky. StagedSAC: A Case Study in Performance-Oriented DSL Development Markus Degen, Peter Thiemann and Stefan Wehr. The Interaction of Contracts and Laziness Surinder Kumar Jain, Chenyi Zhang and Bernhard Scholz. Translating Flowcharts to Non-Deterministic Languages Francisco Javier Lopez-Fraguas, Enrique Martin-Martin and Juan Rodriguez-Hortala. Well-typed Narrowing with Extra Variables in Functional-Logic Programming Geoff Hamilton and Neil Jones. Superlinear Speedup by Distillation: A Semantic Basis Short papers: Jacques Carette and Aaron Stump. Towards Typing for Small-Step Direct Reflection Janis Voigtlaender. Ideas for Connecting Inductive Program Synthesis and Bidirectionalization Tool demonstration papers: Edvard K. Karlsen, Einar W. Hoest and Bjarte M. Oestvold. Finding and fixing Java naming bugs with the Lancelot Eclipse plugin Adriaan Moors, Tiark Rompf, Philipp Haller and Martin Odersky. Scala-Virtualized Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gomez-Zamalloa and German Puebla. COSTABS: A Cost and Termination Analyzer for ABS Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thomp...@kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] XML modification
Hi guys. I've got a folder with about 80 XML files in it. I want to take each file and make specific modifications to it. (Mostly just finding specific attributes and changing their values to make then all consistent.) Now I guess it wouldn't take me /that/ long to code something from scratch. But does anybody have a better suggestion for tools or libraries that might be useful? ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] Fwd: XML modification
Personally I prefer xml-enumerator. You can work with xml-stream or with DOM through cursor (like XPath). I think that in your case working with stream is preferrable. You can just make an Enumeratee like import qualified Data.Enumerator.List as EL myEnum = EL.map f where f (EventBeginElement n ats) = ... -- parse attributes f e = e 2011/11/23 Andrew Coppin andrewcop...@btinternet.com Hi guys. I've got a folder with about 80 XML files in it. I want to take each file and make specific modifications to it. (Mostly just finding specific attributes and changing their values to make then all consistent.) Now I guess it wouldn't take me /that/ long to code something from scratch. But does anybody have a better suggestion for tools or libraries that might be useful? __**_ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/**mailman/listinfo/haskell-cafehttp://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] XML modification
Andrew Coppin andrewcop...@btinternet.com writes: I've got a folder with about 80 XML files in it. I want to take each file and make specific modifications to it. (Mostly just finding specific attributes and changing their values to make then all consistent.) Now I guess it wouldn't take me /that/ long to code something from scratch. But does anybody have a better suggestion for tools or libraries that might be useful? HaXml Before google earth exposed a facility for computing path lengths, I wrote my own using HaXml. The guts of it look like this: main … xml - fmap (xmlParse filename) (readFile filename) print_path_length xml print_path_length (Document _ _ content _) = print $ compute_length $ coordinate_string_to_list coordinate_string where coordinate_string = singleCString . (txt `o` children `o` deep (tag coordinates)) $ (CElem content) which gives some idea of the flavour. -- Jón Fairbairn jon.fairba...@cl.cam.ac.uk http://www.chaos.org.uk/~jf/Stuff-I-dont-want.html (updated 2010-09-14) ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] A Mascot
From: Michael Orlitzky mich...@orlitzky.com On 11/22/11 16:52, heathmatlock wrote: Wasn't planning on it, but I saw some emails on the topic, so I worked on what I presented earlier: Anyway, creative design-by-committee is doomed, so my advice is to ignore this and all other advice =) +1 (The knight is my favorite, but Da for Mascot regardless) ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] XML modification
On 23/11/2011 10:14 AM, Jon Fairbairn wrote: Andrew Coppinandrewcop...@btinternet.com writes: I've got a folder with about 80 XML files in it. I want to take each file and make specific modifications to it. HaXml Mmm. That looks very promising... which gives some idea of the flavour. OK. So it looks like processXmlWith is the function I want, if I'm going to read one file and create another from it. So now I just need to figure out which combinators I need. (The documentation seems a bit thin.) Can you show me a snippet for how I would find [one] element named foo and change its bar attribute to have the value 5? ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] ANN: OpenCL 1.0.2.2 package
Hello, all. I update the OpenCL package with a better error handle using Control.Exception. Thanks all comments in the previous version, and issues in github. # Where to get it * Hackage page (http://hackage.haskell.org/package/OpenCL) * Repository (https://github.com/zhensydow/opencl) * Bugs (https://github.com/zhensydow/opencl/issues) # Changes: * Changed LICENSE to BSD3 * Changed error from 'IO (Either CLError a)' to IO a + CLError exceptions * Added creation of programs using precompiled binaries (added example program) * Better documentation. Thanks, Luis Cabellos ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] lambda.fm How can I use this to help the Haskell community?
Stream podcasts on functional programming. On Tue, Nov 22, 2011 at 5:39 AM, Ben Wright bwright...@gmail.com wrote: A while back I somehow managed to get the domain name, lambda.fm and I am simply creating this post to get some ideas from the community on what it could be used for to help the FP community. So tell me what you think. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Heath Matlock +1 256 274 4225 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] lambda.fm How can I use this to help the Haskell community?
Or set up a system like this: http://www.linux.fm/ :) amindfv / Tom On Wed, Nov 23, 2011 at 11:38 AM, heathmatlock heathmatl...@gmail.comwrote: Stream podcasts on functional programming. On Tue, Nov 22, 2011 at 5:39 AM, Ben Wright bwright...@gmail.com wrote: A while back I somehow managed to get the domain name, lambda.fm and I am simply creating this post to get some ideas from the community on what it could be used for to help the FP community. So tell me what you think. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Heath Matlock +1 256 274 4225 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] XML modification
On 23/11/2011 12:58 PM, Andrew Coppin wrote: On 23/11/2011 10:14 AM, Jon Fairbairn wrote: HaXml Mmm. That looks very promising... which gives some idea of the flavour. OK. So it looks like processXmlWith is the function I want, if I'm going to read one file and create another from it. So now I just need to figure out which combinators I need. (The documentation seems a bit thin.) Can you show me a snippet for how I would find [one] element named foo and change its bar attribute to have the value 5? Well, from what I've been able to gather, HaXml has a really nice filter combinator library. However... Weird thing #1: processXmlWith handles the common case of loading a file from disk, filtering it, and saving the result to disk again. However, it does this based on CLI arguments. There is no function anywhere that I can find which allows the host program to specify what files to process. If you want to do that, you have to reimplement most of the body of this function all over again yourself. That seems a strange omission. Weird thing #2: There are absolutely no filters for dealing with attributes. I couldn't find anything anywhere that says apply this function to all the attributes of this element. I can find a function to /replace/ an element's attributes without regard to what existed before. But even something as trivial as adding an additional attribute while keeping the existing ones doesn't appear to be supported at all. Fortunately it turns out to not be especially hard to read the source for the replace-attributes function and change it to do what I want. But, again, it seems a rather large and obvious ommission. (I'm guessing that since attributes are key/value pairs and not content, you would need a seperate attribute filter type, which is different from the existing content filters. Even so, it shouldn't be /that/ hard to do...) Anyway, the important thing is, Haskell (and more specifically HaXml) let me accomplish the task I wanted without too much fuss. It's /certainly/ faster than editing 80 files by hand in a text editor! ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] A Mascot
On Wed, Nov 23, 2011 at 1:44 AM, Moritz Fischer hask...@pure-entropy.orgwrote: If you want people to identify even faster with Da, start by uploading some CC licenced SVGs. One thing that helps a lot imho is to allow other people to be creative with it, too. Done. Darcs: https://patch-tag.com/r/heath/Haskell-Mascot Git: https://github.com/heath/Haskell-Mascot -- Heath Matlock +1 256 274 4225 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] A Mascot
On Wed, Nov 23, 2011 at 12:31 PM, heathmatlock heathmatl...@gmail.comwrote: On Wed, Nov 23, 2011 at 1:44 AM, Moritz Fischer hask...@pure-entropy.orgwrote: If you want people to identify even faster with Da, start by uploading some CC licenced SVGs. One thing that helps a lot imho is to allow other people to be creative with it, too. Done. Darcs: https://patch-tag.com/r/heath/Haskell-Mascot Git: https://github.com/heath/Haskell-Mascot As a heads up, you'll need to be familiar with layers if you want to see everything. -- Heath Matlock +1 256 274 4225 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] lambda.fm How can I use this to help the Haskell community?
There's plenty of recorded research and workshop talks on Haskell, having a well-organized collection of them would definitely be helpful. Podcasts could be added, certainly. On Wed, Nov 23, 2011 at 12:00 PM, Tom Murphy amin...@gmail.com wrote: Or set up a system like this: http://www.linux.fm/ :) amindfv / Tom On Wed, Nov 23, 2011 at 11:38 AM, heathmatlock heathmatl...@gmail.com wrote: Stream podcasts on functional programming. On Tue, Nov 22, 2011 at 5:39 AM, Ben Wright bwright...@gmail.com wrote: A while back I somehow managed to get the domain name, lambda.fm and I am simply creating this post to get some ideas from the community on what it could be used for to help the FP community. So tell me what you think. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Heath Matlock +1 256 274 4225 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Edward Amsden Student Computer Science Rochester Institute of Technology www.edwardamsden.com ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] Poll: Do you want a mascot?
Question: Do you want a mascot? Answers: Yes No -- This is an attempt to figure out if this idea is going anywhere. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
No On 24 November 2011 06:11, heathmatlock heathmatl...@gmail.com wrote: Question: Do you want a mascot? Answers: Yes No -- This is an attempt to figure out if this idea is going anywhere. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Ivan Lazar Miljenovic ivan.miljeno...@gmail.com IvanMiljenovic.wordpress.com ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
No On 23 Nov 2011, at 23:11, heathmatlock wrote: Question: Do you want a mascot? Answers: Yes No -- This is an attempt to figure out if this idea is going anywhere. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
No -- Scott Lawrence ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] Proposed change to mime-mail
Hi all, I've found and solved a problem with mime-mail, and Michael Snoyman asked me to send a request for feedback to -cafe, so here goes. In short, the issue is with address headers containing 'special' (non-ascii) characters. In mime-mail, these are automatically encoded according to RFC 2047. However, the email address part of an address header is not allowed to be encoded. My patch adds 'from', 'to', 'cc' and 'bcc' fields to the Mail data type, and creates correct headers from these fields. This does make the Mail type a bit larger, so I've also added a smart constructor with initializes these fields with empty lists (only 'from' is required). For more details, see my initial bug report [1] and my patches in the pull request [2]. If you have any comments on this change, please let me know. Regards, Erik [1] https://github.com/snoyberg/mime-mail/issues/5 [2] https://github.com/snoyberg/mime-mail/pull/6 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
Yes On Wed, Nov 23, 2011 at 19:11, heathmatlock heathmatl...@gmail.com wrote: Question: Do you want a mascot? Answers: Yes No -- This is an attempt to figure out if this idea is going anywhere. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
Yes PS: Why not using Doodle for the poll? signature.asc Description: Digital signature ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
I don't want a bad mascot. I do want a good mascot. If you must count me down for one side or the other, count this as a yes. On Wed, Nov 23, 2011 at 8:11 PM, heathmatlock heathmatl...@gmail.com wrote: Question: Do you want a mascot? Answers: Yes No -- This is an attempt to figure out if this idea is going anywhere. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Work is punishment for failing to procrastinate effectively. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
Yes
Reasoning:
Haskell has the image of being unfriendly, assenine, filled with crazy symbols,
and the dreaded MATHS! A mascot would say you know what, this is fun!
if (*ra4 != 0xffc78948) { return false; }
On 23 Nov 2011, at 19:40, Alexander Bernauer wrote:
Yes
PS: Why not using Doodle for the poll?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] type level strings?
So suppose I have a simple data type:
data Thing {
thing_id :: ThingId
, thing_stuff :: Stuff
}
newtype ThingId = ThingId String
Stuff is a Monoid, and Things need to be combined as well, so:
instance Monoid Thing where
mappend (Thing id1 stuff1) (Thing id2 stuff2)
| id1 /= id2 = error ...
| otherwise = Thing id1 (stuff1 `mappend` stuff2)
mempty = Thing $ (ThingId dummy value?) mempty
So clearly both the error and the dummy value? are not very nice
(and mappend would need a special hack to treat the dummy as
compatible with everything). I'd like to be able to lift that ID up
to the type level, and then I don't have to worry about incompatible
IDs and the mempty can figure out the ID from the type.
Now if ThingId were a natural, I gather there's a new GHC feature for
type level naturals that can do this kind of thing. Of course any
string could be encoded into a large natural, but the resulting type
errors would be less than readable. There is probably also a way to
encode type level strings in the same way as the traditional way for
type level naturals, e.g. 'data A; ... data Z;' and then a type
encoding for lists. But I'm guessing that would also lead to
excessive compilation times and crazy type errors.
In any case, I don't think this can work even if I used naturals
instead of ints, because it seems to me I can't write a function
'(NatI n) = ThingId - Thing n' without a statically knowable
constant value for 'n'. Otherwise, the value has magically
disappeared into the type system and I can't expect to get it back
after types are erased.
So I need a runtime value for the ThingId, but it still seems like it
should be possible to do something better than the 'error' and dummy
value?. Maybe there's a completely different way to ensure that
incompatible Things can't be mappended. Any ideas?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
On Wed, Nov 23, 2011 at 1:40 PM, Alexander Bernauer alex-hask...@copton.net wrote: Yes PS: Why not using Doodle for the poll? Email is an easy way to make sure nobody votes twice. -- Heath Matlock +1 256 274 4225 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
Yes 2011/11/23 heathmatlock heathmatl...@gmail.com On Wed, Nov 23, 2011 at 1:40 PM, Alexander Bernauer alex-hask...@copton.net wrote: Yes PS: Why not using Doodle for the poll? Email is an easy way to make sure nobody votes twice. -- Heath Matlock +1 256 274 4225 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
Yes If some people don't like it, they won't use it. I doubt it will find its way in highly technical haskell core team, but it could appear for fun here and there in web material. For example, I think we could have 3 variants of it, reflecting the haskell level (beginner, confirmed, guru). Whenever someone writes an article about Haskell, (s)he could place one of them at the top of the page to immediatly show the target audience. Question: Do you want a mascot? Answers: Yes No -- Paul ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Quickcheck research
which makes me think that Arbitrary isn't the right set of abstractions for controlling coverage of the value space. I agree with you Wren. I think what is needed is a library for expressing the distribution of values for a given type. I can see several ways of specifying distributions, directly (exponential, normal, etc), qualitative constraints (a tuple where each value is less then the next), constraints on moments (MaxEnt), etc, there are many ways that are not mutually exclusive. There are other ways to improve quickcheck. Writing arbitrary instance could be made more declarative. The process of describing an indicator function that fully determines the set of values that are valid for my type, and writing the sequence of steps necessary to make the function efficient could be separated. Combinatorial species and symbolic combinatorics are too possibilities to simplify the creation of arbitrary functions. There might be way go from list of functions to an generator. Something like make_arb :: [a - Bool] - Gen a That is psuedo code, since you can't reify a function. But that would be the idea, although I don't think it would work in all cases. Also, the current quickcheck workflow is to run it until a example of valid input fails a test. When this happens the example should be used in a regression. Creating unit tests automatically from failed quickcheck cases would be a time saver. Additionally the right type mutation of testing would be a great addition to quickcheck. -Jonathan ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
2011/11/23 heathmatlock heathmatl...@gmail.com: Question: Do you want a mascot? Answers: Yes No -- This is an attempt to figure out if this idea is going anywhere. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe Yes. Best, Karol Samborski ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
{^_^}
|||
2011/11/23 Alejandro Serrano Mena trup...@gmail.com
Yes
2011/11/23 heathmatlock heathmatl...@gmail.com
On Wed, Nov 23, 2011 at 1:40 PM, Alexander Bernauer
alex-hask...@copton.net wrote:
Yes
PS: Why not using Doodle for the poll?
Email is an easy way to make sure nobody votes twice.
--
Heath Matlock
+1 256 274 4225
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot? -- please stop this
On Wed, Nov 23, 2011 at 5:52 PM, heathmatlock heathmatl...@gmail.comwrote: On Wed, Nov 23, 2011 at 1:40 PM, Alexander Bernauer alex-hask...@copton.net wrote: Yes PS: Why not using Doodle for the poll? Email is an easy way to make sure nobody votes twice. 1. It's unlikely to get feedback from the larger Haskell community 2. It floods people with email they don't care (unless they care to keep track of the results) 3. One can just as easily create throw-away emails, subscribe to the list and answer the poll 4. etc... My suggestion is to create a poll somewhere else and let it run for at least a month. Or a more elaborated survey with additional questions trying to capture the community's feeling toward a masket and what kind. I don't think we are in a hurry to get a mascot here so let's take the time and do it properly. -- Giovanni ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot? -- please stop this
I second this. One way is to use Forms from Google Docs. 1. They have been used with success before for similar pools 2. Can provide more elaborate questions 3. Automatically put results into a spreadsheet, which is useful 4. Protect against double-voters (sort of) 5. No spam Best regards, Krzysztof Skrzętnicki On Wed, Nov 23, 2011 at 21:25, Giovanni Tirloni gtirl...@sysdroid.comwrote: On Wed, Nov 23, 2011 at 5:52 PM, heathmatlock heathmatl...@gmail.comwrote: On Wed, Nov 23, 2011 at 1:40 PM, Alexander Bernauer alex-hask...@copton.net wrote: Yes PS: Why not using Doodle for the poll? Email is an easy way to make sure nobody votes twice. 1. It's unlikely to get feedback from the larger Haskell community 2. It floods people with email they don't care (unless they care to keep track of the results) 3. One can just as easily create throw-away emails, subscribe to the list and answer the poll 4. etc... My suggestion is to create a poll somewhere else and let it run for at least a month. Or a more elaborated survey with additional questions trying to capture the community's feeling toward a masket and what kind. I don't think we are in a hurry to get a mascot here so let's take the time and do it properly. -- Giovanni ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] Current Haskell report URL
Is there a reason that the Haskell 2010 report is in a subdirectory of haskell.org/onlinereport (which currently points to the Haskell98 standard)? http://www.haskell.org/onlinereport/ -- Haskell98 http://www.haskell.org/onlinereport/haskell2010/ -- Haskell2010 If it's for historical reasons - because books etc. use this URL for the 98 standard, then I'd highly recommend making a new directory called currentreport or something (if there isn't one already). The current impression that we give is that Haskell98 is the current standard, and Haskell2010 isn't compiler-supported. amindfv / Tom ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] A Mascot
I don't like the lamb at all. But I like the idea of a language mascot. I really like Adam Chlipala's spidurweb: http://www.impredicative.com/ur/ Maybe a lambdacat can volunteer. ;-) Regards, Dave ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
heathmatlock wrote: Question: Do you want a mascot? No. I also really think this poll should have been in a web site somewhere and not on this list. Erik -- -- Erik de Castro Lopo http://www.mega-nerd.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Proposed change to mime-mail
Erik Hesselink wrote: Hi all, I've found and solved a problem with mime-mail, and Michael Snoyman asked me to send a request for feedback to -cafe, so here goes. In short, the issue is with address headers containing 'special' (non-ascii) characters. In mime-mail, these are automatically encoded according to RFC 2047. However, the email address part of an address header is not allowed to be encoded. My patch adds 'from', 'to', 'cc' and 'bcc' fields to the Mail data type, and creates correct headers from these fields. This does make the Mail type a bit larger, so I've also added a smart constructor with initializes these fields with empty lists (only 'from' is required). For more details, see my initial bug report [1] and my patches in the pull request [2]. If you have any comments on this change, please let me know. +1 Erik -- -- Erik de Castro Lopo http://www.mega-nerd.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot? -- please stop this
On Wed, Nov 23, 2011 at 2:25 PM, Giovanni Tirloni gtirl...@sysdroid.comwrote: 1. It's unlikely to get feedback from the larger Haskell community 2. It floods people with email they don't care (unless they care to keep track of the results) 3. One can just as easily create throw-away emails, subscribe to the list and answer the poll I thought about this, but I was trying to keep the response short. 4. etc... My suggestion is to create a poll somewhere else and let it run for at least a month. I suppose we could do this. Kryzyztof suggested Google Docs, so I created a poll there: https://docs.google.com/spreadsheet/viewform?formkey=dFpic3dzZkVtcW5yZkVWbFNuckpyWmc6MQ Or a more elaborated survey with additional questions trying to capture the community's feeling toward a masket and what kind. I'm not sure what additional questions would be appropriate. I don't think we are in a hurry to get a mascot here so let's take the time and do it properly. I can agree to that. The reasons I created a poll using the email method are: 1. Typically, mail programs have methods of keeping emails separated by topic, so your mailbox isn't littered with just one topic. 2. It's quick with little hassle, just respond. But, you have a point about reaching a wider audience. My only concern is how many people outside of the Haskell community are going to vote. Without methods of recognizing who's spamming the results, it's difficult to really judge how accurately the poll reflects the community's views. Polldaddy.com has nice spam filters. I'm guessing posting functional Javascript to the wiki isn't possible though, this would require someone with write access to the site. -- Heath Matlock +1 256 274 4225 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] A Mascot
On 24 November 2011 09:10, David Barbour dmbarb...@gmail.com wrote: I don't like the lamb at all. But I like the idea of a language mascot. I really like Adam Chlipala's spidurweb: That to me is more of a logo than a mascot. -- Ivan Lazar Miljenovic ivan.miljeno...@gmail.com IvanMiljenovic.wordpress.com ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] A Mascot
On Wed, Nov 23, 2011 at 2:53 PM, Ivan Lazar Miljenovic ivan.miljeno...@gmail.com wrote: On 24 November 2011 09:10, David Barbour dmbarb...@gmail.com wrote: I don't like the lamb at all. But I like the idea of a language mascot. I really like Adam Chlipala's spidurweb: That to me is more of a logo than a mascot. Maybe so, but any mascot needs to make a good logo. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
I wouldn't mind getting a lamb-astronaut tshirt with a lambda-bind logo on it for my kid, and maybe next month a lion-skateboarder with a lambda-bind on his deck, and then maybe something with a dinosaur. I guess I don't really want a mascot either, but I like this artwork. Conrad. On 24 November 2011 06:18, Erik de Castro Lopo mle...@mega-nerd.com wrote: heathmatlock wrote: Question: Do you want a mascot? No. I also really think this poll should have been in a web site somewhere and not on this list. Erik -- -- Erik de Castro Lopo http://www.mega-nerd.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] type level strings?
You can do this with phantom types, i.e.:
data Thing a = Thing Stuff
instance Monoid (Thing a) where
mappend (Thing stuff1) (Thing stuff2) = Thing (stuff1 `mappend` stuff2)
mempty = Thing mempty
data ID1
data ID2
thing1 :: Thing ID1
thing1 = Thing Stuff
thing2 :: Thing ID2
thing2 = Thing Stuff
-- will not typecheck:
f = thing1 `mappend` thing2
2011/11/23 Evan Laforge qdun...@gmail.com
So suppose I have a simple data type:
data Thing {
thing_id :: ThingId
, thing_stuff :: Stuff
}
newtype ThingId = ThingId String
Stuff is a Monoid, and Things need to be combined as well, so:
instance Monoid Thing where
mappend (Thing id1 stuff1) (Thing id2 stuff2)
| id1 /= id2 = error ...
| otherwise = Thing id1 (stuff1 `mappend` stuff2)
mempty = Thing $ (ThingId dummy value?) mempty
So clearly both the error and the dummy value? are not very nice
(and mappend would need a special hack to treat the dummy as
compatible with everything). I'd like to be able to lift that ID up
to the type level, and then I don't have to worry about incompatible
IDs and the mempty can figure out the ID from the type.
Now if ThingId were a natural, I gather there's a new GHC feature for
type level naturals that can do this kind of thing. Of course any
string could be encoded into a large natural, but the resulting type
errors would be less than readable. There is probably also a way to
encode type level strings in the same way as the traditional way for
type level naturals, e.g. 'data A; ... data Z;' and then a type
encoding for lists. But I'm guessing that would also lead to
excessive compilation times and crazy type errors.
In any case, I don't think this can work even if I used naturals
instead of ints, because it seems to me I can't write a function
'(NatI n) = ThingId - Thing n' without a statically knowable
constant value for 'n'. Otherwise, the value has magically
disappeared into the type system and I can't expect to get it back
after types are erased.
So I need a runtime value for the ThingId, but it still seems like it
should be possible to do something better than the 'error' and dummy
value?. Maybe there's a completely different way to ensure that
incompatible Things can't be mappended. Any ideas?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] type level strings?
On Wed, Nov 23, 2011 at 4:03 PM, Holger Reinhardt hreinha...@gmail.com wrote: You can do this with phantom types, i.e.: data Thing a = Thing Stuff instance Monoid (Thing a) where mappend (Thing stuff1) (Thing stuff2) = Thing (stuff1 `mappend` stuff2) mempty = Thing mempty data ID1 data ID2 thing1 :: Thing ID1 thing1 = Thing Stuff thing2 :: Thing ID2 thing2 = Thing Stuff -- will not typecheck: f = thing1 `mappend` thing2 Well yes, but the key feature is that the IDs are arbitrary strings. And they're not knowable at compile time, since they are read from user input... ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] type level strings?
On Thu, Nov 24, 2011 at 10:06 AM, Evan Laforge qdun...@gmail.com wrote: Well yes, but the key feature is that the IDs are arbitrary strings. And they're not knowable at compile time, since they are read from user input... You can still use phantom types for this, you just need existentials as well. For example, you could define a type for indexed strings/id's as: data IString s = IString String data Exists f = forall x. Exists (f x) read :: String - Exists IString read stuff = Exists (IString stuff) I assume you'll also want to compare strings/id's, in which case you'll also need (using GADT's): data Equal a b where Refl :: Equal a a equal :: IString s - IString t - Maybe (Equal s t) equal (IString x) (IString y) | x == y = Just (unsafeCoerce Refl) equal _ _ = Nothing ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Quickcheck research
On Tue, Nov 22, 2011 at 9:42 AM, wren ng thornton w...@freegeek.org wrote: On 11/22/11 6:09 AM, Macías López wrote: Hello: I'm a Master's student in Computer Science. I have to make a project involving some research, I'm very interested in Quickcheck and I wonder if there are some areas which need work or if there is some potential research topic related to it. In particular I know that Erlang Quickcheck has been worked on a lot and has some features like state machines or C bindings which may be useful to the Haskell community. I would appreciate any directions. Something I think would be nice is to see full integration between SmallCheck and QuickCheck. In particular, I'd like to use SmallCheck to exhaustively search the small cases, and then use QuickCheck in a way that ensures that it only tests on things larger than the ones which have already been tested. One of the problems with mixing the two these days is that QuickCheck often wastes a lot of time checking things that SmallCheck will also test. While the goal may not seem very researchy, it actually gets at one of the main weaknesses of QuickCheck: namely, how to properly control generation of arbitrary values in order to ensure you're testing something helpful. It's too easy to design Arbitrary instances which only generate small values (e.g., half of all lists are the empty list) or which loop forever (because of trying to avoid the too-small problem), which makes me think that Arbitrary isn't the right set of abstractions for controlling coverage of the value space. Especially in the case where you find a counter example it may help to slightly mutate that input and see if cases near it fail or succeed. On a similar line of reasoning, I've wondered if Perlin style noise generation could be applied to get a sort of fuzzing effect. This would be more interesting for cases where writing instances of arbitrary is hard to do but test cases do exist. Apply some sort of pseudo-random noise to your examples and see if your properties still hold. I could see this having applications in parsers. As far as I can tell, no one has used Perlin noise on algebraic structures. It seems to have only been applied to real valued spaces. Imagine having a parse tree then applying noise to the structure of the tree then unparsing the tree back to concrete syntax. You're making the structure noisy instead of just fussing the concrete syntax directly (which should increase the frequency that you change the shape/meaning instead of just changing the tokens in the parse tree). Jason ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Quickcheck research
On 11-11-23 08:28 PM, Jason Dagit wrote: On a similar line of reasoning, I've wondered if Perlin style noise generation could be applied to get a sort of fuzzing effect. This would be more interesting for cases where writing instances of arbitrary is hard to do but test cases do exist. Apply some sort of pseudo-random noise to your examples and see if your properties still hold. I could see this having applications in parsers. As far as I can tell, no one has used Perlin noise on algebraic structures. It seems to have only been applied to real valued spaces. Imagine having a parse tree then applying noise to the structure of the tree then unparsing the tree back to concrete syntax. You're making the structure noisy instead of just fussing the concrete syntax directly (which should increase the frequency that you change the shape/meaning instead of just changing the tokens in the parse tree). Interesting idea! With the strategy based unified Quickcheck/Smallcheck that we're finishing up, it would be quite easy to program that as a new generation strategy and try it. We've already got Boltzmann sampling on the list of things to look at in the future. Jacques ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] type level strings?
On Wed, Nov 23, 2011 at 4:25 PM, Julian Beaumont
jp.beaum...@theonionknight.com wrote:
On Thu, Nov 24, 2011 at 10:06 AM, Evan Laforge qdun...@gmail.com wrote:
Well yes, but the key feature is that the IDs are arbitrary strings.
And they're not knowable at compile time, since they are read from
user input...
You can still use phantom types for this, you just need existentials
as well. For example, you could define a type for indexed strings/id's
as:
data IString s
= IString String
data Exists f
= forall x. Exists (f x)
read :: String - Exists IString
read stuff = Exists (IString stuff)
I assume you'll also want to compare strings/id's, in which case
you'll also need (using GADT's):
data Equal a b where
Refl :: Equal a a
equal :: IString s - IString t - Maybe (Equal s t)
equal (IString x) (IString y) | x == y = Just (unsafeCoerce Refl)
equal _ _ = Nothing
I don't fully understand this but it looks interesting! I guess
'read' is a constructor for a sort of witness of the id, but I don't
see how to get this value into the type parameter, or how Equal would
be used in my mappend example. Could you help me figure out how it
relates? Here's the closest I could get:
data Thing thing_id = Thing {
thing_id :: Exists IString
, thing_stuff :: [Int]
}
thing :: String - [Int] - Thing thing_id
thing thing_id stuff = Thing (istring thing_id) stuff
instance Monoid.Monoid (Thing thing_id) where
mempty = Thing undefined []
mappend (Thing id1 stuff1) (Thing _ stuff2) =
Thing id1 (Monoid.mappend stuff1 stuff2)
istring :: String - Exists IString
istring thing_id = Exists (IString thing_id)
data IString s = IString String
data Exists f = forall x. Exists (f x)
data Equal a b where
Refl :: Equal a a
equal :: IString s - IString t - Maybe (Equal s t)
equal (IString x) (IString y) | x == y = Just (Coerce.unsafeCoerce Refl)
equal _ _ = Nothing
But as you can see it's not right, because the 'thing_id' goes into
the existential but is not expressed in the type parameter to Thing
(the real usage is that Things are Pitches which have a Scale and a
Signal, and it only makes sense to combine Pitches with the same
scale, which is probably a more interesting example, but I started
with Stuff and Things so I guess I should stick with it). I don't see
how I could use Equal, because the signature for mappend already
expresses that the arguments should be the same type. And while I can
see how to extract the String from the IString, I don't see how to
figure out the String from the *type* of the IString, as I would need
to do in mempty, since IString has no type parameter.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot? -- please stop this
I closed the poll, it's showing 51% no and 50% yes, 129 to 128 respectively. I also found out you can vote as many times as you want without restriction, with no IP logging whatsoever. This is why I don't like putting polls on places where users regularly use anonymity for their own agendas, e.g. Reddit, which is when it seems most of the votes came from. From the public email poll, there were 4 no votes and 8 yes votes, and from the original thread on a mascot, there were about 15 people liking the idea of a mascot, and less than half of this openly saying against the idea. I would say the next step might be create a poll using polldaddy, but even filtering IP addresses wouldn't stop people from using a workaround with Tor. With email, you can see how many people are registering and immediately voting. Anyway, I'm not sure how to proceed, but I'm going going to call it a night and a week with this, since it's going to be long next couple of days. Happy Thanksgiving to anyone celebrating the Holiday tomorrow. On Wed, Nov 23, 2011 at 4:36 PM, heathmatlock heathmatl...@gmail.comwrote: On Wed, Nov 23, 2011 at 2:25 PM, Giovanni Tirloni gtirl...@sysdroid.comwrote: 1. It's unlikely to get feedback from the larger Haskell community 2. It floods people with email they don't care (unless they care to keep track of the results) 3. One can just as easily create throw-away emails, subscribe to the list and answer the poll I thought about this, but I was trying to keep the response short. 4. etc... My suggestion is to create a poll somewhere else and let it run for at least a month. I suppose we could do this. Kryzyztof suggested Google Docs, so I created a poll there: https://docs.google.com/spreadsheet/viewform?formkey=dFpic3dzZkVtcW5yZkVWbFNuckpyWmc6MQ Or a more elaborated survey with additional questions trying to capture the community's feeling toward a masket and what kind. I'm not sure what additional questions would be appropriate. I don't think we are in a hurry to get a mascot here so let's take the time and do it properly. I can agree to that. The reasons I created a poll using the email method are: 1. Typically, mail programs have methods of keeping emails separated by topic, so your mailbox isn't littered with just one topic. 2. It's quick with little hassle, just respond. But, you have a point about reaching a wider audience. My only concern is how many people outside of the Haskell community are going to vote. Without methods of recognizing who's spamming the results, it's difficult to really judge how accurately the poll reflects the community's views. Polldaddy.com has nice spam filters. I'm guessing posting functional Javascript to the wiki isn't possible though, this would require someone with write access to the site. -- Heath Matlock +1 256 274 4225 -- Heath Matlock +1 256 274 4225 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot? -- please stop this
Before sleeping, I would like to point out as of right now there are 12 up votes and 5 down votes, 70% yes and 30% no for the topic on Reddit. It doesn't necessarily reflect the view on the question being posed, but it seems about right from my discussions. With that, I will try to refrain from speaking about a mascot for awhile. On Wed, Nov 23, 2011 at 11:58 PM, heathmatlock heathmatl...@gmail.comwrote: I closed the poll, it's showing 51% no and 50% yes, 129 to 128 respectively. I also found out you can vote as many times as you want without restriction, with no IP logging whatsoever. This is why I don't like putting polls on places where users regularly use anonymity for their own agendas, e.g. Reddit, which is when it seems most of the votes came from. From the public email poll, there were 4 no votes and 8 yes votes, and from the original thread on a mascot, there were about 15 people liking the idea of a mascot, and less than half of this openly saying against the idea. I would say the next step might be create a poll using polldaddy, but even filtering IP addresses wouldn't stop people from using a workaround with Tor. With email, you can see how many people are registering and immediately voting. Anyway, I'm not sure how to proceed, but I'm going going to call it a night and a week with this, since it's going to be long next couple of days. Happy Thanksgiving to anyone celebrating the Holiday tomorrow. On Wed, Nov 23, 2011 at 4:36 PM, heathmatlock heathmatl...@gmail.comwrote: On Wed, Nov 23, 2011 at 2:25 PM, Giovanni Tirloni gtirl...@sysdroid.comwrote: 1. It's unlikely to get feedback from the larger Haskell community 2. It floods people with email they don't care (unless they care to keep track of the results) 3. One can just as easily create throw-away emails, subscribe to the list and answer the poll I thought about this, but I was trying to keep the response short. 4. etc... My suggestion is to create a poll somewhere else and let it run for at least a month. I suppose we could do this. Kryzyztof suggested Google Docs, so I created a poll there: https://docs.google.com/spreadsheet/viewform?formkey=dFpic3dzZkVtcW5yZkVWbFNuckpyWmc6MQ Or a more elaborated survey with additional questions trying to capture the community's feeling toward a masket and what kind. I'm not sure what additional questions would be appropriate. I don't think we are in a hurry to get a mascot here so let's take the time and do it properly. I can agree to that. The reasons I created a poll using the email method are: 1. Typically, mail programs have methods of keeping emails separated by topic, so your mailbox isn't littered with just one topic. 2. It's quick with little hassle, just respond. But, you have a point about reaching a wider audience. My only concern is how many people outside of the Haskell community are going to vote. Without methods of recognizing who's spamming the results, it's difficult to really judge how accurately the poll reflects the community's views. Polldaddy.com has nice spam filters. I'm guessing posting functional Javascript to the wiki isn't possible though, this would require someone with write access to the site. -- Heath Matlock +1 256 274 4225 -- Heath Matlock +1 256 274 4225 -- Heath Matlock +1 256 274 4225 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
[Haskell-cafe] Polls on Haskellers.com
I noticed the recent thread about mascots, and trying to get accurate polling information. Don't consider this email to say I think we need safeguards against a poll on mascots (are people *really* trying to rig the election on this???), but I thought this might be a good features for Haskellers.com. Since we already have the verified account issue, we could use that to break down polls. More specifically, anyone would be allowed to vote, and then you could review results for verified users only, all logged in users, or theoretically even not-logged-in users (not sure how I feel about this one). If people would use this feature, I think I can add it next week. Michael ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Polls on Haskellers.com
Well that was a quick response. I think it's silly the idea that someone would cast more votes than one on an election for this, but I can't trust a poll where someone can continually click yes or no over and over. I like your idea. On Thu, Nov 24, 2011 at 12:05 AM, Michael Snoyman mich...@snoyman.comwrote: I noticed the recent thread about mascots, and trying to get accurate polling information. Don't consider this email to say I think we need safeguards against a poll on mascots (are people *really* trying to rig the election on this???), but I thought this might be a good features for Haskellers.com. Since we already have the verified account issue, we could use that to break down polls. More specifically, anyone would be allowed to vote, and then you could review results for verified users only, all logged in users, or theoretically even not-logged-in users (not sure how I feel about this one). If people would use this feature, I think I can add it next week. Michael ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Heath Matlock +1 256 274 4225 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Current Haskell report URL
On 23 November 2011 22:02, Tom Murphy amin...@gmail.com wrote: The current impression that we give is that Haskell98 is the current standard, and Haskell2010 isn't compiler-supported. Indeed, but yesterday there was a post on beginners where the OP said they didn't want to use extensions, just plain Haskell98. I thought, shouldn't that be Haskel2010? ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
Yes 2011/11/24 Conrad Parker con...@metadecks.org: I wouldn't mind getting a lamb-astronaut tshirt with a lambda-bind logo on it for my kid, and maybe next month a lion-skateboarder with a lambda-bind on his deck, and then maybe something with a dinosaur. I guess I don't really want a mascot either, but I like this artwork. Conrad. On 24 November 2011 06:18, Erik de Castro Lopo mle...@mega-nerd.com wrote: heathmatlock wrote: Question: Do you want a mascot? No. I also really think this poll should have been in a web site somewhere and not on this list. Erik -- -- Erik de Castro Lopo http://www.mega-nerd.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
Re: [Haskell-cafe] Poll: Do you want a mascot?
No. On 23 November 2011 19:11, heathmatlock heathmatl...@gmail.com wrote: Question: Do you want a mascot? Answers: Yes No -- This is an attempt to figure out if this idea is going anywhere. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
