May 2013 - Haskell - Haskell.org

[ANN] Hac Phi 2013
by Daniel Wagner 23 May '13

23 May '13

Hac Phi 2013, a Haskell hackathon/get-together, will be held June 7-9 at the University of Pennsylvania in Philadelphia. The hackathon will officially kick off at 2:30 Friday afternoon, and go until 5pm on Sunday (with breaks for sleep, of course). Last year's Hac Phi was a lot of fun, drawing more than 30 Haskellers, and many people have already expressed interest in coming back this year. Everyone is welcome - you do not have to be a Haskell guru. Helping hack on someone else's project could be a great way to increase your Haskell-fu. If you plan on coming, please officially register [1]. Registration, travel, lodging and many other details can be found on the Hac Phi wiki [2]. This year, we are making a public list of attendees' names and nicks - please let us know if you'd prefer not to be listed when you register. We're also looking for a few people interested in giving short (15-20 min.) talks, probably on Saturday afternoon. Anything of interest to the Haskell community is fair game - a project you've been working on, a paper, a quick tutorial. If you'd like to give a talk, add it on the wiki [3]. Hope to see you in Philadelphia! - The Hac Phi team Brent Yorgey (byorgey) Daniel Wagner (dmwit) Chris Casinghino (ccasin) [1] http://www.haskell.org/haskellwiki/Hac_%CF%86/Register [2] http://www.haskell.org/haskellwiki/Hac_%CF%86 [3] http://www.haskell.org/haskellwiki/Hac_%CF%86/Talks

1 1

SLE 2013 - Final Call for Papers
by Martin Erwig 23 May '13

23 May '13

