http://blog.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/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 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 &amp; 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 &amp; Informatica, The Netherlands </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 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. </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 infinite loop. But it you type take 10 l', it works. A warning though, this function (that was just for learning purpose) has a huge flaw: it returns the final generator, but you can't use it. If you try, it will run into an infinite loop. Now In your version, the first thing the function does is call itself recursively. So before you can get a result, you will do all the recursive calls until the last one. David. _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </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 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 </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 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&lt;mailto:resume&lt; at &gt;alephcloud.com&gt; 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. _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </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 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 &amp; 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_doing_a_moderatesized/ 3. https://twitter.com/id_aa_carmack/status/331918309916295168 4. http://www.reddit.com/r/haskell/comments/1dwjup/john_carmack_starting_port_of_wolf_3d_in_haskell/ 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_imperatively_using/ 7. http://www.reddit.com/r/haskell/comments/1dzk73/unmhip_a_haskell_image_processing_library/ 8. http://www.reddit.com/r/haskell/comments/1dzk73/unmhip_a_haskell_image_processing_library/ 9. https://github.com/bos/critbit 10. http://www.reddit.com/r/haskell/comments/1e1ywq/critbit_trees_in_haskell_fast_and_open_to/ 11. http://izbicki.me/blog/markov-networks-monoids-and-futurama 12. http://www.reddit.com/r/haskell/comments/1e0759/tutorial_on_hlearns_markov_networks_monoids_and/ 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_stumbled_on_haskell/ 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_recursion_induction/ 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_now_been_formed/ 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_includes_wai/ 25. http://www.haskellforall.com/2013/05/pipes-330-folds-and-uniting-listt-with.html 26. http://www.reddit.com/r/haskell/comments/1dsuto/haskell_for_all_pipes330_folds_and_uniting_listt/ 27. http://disciple-devel.blogspot.com/2013/05/first-working-program-using-repa-plugin.html 28. http://www.reddit.com/r/haskell/comments/1dm7a6/first_working_program_using_the_repa_plugin/ 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-more/ 32. http://www.reddit.com/r/haskell/comments/1d9zou/4th_episode_of_the_pragmatic_haskeller_http_and/ 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-description-of-the-program/ 36. http://www.reddit.com/r/haskell/comments/1dtw7v/a_natural_theorem_prover_in_haskell_by_tim_gowers/ 37. http://spin.atomicobject.com/2013/05/10/haskell-logic-library/?utm_source=twitter-sv 38. http://www.reddit.com/r/haskell/comments/1e2okw/towards_a_haskell_logic_library/ 39. http://www.infoq.com/presentations/programming-abstraction-liskov 40. http://www.reddit.com/r/haskell/comments/1dodfb/barabra_liskov_keynote_the_power_of_abstraction/ 41. http://stackoverflow.com/questions/16426463/what-constitutes-a-fold-for-types-other-than-list 42. http://stackoverflow.com/questions/16296571/lazy-vs-strict-implementations-of-data-structures 43. http://stackoverflow.com/questions/16348340/compiling-very-large-constants-with-ghc 44. http://stackoverflow.com/questions/16267497/haskell-tree-splitting-can-someone-please-explain-this-line 45. http://stackoverflow.com/questions/16390273/could-cabal-notice-about-unused-package-in-dependencies 46. http://stackoverflow.com/questions/16402942/how-can-eta-reduction-of-a-well-typed-function-result-in-a-type-error 47. http://stackoverflow.com/questions/16439025/what-is-so-special-about-monads 48. http://stackoverflow.com/questions/16346293/why-does-ghci-desugar-type-lists-and-type-families-can-this-be-selectively-disa 49. http://stackoverflow.com/questions/16353066/how-are-functors-in-haskell-and-ocaml-similar 50. http://stackoverflow.com/questions/16348118/monitoring-ghc-activity 51. http://stackoverflow.com/questions/16446274/why-isnt-the-preludes-words-function-written-more-simply 52. http://stackoverflow.com/questions/16457111/how-to-design-a-monadic-stack 53. http://stackoverflow.com/questions/16440208/how-to-generate-arbitrary-instances-of-a-simple-type-for-quickcheck 54. https://plus.google.com/105107667630152149014/about _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </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=0pRQwEVKAo4lM1 (c) 2012, LinkedIn Corporation. 2029 Stierlin Ct, Mountain View, CA 94043, USA. _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </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-1) new_gen (rand_num:acc) To me, it makes the function(s) simplistic to understand. Is the first solution a known 'design pattern' in recursion? The first solution: 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) seems to operate a bit like foldr: the recursion spins to the base case, and the base case's return value, ([], gen), is passed back through all the function calls. Each function call modifies the tuple (the in clause) before returning it to the previous function call. 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. Thanks. </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 programs are today among the largest applications written in any functional programming language. These applications offer new opportunities to evaluate functional programming and functional programming methods on a very large scale and suggest new problems for the research community to solve. This workshop will bring together the open source, academic, and industrial programming communities of Erlang. It will enable participants to familiarize themselves with recent developments on new techniques and tools tailored to Erlang, novel applications, draw lessons from users' experiences and identify research problems and common areas relevant to the practice of Erlang and functional programming. We invite three types of submissions. 1. Technical papers describing language extensions, critical discussions of the status quo, formal semantics of language constructs, program analysis and transformation, virtual machine extensions and compilation techniques, implementations and interfaces of Erlang in/with other languages, and new tools (profilers, tracers, debuggers, testing frameworks, etc.). The maximum length for technical papers is restricted to 12 pages. 2. Practice and application papers describing uses of Erlang in the "real-world", Erlang libraries for specific tasks, experiences from using Erlang in specific application domains, reusable programming idioms and elegant new ways of using Erlang to approach or solve a particular problem. The maximum length for the practice and application papers is restricted to 12 pages. Note that this is a maximum length; we welcome shorter papers also, and the program committee will evaluate all papers on an equal basis independent of their lengths. 3. Poster presentations describing topics related to the workshop goals. Each includes a maximum of 2 pages of the abstract and summary. Presentations in this category will be given an hour of shared simultaneous demonstration time. Workshop Chair ----------------------- Steve Vinoski, Basho Technologies, USA Program Chair ------------------- Laura M. Castro, University of A Coruña, Spain Program Committee ----------------------------- (Note: the Workshop and Program Chairs are also committee members) Lars-Ake Fredlund, Universidad Politécnica de Madrid, Spain Kevin Hammond, University of St. Andrews, UK Torben Hoffman, Erlang Solutions Limited, UK Zoltán Horváth, Eötvös Loránd University, Hungary Kenneth Lundin, Ericsson AB, Sweden Mickaël Rémond, ProcessOne, France Kenji Rikitake, Basho Japan KK, Japan Simon Thompson, University of Kent, UK Important Dates ----------------------- Submission deadline: Fri June 14, 2013 Author notification: Thu July 11, 2013 Final submission for the publisher: Thu July 25, 2013 Workshop date (tentative, subject to change): September 28, 2013 Instructions to authors -------------------------------- Papers must be submitted online via EasyChair (via the "Erlang2013" event). The submission page is https://www.easychair.org/conferences/?conf=erlang2013 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines. Each submission must adhere to SIGPLAN's republication policy. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. Paper submissions will be considered for poster submission in the case they are not accepted as full papers. Venue &amp; Registration Details ------------------------------------------ For registration, please see the ICFP 2013 web site at: http://icfpconference.org/icfp2013/ Related Links -------------------- ICFP 2013 web site: http://www.icfpconference.org/icfp2013/ Past ACM SIGPLAN Erlang workshops: http://www.erlang.org/workshop/ Open Source Erlang: http://www.erlang.org/ EasyChair submission site: https://www.easychair.org/account/signin.cgi?conf=erlang2013 Author Information for SIGPLAN Conferences: http://www.sigplan.org/authorInformation.htm -- Laura M. Castro _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </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 computer science or a related discipline, and will have a genuine commitment to teaching all aspects of software at both undergraduate and postgraduate levels. Enthusiasm for the development and delivery of novel teaching modules on algorithms, data-structures and compilers is also required. For more details of the post, and how to apply see https://jobs.tcd.ie/ Informal enquiries are welcome and candidates may e-mail Professor Matthew Hennessy (matthew.hennessy&lt; at &gt;cs.tcd.ie) _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </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 summaries of your own area of work. Many of you respond (eagerly, unprompted, and sometimes in time for the actual deadline) to the call. The editor collects all the contributions into a single report and feeds that back to the community. When I try for the next update, six months from now, you might want to report on your own work, project, research area or group as well. So, please put the following into your diaries now: ======================================== End of October 2013: target deadline for contributions to the November 2013 edition of the HC&amp;A Report ======================================== Unfortunately, many Haskellers working on interesting projects are so busy with their work that they seem to have lost the time to follow the Haskell related mailing lists and newsgroups, and have trouble even finding time to report on their work. If you are a member, user or friend of a project so burdened, please find someone willing to make time to report and ask them to "register" with the editor for a simple e-mail reminder in October (you could point me to them as well, and I can then politely ask if they want to contribute, but it might work better if you do the initial asking). Of course, they will still have to find the ten to fifteen minutes to draw up their report, but maybe we can increase our coverage of all that is going on in the community. Feel free to circulate this announcement further in order to reach people who might otherwise not see it. Enjoy! Janis Voigtlaender &lt;hcar at haskell.org&gt; </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: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on this website. ----------------------- Call for Talk Proposals ----------------------- We solicit proposals for contributed talks. Proposals should be at most 2 pages, in either plain text or PDF format, and should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read. We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs at the address hope2013 AT mpi-sws.org. Deadline for talk proposals: June 14, 2013 (Friday) Notification of acceptance: July 28, 2013 (Sunday) Workshop: September 28, 2013 (Saturday) The submission website is now open: https://www.easychair.org/conferences/?conf=hope2013 --------------------- Workshop Organization --------------------- Program Co-Chairs: Derek Dreyer (MPI-SWS, Germany) Hongseok Yang (University of Oxford) Program Committee: Anindya Banerjee (IMDEA Software Institute) Lars Birkedal (Aarhus University) Aquinas Hobor (National University of Singapore) Chung-Kil Hur (Microsoft Research Cambridge) Patricia Johann (Appalachian State University) Matthew Might (University of Utah) Peter Mueller (ETH Zurich) Brigitte Pientka (McGill University) Zhong Shao (Yale) _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </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 many core processor products. You will work together with Intel's formal verification and validation community, the Formal Verification Center of Expertise (FV CoE) in a team of experts in formal methods and AV Validation. Your specific responsibilities will include defining formal verification (FV) test plans as well as Cluster Test Environment (CTE) based test plans for dynamic simulation validation (DV). The goal is to help optimize a combined use of FV and CTE based validation techniques (DV) and contribute to an increasing use of formal methods at Intel. Based on the test plans you will write properties in formal language, and prove the properties using our model checkers and theorem proving tools. You will also write CTE based test cases and coverage plans. Your area of strength may currently lie within either FV or DV with strong skills rooted in software development. But through your skills and work, you will become an expert in both formal methods and validation technologies. You will interact very closely with design teams, and other validation teams, as well as with Intel's internal R&amp;D groups that continue to improve and develop formal method and verification tools. You must be able to communicate effectively with various technical groups and coordinate activities amongst those groups. _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </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 http://permalink.gmane.org/gmane.comp.lang.haskell.general/19811 <pre> For what it's worth, I think we need Data.Maybe.Strict, Data.Tuple.Strict, and Data.Either.Strict in base. Only then will they be accessible enough that we can start using them in APIs in core packages. This will also make it easier to provide type class instances (e.g. Binary) for them without creating odd package dependencies (or packages that depends on everything under the sub). </pre> Johan Tibell 2013-05-08T18:26:57 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.comp.lang.haskell.general