http://permalink.gmane.org/gmane.comp.lang.haskell.general hourly 1 1901-01-01T00:00+00:00 http://gmane.org/img/gmane-25t.png http://gmane.org http://permalink.gmane.org/gmane.comp.lang.haskell.general/19834 <pre>Just a quick reminder: the registration deadline is tomorrow (Friday) at 1430. If you plan on coming, please let us know so we can buy the right amount of mealtime goodies and get you hooked up with sweet, sweet Internet! ~d On 2013-04-26 18:47, Daniel Wagner wrote: </pre> Daniel Wagner 2013-05-23T04:36:03 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19833 <pre> ======================================================================== CALL FOR PAPERS 6th International Conference on Software Language Engineering (SLE 2013) Oct 26-28, 2013, Indianapolis, IN, USA (Co-located with SPLASH 2013 and GPCE 2013) General chair: Eric Van Wyk, University of Minnesota, USA Program co-chairs: Martin Erwig, Oregon State University, USA Richard Paige, University of York, UK Keynote speaker: Don Batory, University of Austin, USA http://planet-sl.org/sle2013 ======================================================================== IMPORTANT DATES Deadline for abstracts: June 7, 2013 (Midnight UTC-8, Pacific Standard Time) Deadline for full papers: June 14, 2013 (Midnight UTC-8, Pacific Standard Time) Notification to authors: August 3, 2013 Camera-ready copies due: August 16, 2013 Conference: October 26 -28, 2013 TYPES OF SUBMISSIONS We solicit the following types of papers: - Research papers: These should report a substantial research contribution</pre> Martin Erwig 2013-05-22T18:52:22 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19832 <pre>The Department of Software and Computer Technology of TU Delft has a four year PhD position in Programming Language Verification in the NWO VICI project of Eelco Visser: "The Language Designer's Workbench. Automating the Verification of Language Definitions" The objective of the project is to unify work on semantics engineering and mechanized meta-theory with work on language engineering and language workbenches in order to support language designers in the creation of sound language designs. The Language Designer's Workbench will provide declarative meta-languages to enable language designers to build high quality compilers and IDEs, while also verifying consistency properties of their language definitions. We will build on our previous work on the Spoofax Language Workbench and integrate work on compiler certification from the semantics engineering community. The grant provides funding for five researchers at PhD and postdoc level. The focus of this first position is on proof engineering for verificatio</pre> Eelco Visser 2013-05-21T15:48:14 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19831 <pre>2013/5/15 7stud &lt;7stud&lt; at &gt;excite.com&gt; n, and therefore they do not have to touch the end of the list. In any case, it would seem to me that the *first* solution would be the one that wouldn't work on an infinite list. Can you explain? The first version returns a tuple with a list and a generator. If you want the first value, you will evaluate the list constructor ":", then evaluate "value", then "random gen" and you have the value. For each new value you need, you will evaluate resteOfList, so will call finiteRandoms recursively just once. To better see it, you can modify it by removing the n : (warning, this function doesn't make sense, I'll explain why afterwards) finiteRandoms' :: (RandomGen g, Random a) =&gt; g -&gt; ([a], g) finiteRandoms' gen = let (value, newGen) = random gen (restOfList, finalGen) = finiteRandoms' newGen in (value:restOfList, finalGen) and then you could try it like this : l' :: [Int] (l',f') = finiteRandoms' (mkStdGen 1) in ghci, if you type l', it will run in an i</pre> David Virebayre 2013-05-21T10:09:37 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19830 <pre>============================================================================ ICSM 2013 CFP - ERA/Tool Demo/Doctoral Symposium/Industry Tracks ============================================================================ 29th IEEE International Conference on Software Maintenance 22 - 28 September 2013 - Eindhoven, The Netherlands http://icsm2013.tue.nl/ Follow us on Twitter: &lt; at &gt;IEEEICSM ============================================================================ The deadline for the ERA/Tool Demo/Doctoral Symposium/Industry tracks is approaching! Please read below and refer to the web page for further information. ================================ IMPORTANT DATES ================================ Abstract submission: June 17, 2013 Full papers submission: June 24, 2013 Notification: July 26, 2013 Camera-ready: August 9, 2013 ================================ ERA Track ================================ The goal of the Early Research Achievements (ERA) track is to provide researchers and practitioners with a f</pre> Natalia Dragan 2013-05-21T03:11:56 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19829 <pre>Hal8 - Haskell in Leipzig, June 21. visit the workshop web site for program and registration: http://www.bioinf.uni-leipzig.de/conference-registration/13haskell See you - Johannes Waldmann. _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </pre> Johannes Waldmann 2013-05-17T14:45:15 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19826 <pre>Hello everybody, please find attached the description of a newly opened PhD position in bioinformatics at our group in Vienna. Mit freundlichem Gruss, Christian _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </pre> Christian Hoener zu Siederdissen 2013-05-16T15:53:19 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19825 <pre>Dear Haskellers, AlephCloud (www.alephcloud.com) is a well-funded and fast-paced Silicon Valley startup just emerging from stealth mode. We intend to change cloud content management to make it secure but still easy to use – and we have the team and world-class leadership to make it happen. We are seeking passionate software engineers who want to work on cloud content management solutions that meet highest security standards. You will be working closely with cryptographers, architects, product management, and data center operators to design and build server components. We are looking for experienced engineers with skills in: · Functional programing in a strongly typed language such as Haskell · Systems programming languages such as C or C++ · Development in a UNIX environment with open source software · Service security and identity management · Development of domain specific languages for policy and compliance · Cloud services and Cloud databases What should you </pre> Krishna Sunkammurali 2013-05-16T07:09:25 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19824 <pre>Welcome to issue 267 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of April 28 to May 11, 2013. Quotes of the Week * ciaranm: a category is just a category in the category of categories * cmccann: the Either monad is like the Maybe monad, except with something instead of Nothing. * sclv: Q: Why are the adjunctions of Galois connections backwards? A: He never got the hang of duals. * acowley: blackdog's experience with IDEs is apparently both more sensual and more culinary than mine * cmccann: shachaf jokes are what the quotes section of HWN is for. cmccann: though lately there have been not as many :[ shachaf: cmccann: Hey, there wasn't a single shachaf quote in the last HWN! shachaf: Leave me alone. shachaf: There were two cmccann quotes. * edwardk: cmccann: i'm NDA'd out of that space for a while ;) elliott: edwardk just collects NDAs so that he can focu</pre> Daniel Santa Cruz 2013-05-16T00:04:07 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19823 <pre>My apologies, it looks like this e-mail has been sent to all my contacts. My intention never was to reach the Haskell list. Sincerely, Daniel Díaz. On Wed, May 15, 2013 at 11:44 PM, Daniel Díaz Casanueva &lt;member&lt; at &gt;linkedin.com </pre> Daniel Díaz Casanueva 2013-05-15T22:37:29 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19822 <pre>LinkedIn ------------ Daniel Díaz Casanueva requested to add you as a connection on LinkedIn: ------------------------------------------ Adrian, I'd like to add you to my professional network on LinkedIn. - Daniel Accept invitation from Daniel Díaz Casanueva http://www.linkedin.com/e/-y1615u-hgr1efjt-n/A5eR2FIG5M9-4jk43rQ4JqtVY2yX2KP/blk/I327947004_140/e39SrCAJoS5vrCAJoyRJtCVFnSRJrScJr6RBfnhv9ClRsDgZp6lQs6lzoQ5AomZIpn8_c3gNnPgMc3sQejsOcQALtTtNsPtzi5gLcjwScPwNdP0PcP4LrCBxbOYWrSlI/eml-comm_invm-b-in_ac-inv28/?hs=false&amp;tok=0Sa2urT3go4lM1 View profile of Daniel Díaz Casanueva http://www.linkedin.com/e/-y1615u-hgr1efjt-n/rso/255311896/LIky/name/144943986_I327947004_140/?hs=false&amp;tok=3t1chtUlQo4lM1 ------------------------------------------ You are receiving Invitation emails. This email was intended for Adrian Borucki. Learn why this is included: http://www.linkedin.com/e/-y1615u-hgr1efjt-n/plh/http%3A%2F%2Fhelp%2Elinkedin%2Ecom%2Fapp%2Fanswers%2Fdetail%2Fa_id%2F4788/-GXI/?hs=false&amp;tok=0pRQw</pre> Daniel Díaz Casanueva 2013-05-15T21:44:06 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19821 <pre> I don't see how that's possible. Both traversals seem to be limited by n, and therefore they do not have to touch the end of the list. In any case, it would seem to me that the *first* solution would be the one that wouldn't work on an infinite list. Can you explain? Hmm...I never thought of foldr and foldl in those terms. Thanks. I'l be sure to post any other questions I have on the beginner list. </pre> 7stud 2013-05-15T19:16:56 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19820 <pre> On Wed, 15 May 2013, 7stud wrote: Then you might want to post your question to haskell-beginners mailing list. The first solution works for infinite lists and the second one does not. It's really like foldr vs. foldl. </pre> Henning Thielemann 2013-05-15T18:17:28 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19819 <pre>Well, my question does not meet the standards for a question at stackoverflow: (I am a haskell beginner) This example is from LYAH: import System.Random finiteRandoms :: (RandomGen g, Random a, Num n) =&gt; n -&gt; g -&gt; ([a], g) finiteRandoms 0 gen = ([], gen) finiteRandoms n gen = let (value, newGen) = random gen (restOfList, finalGen) = finiteRandoms (n-1) newGen in (value:restOfList, finalGen) Looking at that function, I find it impossible to understand how that recursion works. I have to pull out a pencil and paper to figure it out. If I was given the task of writing that function, I would write it like this: import System.Random finiteRands :: (RandomGen g, Random a) =&gt; Int -&gt; g -&gt; [a] finiteRands n gen = finiteRands' n gen [] finiteRands' :: (RandomGen g, Random a) =&gt; Int -&gt; g -&gt; [a] -&gt; [a] finiteRands' 0 _ acc = acc finiteRands' n gen acc = let (rand_num, new_gen) = random gen in finiteRands' (n</pre> 7stud 2013-05-15T18:03:49 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19818 <pre> Hello, Please find below the Second Call for Papers for the Twelfth ACM SIGPLAN Erlang Workshop. Apologies for any duplicates you may receive. CALL FOR PAPERS ================= Twelfth ACM SIGPLAN Erlang Workshop ----------------------------------------------------------- Boston, Massachusetts, September 28, 2013 (tentative date, subject to change) Satellite event of the 18th ACM SIGPLAN International Conference on Functional Programming (ICFP 2013) September 25-27, 2013 Erlang is a concurrent, distributed functional programming language aimed at systems with requirements of massive concurrency, soft real time response, fault tolerance, and high availability. It has been available as open source for 15 years, creating a community that actively contributes to its already existing rich set of libraries and applications. Originally created for telecom applications, its usage has spread to other domains including e-commerce, banking, databases, and computer telephony and messaging. Erlang progr</pre> Laura M. Castro 2013-05-14T12:03:50 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19817 <pre>Assistant Professor in Software Systems University of Dublin, Trinity College Discipline of Software Systems, School of Computer Science and Statistics Post Status: Permanent Job Ref: 030223 Salary: This appointment will be made on the Department of Education and Skills Lecturer Salary Scale in line with current government pay policy and will be capped at a maximum Point 8. Closing Date: 12 noon on Monday, 10th June 2013 The post is tenable from 1 September, 2013. The Discipline of Software Systems in the School of Computer Science and Statistics is seeking to appoint an Assistant Professor in Software Systems. The Discipline is looking for an exceptional person with a proven track record in research in the field of Software Systems, preferably with research expertise in algorithms, data-structures and compilers. A significant series of publications in internationally recognised journals and conferences is expected of candidates. The successful applicant will have a primary degree and PhD in compu</pre> Matthew Hennessy 2013-05-14T10:16:00 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19816 <pre>On behalf of all the contributors, I am pleased to announce that the Haskell Communities and Activities Report (24th edition, May 2013) is now available in PDF and HTML formats: http://haskell.org/communities/05-2013/report.pdf http://haskell.org/communities/05-2013/html/report.html Many thanks go to all the people that contributed to this report, both directly, by sending in descriptions, and indirectly, by doing all the interesting things that are reported. I hope you will find it as interesting a read as I did. If you have not encountered the Haskell Communities and Activities Reports before, you may like to know that the first of these reports was published in November 2001. Their goal is to improve the communication between the increasingly diverse groups, projects, and individuals working on, with, or inspired by Haskell. The idea behind these reports is simple: Every six months, a call goes out to all of you enjoying Haskell to contribute brief summarie</pre> Janis Voigtländer 2013-05-11T23:46:36 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19815 <pre>---------------------------------------------------------------------- CALL FOR TALK PROPOSALS HOPE 2013 The 2nd ACM SIGPLAN Workshop on Higher-Order Programming with Effects September 28, 2013 Boston, Massachusetts (the day after ICFP 2013) http://hope2013.mpi-sws.org ---------------------------------------------------------------------- HOPE 2013 aims at bringing together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: st</pre> Hongseok Yang 2013-05-11T21:34:39 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19814 <pre>Yes, I agree at inclusion in base. I opted for this solution, as it allows me to test it in anger at my daily work at Erudify. If we're going to add more strict modules to base, then I'd do it in a two step process. 1. Include strict versions of core types, i.e., the modules from strict-base-types. 2. Include strict versions of functions, i.e., the additional modules from `strict`, `strict-io`, etc. We could already solve Number 1. for GHC 7.8. It's just a matter of preparing the patches. I would be willing to prepare them in a month or two, if that's still sufficient for GHC 7.8. Then, I should have had to time to test my `strict-base-types` package in practice. best regards, Simon 2013/5/8 Johan Tibell &lt;johan.tibell&lt; at &gt;gmail.com&gt; _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </pre> Simon Meier 2013-05-11T14:36:44 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19813 <pre>Our formal methods team at Intel has a full-time position available that I think would be a good fit for functional programming and formal methods enthusiasts. I'm including the description below. Do not hesitate to contact me if you've any questions, or just want to talk about it in general. To apply for the position, please visit: http://www.intel.com/jobs/jobsearch/index.htm, and in the "advanced search" area enter the job number: 709631. Thanks, -Levent. Job Description *Formal Methods &amp; Validation Architect* *-* *709631* Description If you're interested in products going into future super computer markets then the Intel® Many Integrated Core (Intel® MIC) Hardware Engineering Group is the place for you! We design and validate silicon chips with many Intel cores integrated inside being used in high performance computing architectures. In this position you will work as part of the pre-silicon formal methods, tools, and verification team to support a continued high quality of the future Intel m</pre> Levent Erkok 2013-05-08T23:49:58 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19812 <pre> +1 Erik </pre> Erik de Castro Lopo 2013-05-08T20:24:28 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.comp.lang.haskell.general