======================================================================== 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 to SLE or successful application of SLE techniques or both. Full paper submissions must not exceed 20 pages (in LNCS format). - Industrial experience papers: These papers discuss practical applications of SLE technology with an emphasis on the advantages and disadvantages of the method, techniques, or tools used. These papers must not exceed 10 pages (in LNCS format). - Tool demonstration papers: Because of SLE's ample interest in tools, we seek papers that present software tools related to the field of SLE. These papers will accompany a tool demonstration to be given at the conference. These papers must not exceed 10 pages (in LNCS format). The selection criteria include the originality of the tool, its innovative aspects, the relevance of the tool to SLE, and the maturity of the tool. Papers are submitted via the Easychair system: https://www.easychair.org/conferences/?conf=sle2013 SCOPE The term "software language" refers to artificial languages used in software development. These include general-purpose programming languages, domain-specific languages, modeling and metamodeling languages, data models and ontologies. Examples include general purpose modeling languages such as SysML and UML, metamodeling frameworks such as Ecore, MOF or GOPRR, domain-specific modeling languages for business process modeling, such as BPMN, or embedded systems, such as Simulink or Modelica, and specialized XML-based and OWL-based languages and vocabularies. The term "software language" is intentionally broad; besides the above categories and examples, it also encompasses implicit approaches to language definition, such as APIs and collections of design patterns. Software language engineering is the application of systematic, disciplined, and measurable approaches to the development (design, implementation, testing, deployment), use, deployment, and maintenance (evolution, recovery, and retirement) of these languages. Of special interest are (1) formal descriptions of languages that are used to design or generate language-based tools and (2) methods and tools for managing such descriptions, including modularization, refactoring, refinement, composition, versioning, co-evolution, recovery, and analysis. TOPICS OF INTEREST We solicit high-quality contributions in the area of SLE ranging from theoretical and conceptual contributions to tools, techniques, and frameworks that support the aforementioned lifecycle activities. The topics of interest include, but are not limited to the following: - Formalisms used in designing and specifying languages, and tools that analyze language descriptions - Language implementation techniques: compiler generator tools, attribute grammar systems, term-rewriting systems, functional programming-based combinator libraries; metamodel-based and ontology tools implementing constraint, rule, view, transformation, and query formalisms and engines. - Transformations and transformation languages, as well as program and model transformation tools, and approaches for mapping between ontologies. - Language evolution: Included are extensible languages and type systems and their supporting tools and language conversion tools, approaches for ontology evolution, approaches for impact analysis of language evolution. - Approaches to the elicitation, specification, and verification of requirements for software languages: Examples include the use of requirements engineering techniques in domain engineering and in the development of domain-specific languages and the application of logic-based formalisms for verifying language and domain requirements. - Language development frameworks, methodologies, techniques, best practices, and tools for the broader language lifecycle covering phases such as analysis, testing, and documentation. For example, frameworks for advanced type or reasoning systems, constraint mechanisms, tools for metrics collection and language usage analysis, assessing language usability, documentation generators, visualization backends, generation of tests for language-based tools, knowledge and process management approaches, as well as IDE support for many of these activities are of interest. - Integration and interoperation between different approaches to software language engineering; for example, ways to integrate grammar-based and ontology-based approaches to language definition. - Design challenges in SLE: Example challenges include finding a balance between specificity and generality in designing domain-specific languages, between strong static typing and weaker yet more flexible type systems, or between deep and shallow embedding approaches, as, for example, in the context of adding type-safe XML and database programming support to general-purpose programming languages. - Applications of languages including innovative domain-specific languages or "little" languages: Examples include policy languages for security or service-oriented architectures, web-engineering with schema-based generators or ontology-based annotations. Of specific interest are the engineering aspects of domain-specific language support in all of these cases. The program committee chairs encourage potential contributors to contact them with questions about the scope and topics of interest of SLE. The overall principle of SLE is to be broad-minded and inclusive about relevance and scope, and to invest in community building when soliciting and selecting papers. PROGRAM COMMITTEE Emilie Balland, INRIA, France Olaf Chitil, University of Kent, UK James R. Cordy, Queen's University, Canada Davide Di Ruscio, Università degli Studi dell'Aquila, Italy Iavor Diatchki, Galois Inc., USA Anne Etien, LIFL - University of Lille 1, Fance Jean-Marie Favre, University of Grenoble, Fance Dragan Gasevic, Athabasca University, Canada Andy Gill, University of Kansas, USA Jeremy Gibbons, University of Oxford, UK Jeff Gray, University of Alabama, USA Giancarlo Guizzardi, Federal University of Espirito Santo, Brazil Gorel Hedin, Lund University, Sweden Markus Herrmannsdoerfer, Technische Universität München, Germany Zhenjiang Hu, NII, Japan Oleg Kiselyov, USA Paul Klint, Centrum Wiskunde & Informatica, The Netherlands Thomas Kuehne, Victoria University of Wellington, New Zealand Kim Mens, UC Louvain, Belgium Pierre-Etienne Moreau, Ecole des Mines Nancy, France Klaus Ostermann, Marburg University, Germany Arnd Poetzsch-Heffter, University of Kaiserslautern, Germany Fiona Polack, Dept of Computer Science, University of York, UK Lukas Renggli, University of Bern, Switzerland Bernhard Rumpe, RWTH Aachen University, Germany João Saraiva, Universidade do Minho, Portugal Friedrich Steimann, Fernuniversität in Hagen, Germany Gabriele Taentzer, Marburg University, Germany Mark Van Den Brand, TU/e, The Netherlands Jurgen Vinju, Centrum Wiskunde & Informatica, The Netherlands

1 0

PhD position in Programming Language Verification
by Eelco Visser 21 May '13

21 May '13

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 verification of programming languages. But candidates interested in all aspects of the project are invited to apply. The candidate should have a strong background in programming languages research and a demonstrable interest in one or more of the following topics: type systems, type inference algorithms, program analysis, program transformation, compiler construction, theorem proving and proof assistants, verification of language definitions or compilers, mechanized meta-theory. For more information about the position including application instructions see http://department.st.ewi.tudelft.nl/jobs/job/3 To meet the early application deadline please apply at the page above before June 15. Submissions received after June 15 will be also considered until the position has been filled. -- Eelco Visser Associate Professor at Delft University of Technology Group: Software Language Design and Engineering Email: e.visser(a)tudelft.nl Homepage: http://eelcovisser.org Publications: http://researchr.org/profile/eelcovisser News: http://twitter.com/eelcovisser

1 0

Re: [Haskell] recursion patterns?
by 7stud 21 May '13

21 May '13

>> Is one solution more efficient than the other? I believe my solution is >> tail recursive, but it's my understanding that compilers can now >> optimize just about anything into tail recursion. >The first solution works for infinite lists and the second one does not. 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? >It's really like foldr vs. foldl. 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.

2 1

ICSM 2013 - CFP for ERA/Tool Demo/Doctoral Symposium/Industry Tracks
by Natalia Dragan 21 May '13

21 May '13

============================================================================ 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: @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 forum for presenting great, promising ideas in early stages of research. These ideas do not require a strong empirical evaluation! The 2013 ERA track aims to provide constructive feedback to guide you from your initial idea and limited evaluation towards a solid ICSM 2014 paper with strong empirical underpinnings. The topics of interest for this track are the same as for the main research track, i.e., all the topics in the research and practice of software maintenance and evolution. Papers submitted to the ERA track must not have been accepted previously for publication or submitted for review to another conference, journal, or book. Submissions must be in English and conform to the IEEE proceedings style. They must be four-page long, including all text, references, appendices, and figures. Submissions will be evaluated on the basis of their originality, importance of contribution, soundness, evaluation (if available), quality and consistency of presentation, and appropriate comparison to related work. Further details are available at: http://icsm2013.tue.nl/CFP/index.html ================================ Doctoral Symposium Track ================================ As with previous editions, ICSM 2013 will feature a double doctoral symposium: Pre-doctoral: The first part is dedicated to PhD students in the midst of their doctoral studies in the field of software maintenance, who intend to finish their PhD within the next two years (2014-2015). This symposium aims to provide PhD students with an opportunity to present their ongoing work, to interact with other researchers in the field, and to get constructive feedback from senior researchers. Participants will discuss their goals, methods, and results at an early stage in their research. For the pre-doctoral symposium the submission should not exceed 4 pages. Details on the required content are available at: http://icsm2013.tue.nl/CFP/index.html Post-doctoral: The second part is dedicated to researchers who have delivered their PhD dissertations in the area of software maintenance and evolution within the last 2 years (2011-2012). This symposium aims to provide a forum for post-docs to present the highlights of their work to the ICSM community. Moreover, participants will be asked to reflect on the PhD process itself, and share some lessons learned with PhD students as well as PhD advisors. For the post-doctoral symposium the submission should not exceed 6 pages. Details on the required content are available at: http://icsm2013.tue.nl/CFP/index.html ================================ Industrial Track ================================ This track aims to foster mutually beneficial links between those engaged in scientific research and practitioners working to improve software maintenance practices. We are interested in results (both good and bad), obstacles, and lessons learned. Experiences from practitioners provide crucial input into future research directions and allow others to learn from successes and failures. For the industry track, we invite submissions of state-of-the-art practice and experience reports, survey reports from real-world projects and industrial experiences, and evidence-based identifications of unsolved research challenges associated to software maintenance. If you apply in an industrial context a method, model or tool, which you know was earlier presented at ICSM or other software engineering conference, we also warmly encourage you to submit to this track. Each submission should describe the problem addressed, the approach used, the current state of the project, an evaluation of the benefits or lessons learnt, and future developments. Submissions must be in English and conform to the IEEE proceedings style. They must be four-page long, including all text, references, appendices, and figures. Further details are available at: http://icsm2013.tue.nl/CFP/index.html ================================ Tool Demo Track ================================ This track provides an opportunity for researchers and practitioners to present and discuss the most recent advances, experiences, and challenges in the field of software maintenance with the goal of allowing live presentation of new research tools. Whether the tools are early research prototypes or polished tools prepared for commercialization (but not yet commercialized), the ICSM demo track provides the perfect opportunity to reach an international audience of researchers and practitioners, and solicit critical feedback. This year's demo track consists of demonstrators who get about 15 minutes in the conference program for presenting their tool. The presentation should focus on the main use cases of and essential concepts behind the tool, and should include an actual tool demo of at least 10 minutes. Accepted demos will be included in the ICSM proceedings. Demos also require a website and a 4-page proposal. Participation to the demos requires: 1) a 4-page proposal (format: IEEE format and template) describing the problem context, a typical usage scenario, existing tools and their shortcomings, the concepts behind the proposed tool, a graphical overview of the tool's architecture, a short discussion of the technologies used for implementation, a summary of experiments or other experiences with the tool, an outline of missing features and other future work, and the URL of the tool's website (see 2.); 2) a small website (referenced in the proposal) containing the URL of the screencast as well as the download link of the actual tool, together with clear installation instructions. The proposal should be submitted via EasyChair at http://www.easychair.org/conferences/?conf=icsmtool2013 The website do NOT need to be submitted via EasyChair, since their URL can be found via the proposal. If the tool is not available for download, the authors should clearly explain the rationale for this in the proposal. Each submission will be reviewed by at least 3 members of the tool demo PC. Major reviewing criteria are: relevance to the ICSM audience quality of the proposal novelty of the tool adherence to the tool demo guidelines Accepted demos will be allocated 4 pages in the conference proceedings. At least one author of each accepted demo must register and attend ICSM 2013 for the demo to be published in the proceedings. In addition, demonstrators will be expected to give a presentation that will be scheduled in the conference program. Demonstrators are expected to provide their own equipment. Please mention supplemental wishes (e.g., Internet access) in a seperate appendix in proposal, this appendix will NOT be included in proceedings. ================================ CHAIRS ================================ General Chair: Alexander Serebrenik, Eindhoven University of Technology, The Netherlands Program Co-chairs: Tom Mens, University of Mons, Belgium and Yann-Gaël Guéhéneuc, École Polytechnique de Montréal, Canada ERA Program Co-chairs: Romain Robbes, University of Chile, Chile and Bram Adams, École Polytechnique de Montréal, Canada Industry Track Chair: Joost Visser, Software Improvement Group in Amsterdam, The Netherlands Doctoral Symposium Co-chairs: Lori Pollock, University of Delaware, USA and Tibor Gyimothy, University of Szeged, Hungary Tools Track Co-chairs: Mark van den Brand, Eindhoven University of Technology, The Netherlands and Anthony Cleve, University of Namur, Belgium

1 0

Call for Participation: HaL8 - Haskell in Leipzig (Germany), June 21
by Johannes Waldmann 17 May '13

17 May '13

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.

1 0

DTP 2013 2nd Call For Papers
by Stephanie Weirich 17 May '13

17 May '13

======================================================================== DTP 2013 ACM SIGPLAN Workshop on Dependently-Typed Programming 24th SEPTEMBER 2013 Boston, Massachusetts, USA (co-located with ICFP 2013) 2nd CALL FOR PAPERS http://www.seas.upenn.edu/~sweirich/dtp13 ======================================================================== [NOTE: Compared to the first announcement, this CFP updates the workshop date, submission deadline, and also solicits informal presentations for DTP.] Overview -------- The ACM SIGPLAN Workshop on Dependently-Typed Programming 2013 will be co-located with the [2013 International Conference on Functional Programming (ICFP), in Boston, Massachusetts, USA](http://icfpconference.org/icfp2013/). The purpose of DTP is to discuss experiences with dependent types in programming and future developments for dependently-typed languages. Recent years have seen increasing overlap between the dependent type theory and functional programming languages communities. Co-locating this workshop with ICFP will promote that cross fertilization. Topics of interest include, but are not limited to: * Language Design, both in the context of possible extensions and modifications of existing languages and the development of new languages with dependent types; * Theory, such as formal treatments of semantics and type systems; * Compilation, including implementations and optimization of dependently-typed languages; * Tools, in the form of IDEs, profilers, tracers, debuggers, and testing tools; * Functional Pearls, being elegant, instructive examples of using dependent types; * Experience Reports, general practice and experience with dependently-typed languages, e.g., in an education or industry context. Workshop Format --------------- The workshop program will be composed of regular papers (formally reviewed and published by ACM, see below) and informal presentations. Proceedings ----------- Regular papers should explain their research contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and relating it to previous work. Functional Pearls and Experience reports need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, reusable programming idioms, or elegant new ways of approaching a problem. The key criterion for such a paper is that it makes a contribution from which other programmers can benefit. It is not enough simply to describe a (dependently-typed) program! Regular papers will appear in a formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Authors must abide by the [ACM policy](http://www.acm.org/news/featured/author-rights-management) for rights and permissions. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they always retain copyright of auxiliary material. Informal Presentations -------------------- DTP also solicits informal, work-in-progress talks. Such talks will not be accompanied by a publication in the formal proceedings. However, materials relevant to these talks (such as draft papers) can be posted on the DTP website. To propose a talk, send a short abstract (at most one page!) to sweirich(a)cis.upenn.edu by August 16th, 2013. Travel Support --------------- Student attendees with accepted papers can apply for a [SIGPLAN PAC](http://www.sigplan.org/PAC.htm) grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. Submission Details ------------------- * Paper Submission : Friday, 14th June 2013 anywhere on Earth * Author Notification: Thursday, 11th July 2013 * Final Papers Due : Thursday, 25th July 2013 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (9pt format, more details appear on the symposium web page). The length is restricted to 12 pages, except for "Experience Report" papers, which are restricted to 6 pages. Each paper submission must adhere to SIGPLAN's [republication policy](http://www.sigplan.org/Resources/Policies/Republication). "Functional Pearls", and "Experience Reports" should be marked as such with those words in the title at time of submission. The paper submission deadline and length limitations are firm. There will be no extensions, and papers violating the length limitations will be summarily rejected. Submission is via [EasyChair](https://www.easychair.org/conferences/?conf=dtp2013). Program Committee ----------------- * Thorsten Altenkirch, University of Nottingham * Edwin Brady, University of St. Andrews * Nils Anders Danielsson, University of Gothenburg * Ranjit Jhala, UC San Diego * Conor McBride, University of Strathclyde * Brigitte Pientka, McGill University * Tim Sheard, Portland State University * Matthieu Sozeau, INRIA Paris * Aaron Stump, University of Iowa * Nikhil Swamy, Microsoft Research * Stephanie Weirich, University of Pennsylvania (chair) History ------- This workshop follows a series of workshops on dependently-typed programming. Past meetings include [DTP 2011 in Nijmegen](http://www.cs.ru.nl/dtp11/), [DTP 2010 in Edinburgh](http://sneezy.cs.nott.ac.uk/darcs/dtp10/), and [DTP 2008 in Nottingham](http://sneezy.cs.nott.ac.uk/darcs/DTP08/), as well as seminars organized in 2011 at [Shonan Village, Japan](http://www.nii.ac.jp/shonan/seminar007/) and in 2005 at [Dagstuhl, Germany](http://drops.dagstuhl.de/opus/volltexte/2005/186/). This is the first time that DTP has co-located with ICFP and has been sponsored by SIGPLAN.

1 0

[sven@tbi.univie.ac.at: Open PhD Position]
by Christian Hoener zu Siederdissen 16 May '13

16 May '13

Hello everybody, please find attached the description of a newly opened PhD position in bioinformatics at our group in Vienna. Mit freundlichem Gruss, Christian

1 0

Haskell programmer job / cloud content management
by Krishna Sunkammurali 16 May '13

16 May '13

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 know? You have a strong computer science background with knowledge in algorithms, data structures, and distributed systems. You know about complexity and you assess if a solution scales. A background in formal methods, computational logic, cryptography, compilers, database theory, or a related field would be a plus. Haskell is our main language used on the server side with a few modules written in JavaScript (node.js) and C. You can expect to work on many challenging areas including: · High-assurance cloud services for our server side infrastructure · Policy engines based on domain specific formal reasoning · Implementations of cryptographic ciphers for server side deployment · Prototypes and dependable reference implementations as basis for ports to various client side platforms You have an innovative mindset and a passion for elegant design and quality. You quickly learn new languages, platforms, and frameworks as needed. You come up with novel solutions for hard problems, argue for them in the team, and drive their realization. Due to the nature of data centric security and federated policy scenarios we encounter, common design patterns for cloud services often do not apply to our problems. Therefore we value agility, creativity, curiosity, and dedication more than anything else. If you picture yourself meeting the above requirements then we definitely like to talk to you. Please send an email with your resume to resume at alephcloud.com<mailto:resume@alephcloud.com> AlephCloud Systems (http://www.alephcloud.com) is headquartered in Sunnyvale, CA with a branch office at Seattle, WA. A qualified candidate may work from any location in the world. Our senior staff engineer Lars Kuhtz, Co-founder and CTO Roy D'Souza and myself will be at Bay Area Haskell Hackthon (May 17th – May 19th). We would be happy to chat with you in detail about this opportunity. Best Wishes, Krishna Sunkammurali [krishna at alephcloud.com] Sr. Director of Engineering AlephCloud Systems, Inc.

1 0

Haskell Weekly News: Issue 267
by Daniel Santa Cruz 16 May '13

16 May '13

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 focus. * trapdInIO: in java everything happens elsewhere * edwardk: i never bothered to release the c preprocessor because it was entangled with an old compiler of mind * acowley: I get nervous when I haven't triggered the impossible for more than a month or so :/ * hpc: be careful, excessive consumption of lenses will go straight to your type signature * acowley: The longer I leave this function named "jumanji" the less I want to find a better name * ion: The next step is unsafeCoerce. At that point youâre halfway into implementing lens. * bos: i'm not sure edwardk is a good model to follow. (a) because you won't be able to, and (b) because you won't be able to. Top Reddit Stories * John Carmack interested in doing a moderate-sized project in Haskell Domain: twitter.com, Score: 136, Comments: 30 On Reddit: [1] http://goo.gl/7rJpH Original: [2] http://goo.gl/yL9kV * John Carmack starting port of Wolf 3D in Haskell Domain: twitter.com, Score: 108, Comments: 19 On Reddit: [3] http://goo.gl/MKkiI Original: [4] http://goo.gl/SN7Mp * Haskell for all: Program imperatively using Haskell lenses Domain: haskellforall.com, Score: 103, Comments: 80 On Reddit: [5] http://goo.gl/FIfUd Original: [6] http://goo.gl/zkEHI * unm-hip a Haskell Image Processing Library Domain: self.haskell, Score: 71, Comments: 18 On Reddit: [7] http://goo.gl/erMhx Original: [8] http://goo.gl/erMhx * Crit-bit trees in Haskell: fast, and open to contributors! Domain: github.com, Score: 56, Comments: 16 On Reddit: [9] http://goo.gl/1vQMS Original: [10] http://goo.gl/08byj * Tutorial on HLearn's Markov networks, monoids, and "type level lenses" explained with Futurama Domain: izbicki.me, Score: 53, Comments: 10 On Reddit: [11] http://goo.gl/3mYuD Original: [12] http://goo.gl/4WjnU * Cool mailing list archive I stumbled on: Haskell controlling garbage trucks Domain: haskell.org, Score: 49, Comments: 2 On Reddit: [13] http://goo.gl/h8p4y Original: [14] http://goo.gl/kSGkx * Haskell intuition Domain: self.haskell, Score: 49, Comments: 23 On Reddit: [15] http://goo.gl/F04IM Original: [16] http://goo.gl/F04IM * The Difference between Recursion & Induction Domain: blog.ezyang.com, Score: 47, Comments: 3 On Reddit: [17] http://goo.gl/mZN3T Original: [18] http://goo.gl/z2jZx * Yesod 1.2 released Domain: yesodweb.com, Score: 45, Comments: 8 On Reddit: [19] http://goo.gl/el7dt Original: [20] http://goo.gl/lqBM9 * Haskell 2014 committee has now been formed Domain: thread.gmane.org, Score: 42, Comments: 27 On Reddit: [21] http://goo.gl/okojc Original: [22] http://goo.gl/1g6FG * Web Frameworks Benchmark 4 (includes WAI) Domain: techempower.com, Score: 41, Comments: 60 On Reddit: [23] http://goo.gl/FLGJu Original: [24] http://goo.gl/AJbhV * Haskell for all: pipes-3.3.0: Folds and uniting ListT with Proxy Domain: haskellforall.com, Score: 41, Comments: 14 On Reddit: [25] http://goo.gl/sO1EK Original: [26] http://goo.gl/5rZ0u * First working program using the Repa plugin Domain: disciple-devel.blogspot.com, Score: 39, Comments: 5 On Reddit: [27] http://goo.gl/bQgfV Original: [28] http://goo.gl/9K5Qk * How to use Hoogle from GHCi Domain: youtube.com, Score: 36, Comments: 2 On Reddit: [29] http://goo.gl/9V9o7 Original: [30] http://goo.gl/LU7Zk * 4th Episode of "The Pragmatic Haskeller": HTTP and more Domain: cakesolutions.net, Score: 35, Comments: 3 On Reddit: [31] http://goo.gl/rMLyC Original: [32] http://goo.gl/npjKm * A monadic joke Domain: self.haskell, Score: 34, Comments: 28 On Reddit: [33] http://goo.gl/OmwSp Original: [34] http://goo.gl/OmwSp * A "Natural" Theorem Prover in Haskell — By Tim Gowers! Domain: gowers.wordpress.com, Score: 34, Comments: 5 On Reddit: [35] http://goo.gl/OomyR Original: [36] http://goo.gl/LWNHW * Towards a Haskell Logic Library Domain: spin.atomicobject.com, Score: 30, Comments: 1 On Reddit: [37] http://goo.gl/puVS7 Original: [38] http://goo.gl/7dXA0 * Barabra Liskov - Keynote: The Power of Abstraction Domain: infoq.com, Score: 29, Comments: 25 On Reddit: [39] http://goo.gl/B7AZJ Original: [40] http://goo.gl/SSYSm Top StackOverflow Questions * What constitutes a fold for types other than list? votes: 34, answers: 4 Read on SO: [41] http://goo.gl/AkbgP * Lazy vs Strict implementations of data structures votes: 19, answers: 2 Read on SO: [42] http://goo.gl/De1VO * Compiling very large constants with GHC votes: 17, answers: 1 Read on SO: [43] http://goo.gl/mWOMz * Haskell Tree splitting: Can someone please explain this line? votes: 16, answers: 1 Read on SO: [44] http://goo.gl/ZVaQE * Could cabal notice about unused package in dependencies? votes: 15, answers: 1 Read on SO: [45] http://goo.gl/IUOx2 * How can eta-reduction of a well typed function result in a type error? votes: 14, answers: 2 Read on SO: [46] http://goo.gl/3A4hu * What is so special about Monads? votes: 14, answers: 4 Read on SO: [47] http://goo.gl/CF7BC * Why does ghci desugar type lists and type families? Can this be selectively disabled? votes: 13, answers: 0 Read on SO: [48] http://goo.gl/QBmM7 * How are functors in Haskell and OCaml similar? votes: 13, answers: 1 Read on SO: [49] http://goo.gl/rIYKy * Monitoring GHC activity votes: 10, answers: 1 Read on SO: [50] http://goo.gl/q7WuU * Why isn't the Prelude's words function written more simply? votes: 10, answers: 1 Read on SO: [51] http://goo.gl/W1TqA * How to design a monadic stack? votes: 10, answers: 2 Read on SO: [52] http://goo.gl/LAeJI * How to generate arbitrary instances of a simple type for quickcheck votes: 9, answers: 2 Read on SO: [53] http://goo.gl/oCesk Until next time, +Daniel Santa Cruz References 1. https://twitter.com/ID_AA_Carmack/status/331557216488390656 2. http://www.reddit.com/r/haskell/comments/1dv4ij/john_carmack_interested_in_… 3. https://twitter.com/id_aa_carmack/status/331918309916295168 4. http://www.reddit.com/r/haskell/comments/1dwjup/john_carmack_starting_port_… 5. http://www.haskellforall.com/2013/05/program-imperatively-using-haskell.html 6. http://www.reddit.com/r/haskell/comments/1dpk2b/haskell_for_all_program_imp… 7. http://www.reddit.com/r/haskell/comments/1dzk73/unmhip_a_haskell_image_proc… 8. http://www.reddit.com/r/haskell/comments/1dzk73/unmhip_a_haskell_image_proc… 9. https://github.com/bos/critbit 10. http://www.reddit.com/r/haskell/comments/1e1ywq/critbit_trees_in_haskell_fa… 11. http://izbicki.me/blog/markov-networks-monoids-and-futurama 12. http://www.reddit.com/r/haskell/comments/1e0759/tutorial_on_hlearns_markov_… 13. http://www.haskell.org/pipermail/haskell-cafe/2010-April/075647.html 14. http://www.reddit.com/r/haskell/comments/1df8fy/cool_mailing_list_archive_i… 15. http://www.reddit.com/r/haskell/comments/1e3cl0/haskell_intuition/ 16. http://www.reddit.com/r/haskell/comments/1e3cl0/haskell_intuition/ 17. http://blog.ezyang.com/2013/04/the-difference-between-recursion-induction/ 18. http://www.reddit.com/r/haskell/comments/1dbwp4/the_difference_between_recu… 19. http://www.yesodweb.com/blog/2013/05/yesod-1-2-released 20. http://www.reddit.com/r/haskell/comments/1dko1d/yesod_12_released/ 21. http://thread.gmane.org/gmane.comp.lang.haskell.general/19796 22. http://www.reddit.com/r/haskell/comments/1dhbjr/haskell_2014_committee_has_… 23. http://www.techempower.com/blog/2013/05/02/frameworks-round-4/ 24. http://www.reddit.com/r/haskell/comments/1dk73s/web_frameworks_benchmark_4_… 25. http://www.haskellforall.com/2013/05/pipes-330-folds-and-uniting-listt-with… 26. http://www.reddit.com/r/haskell/comments/1dsuto/haskell_for_all_pipes330_fo… 27. http://disciple-devel.blogspot.com/2013/05/first-working-program-using-repa… 28. http://www.reddit.com/r/haskell/comments/1dm7a6/first_working_program_using… 29. http://www.youtube.com/watch?v=QpDQhGYPqkU 30. http://www.reddit.com/r/haskell/comments/1dxx4m/how_to_use_hoogle_from_ghci/ 31. http://www.cakesolutions.net/teamblogs/2013/04/28/tph-episode-4-http-and-mo… 32. http://www.reddit.com/r/haskell/comments/1d9zou/4th_episode_of_the_pragmati… 33. http://www.reddit.com/r/haskell/comments/1dcfso/a_monadic_joke/ 34. http://www.reddit.com/r/haskell/comments/1dcfso/a_monadic_joke/ 35. http://gowers.wordpress.com/2013/04/14/answers-results-of-polls-and-a-brief… 36. http://www.reddit.com/r/haskell/comments/1dtw7v/a_natural_theorem_prover_in… 37. http://spin.atomicobject.com/2013/05/10/haskell-logic-library/?utm_source=t… 38. http://www.reddit.com/r/haskell/comments/1e2okw/towards_a_haskell_logic_lib… 39. http://www.infoq.com/presentations/programming-abstraction-liskov 40. http://www.reddit.com/r/haskell/comments/1dodfb/barabra_liskov_keynote_the_… 41. http://stackoverflow.com/questions/16426463/what-constitutes-a-fold-for-typ… 42. http://stackoverflow.com/questions/16296571/lazy-vs-strict-implementations-… 43. http://stackoverflow.com/questions/16348340/compiling-very-large-constants-… 44. http://stackoverflow.com/questions/16267497/haskell-tree-splitting-can-some… 45. http://stackoverflow.com/questions/16390273/could-cabal-notice-about-unused… 46. http://stackoverflow.com/questions/16402942/how-can-eta-reduction-of-a-well… 47. http://stackoverflow.com/questions/16439025/what-is-so-special-about-monads 48. http://stackoverflow.com/questions/16346293/why-does-ghci-desugar-type-list… 49. http://stackoverflow.com/questions/16353066/how-are-functors-in-haskell-and… 50. http://stackoverflow.com/questions/16348118/monitoring-ghc-activity 51. http://stackoverflow.com/questions/16446274/why-isnt-the-preludes-words-fun… 52. http://stackoverflow.com/questions/16457111/how-to-design-a-monadic-stack 53. http://stackoverflow.com/questions/16440208/how-to-generate-arbitrary-insta… 54. https://plus.google.com/105107667630152149014/about

1 0