January 2016 - Haskell

Haskell dev roles with Strats at Standard Chartered
by Don Stewart 18 Jan '16

18 Jan '16

Hi folks, I'm hiring 3 more devs to write Haskell for Standard Chartered in London and Singapore. Details of the roles below, but broadly in FX algo pricing and pricing automation. Ability to write "tight" total Haskell that can run 24/7 and do the right thing is needed. https://donsbot.wordpress.com/2016/01/18/haskell-developer-roles-at-standar… CVs to me at Standard Chartered -- Don

1 0

CfP: Workshop on Program Transformation for Programmability in Heterogeneous Architectures (Co-located with CGO16); Deadline Jan 22 [Extended]
by Salvador Tamarit 16 Jan '16

16 Jan '16

[Apologies if you receive multiple copies of this announcement.] ********************************************************************************* PROHA 2016, CALL FOR PAPERS -- Deadline extension First Workshop on Program Transformation for Programmability in Heterogeneous Architectures http://goo.gl/RzGbzY Barcelona, 12th March 2016, in conjunction with the CGO'16 Conference ********************************************************************************* Important Dates: Paper submission deadline: 22 January 2016 23:59 (UTC) [Extended] Author notification: 5 February 2016 Final manuscript due: 26 February 2016 Scope: Developing and maintaining high-performance applications and libraries for heterogeneous architectures is a difficult task, usually requiring code transformations performed by an expert. Tools assisting in and, if possible, automating such transformations are of course of great interest. However, such tools require significant knowledge and reasoning capabilities. For example, the former could be a machine-understandable descriptions of what a piece of code is expected to do, while the latter could be a set of transformations and a corresponding logical context in which they are applicable, respectively. Furthermore, strategies to identify the sequence of transformations leading to the best resulting code need to be elaborated. This workshop will focus on techniques and foundations which make it possible to perform source code transformations, which preserve the intended semantics of the original code and improve efficiency, portability or maintainability. The topics of interest for the workshop include, but are not limited to: * Program annotations to capture algorithmic properties and intended code semantics. * Programming paradigms able to express underlying (mathematical) properties of code. * Usage of dynamic and static mechanisms to infer relevant code properties. * Transformations which preserve intended semantics. * Strategies to apply transformations. * Heuristics to guide program transformation and techniques to synthesize / learn these heuristics. * Tools Submission Guidelines: Submissions are to be written in English and not exceed 10 pages, including bibliography. Submissions should be written in ACM double-column format using a 10-point type. Authors should follow the information for formatting ACM SIGPLAN conference papers, which can be found at http://www.sigplan.org/Resources/Author . Authors should submit their papers in pdf format using the EasyChair submission website https://easychair.org/conferences/?conf=proha2016 . Publication: The proceedings will be made publicly available through ArXiV. Workshop Organizers: - Manuel Carro, IMDEA Software Institute and Technical University of Madrid - Colin W. Glass, University of Stuttgart - Jan Kuper, University of Twente - Julio Mariño, Technical University of Madrid - Lutz Schubert, University of Ulm - Guillermo Vigueras, IMDEA Software Institute - Salvador Tamarit, Technical University of Madrid If you have any questions, please contact the program chair at manuel.carro(a)imdea.org

1 0

RV 2016, Sept 23-30 2016, Madrid, Spain - 1st Call for Papers and Tutorials
by Yliès Falcone 15 Jan '16

15 Jan '16

RV 2016 16th International Conference on Runtime Verification September 23-30, Madrid, Spain http://rv2016.imag.fr <http://rv2016.imag.fr/> Scope Runtime verification is concerned with monitoring and analysis of software and hardware system executions. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they are significantly more powerful and versatile than conventional testing, and more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for testing, verification, and debugging purposes, and after deployment for ensuring reliability, safety, and security and for providing fault containment and recovery as well as online system repair. Topics of interest to the conference include: - specification languages - specification mining - program instrumentation - monitor construction techniques - logging, recording, and replay - runtime enforcement, fault detection, localization, containment, recovery and repair - program steering and adaptation - metrics and statistical information gathering - combination of static and dynamic analyses - program execution visualization - monitoring techniques for safety/mission-critical systems - monitoring distributed systems, cloud services, and big data applications - monitoring security and privacy policies Application areas of runtime verification include cyber-physical systems, safety/mission-critical systems, enterprise and systems software, autonomous and reactive control systems, health management and diagnosis systems, and system security and privacy. Invited Speakers The program of RV 2016 will feature invited talks from: Gul Agha (University of Illinois at Urbana-Champaign, USA) Oded Maler (CNRS and University of Grenoble-Alpes, France) Fred B. Schneider (Cornell University, USA) Overview RV 2016 will be held September 23-30 in Madrid, Spain. RV 2016 will feature the first summer school on Runtime Verification (September 23-25), two workshop days (September 26-25), and three conference days (September 28-30). General Information on Submissions All papers and tutorials will appear in the conference proceedings in an LNCS volume. Submitted papers and tutorials must use the LNCS/Springer style. At least one author of each accepted paper and tutorial must attend RV 2016 to present the paper. Papers must be written in English and submitted electronically (in PDF format) using the EasyChair system. The below page limitations include all text and figures, but exclude references. Additional details omitted due to space limitations may be included in a clearly marked appendix that will be reviewed at the discretion of reviewers. Research Papers Track Research papers can be submitted in two categories: regular and short papers. Papers in both categories will be reviewed by at least 3 members of the Program Committee. Regular Papers (up to 15 pages) should present original unpublished results. Theoretical papers, system and application papers as well as case studies on runtime verification are all welcome. The Program Committee of RV 2015 will give a best paper award. A selection of accepted regular papers will be invited to appear in a special issue of the Springer Journal on Formal Methods in System Design. Short Papers (up to 6 pages) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. Accepted short papers will be presented in special talk (15 minutes) and poster sessions. Tool Papers Track The aim of the RV 2016 tool track is to provide an opportunity for researchers and practitioners to show and to discuss the latest advances, experiences and challenges in devising and developing reliable software tools for runtime verification. All tool papers will be reviewed by at least 3 members of the Tool Committee. An author of each accepted tool paper should give a 15-20 minutes demonstration during the conference. All tool papers must include information on tool availability, maturity, selected experimental results and it should provide a link to a website containing the theoretical background and user guide. Furthermore, we strongly encourage authors to make their tools and benchmarks available with their submission. We encourage tool papers to include a script in an appendix (not included in the page count) describing how the demo will be conducted during the conference presentation with screenshots presenting step-by-step the tool’s capabilities, highlighting the main characteristics and the usage. Tool papers can be submitted into two categories: Regular Tool Papers (up to 8 pages). A tool paper in this category should present a new tool, a new tool component or significant and novel extensions to existing tools supporting runtime verification. Each submission should be original and not published previously in a tool paper form. Tool Exhibition Papers (up to 4 pages). A tool paper in this category can have been previously published. A tool paper in this category should be oriented towards the tool usage and is an opportunity for the developers to present them at RV 2016. Tutorial Track Tutorials are two-to-three-hour presentations on a selected topic. Additionally, tutorial presenters will be offered to publish a paper of up to 20 pages in the LNCS conference proceedings. A proposal for a tutorial must contain the subject of the tutorial, a proposed timeline, a note on previous similar tutorials (if applicable) and the differences to this incarnation, and a biography of the presenter. The proposal must not exceed 2 pages. Tutorial proposals will be reviewed by the Program Committee. Important Dates Research and tool papers as well as tutorials will follow the following timeline: Abstract deadline: May 8, 2016 Paper and tutorial deadline: May 15, 2016 Tutorial notification: June 1, 2016 Paper notification: July 11, 2016 Camera ready deadline: August 8, 2016 Summer school: September 23-25, 2016 Workshops and tutorials: September 26-27, 2016 Conference: September 28-30, 2016 Committees Program Committee Chairs Yliès Falcone, Univ. Grenoble-Alpes and Inria, France Cesar Sanchez, IMDEA Software, Madrid, Spain Tool Committee Chair Klaus Havelund, NASA Jet Propulsion Laboratory, USA Local Organization Chair Juan E. Tapiador, Universidad Carlos III de Madrid, Spain Program Committee Erika Abraham, RWTH Aachen University, Germany Howard Barringer, The University of Manchester, UK Ezio Bartocci, TU Wien, Austria Andreas Bauer, NICTA & Australian National University, Australia Saddek Bensalem, Univ. Grenoble Alpes, France Eric Bodden, Fraunhofer SIT and Technische University Darmstadt, Germany Borzoo Bonakdarpour, McMaster University, Canada Laura Bozzelli, Technical University of Madrid (UPM), Spain Juan Caballero, IMDEA Software Institute, Spain Wei-Ngan Chin, National University of Singapore, Singapore Christian Colombo, University of Malta, Malta Jyotirmoy Deshmukh, Toyota Technical Center, USA Alexandre Donzé, UC Berkeley EECS Department, USA Yliès Falcone, Univ. Grenoble Alpes and Inria, France Bernd Finkbeiner, Saarland University, Germany Adrian Francalanza, University of Malta, Malta Vijay Garg, The University of Texas at Austin, USA Patrice Godefroid, Microsoft Research, USA Susanne Graf, Univ. Grenoble Alpes and CNRS, France Radu Grosu, Vienna University of Technology, Austria Sylvain Hallé, Université du Québec à Chicoutimi, Canada Klaus Havelund, NASA Jet Propulsion Laboratory, USA Johan Jaffar, National University of Singapore, Singapore Thierry Jéron, Inria Rennes – Bretagne Atlantique, France Johannes Kinder, Royal Holloway University of London, UK Felix Klaedtke, NEC Europe Ltd., Germany Kim G. Larsen, Aalborg University, Denmark Axel Legay, Inria Rennes – Bretagne Atlantique, France Martin Leucker, University of Lübeck, Germany Benjamin Livshits, Microsoft Research, USA Joao Lourenço, Universidade Nova de Lisboa, Portugal Rupak Majumdar, MPI-SWS, Germany Leonardo Mariani, University of Milano Bicocca, Italy David Naumann, Stevens Institute of Technology, USA Dejan Nickovic, Austrian Institute of Technology, Austria Gordon Pace, University of Malta, Malta Doron Peled, Bar Ilan University, Israel Lee Pike, Galois, Inc., USA Grigore Rosu, University of Illinois at Urbana-Champaign, USA Gwen Salaün, Univ. Grenoble Alpes and Inria, France Cesar Sanchez, IMDEA Software Institute, Spain Sriram Sankaranarayanan, University of Colorado Boulder, USA Gerardo Schneider, University of Gothenburg, Sweden Scott Smolka, Stony Brook University, USA Oleg Sokolsky, University of Pennsylvania, USA Bernhard Steffen, University of Dortmund, Germany Scott Stoller, Stony Brook University, USA Volder Stolz, University of Oslo, Norway Jun Sun, Singapore University of Technology and Design, Singapore Juan Tapiador, Universidad Carlos III de Madrid, Spain Serdar Tasiran, Koc Univ., Turkey Michael Whalen, University of Minnesota, USA Eugen Zalinescu, ETH Zurich, Switzerland Lenore Zuck, University of Illinois at Chicago, USA Tool Committee Steven Artz, EC Spride, Germany Howard Barringer, The University of Manchester, UK Ezio Bartocci, TU Wien, Austria Martin Leucker, University of Luebeck, Germany Gordon Pace, University of Malta, Malta Giles Reger, The University of Manchester, UK Julien Signoles, CEA, France Oleg Sokolsky, University of Pennsylvania, USA Bernhard Steffen, University of Dortmund, Germany Nikolai Tillmann, Microsoft Research, USA Eugen Zalinescu, ETH Zurich, Switzerland

1 0

Haskell Weekly News
by Kim-Ee Yeoh 15 Jan '16

15 Jan '16

*Top Picks:* - Team GHC announces the first release candidate of version 8.0 <http://haskell.1045720.n5.nabble.com/ANNOUNCE-Glasgow-Haskell-Compiler-8-0-…>. New features include: - Strict and StrictData extensions - TypeFamilyDependencies extension for injective type families <https://ghc.haskell.org/trac/ghc/wiki/InjectiveTypeFamilies> - TypeInType extension for more dependent typing hackery - explicit type application in plain Haskell, not Core - Applicative do-notation - a spanking new pattern-match checker - modularization of the ghci interpreter: it can now run as an independent process Note that the announcement includes a list of bugs linked to the new features. - The engineers at an Australian real estate listings website explain how they "used Category Theory to solve a problem in Java." <http://techblog.realestate.com.au/how-we-used-category-theory-to-solve-a-pr…> They face the problem of their search API having grown gnarly and inextensible. First they offer a monoid tutorial culminating in SearchResults -> SearchResults endomorphisms. Then they regularize their database lookups as Kleisli-composable instances of a monomorphic state monad of type (DataSource, SearchResults) -> SearchResults. Finally, they profunctorize the state monad for mereological development of the DataSource. So how was the blog post received? A vocal section of the HN community express skepticism <https://news.ycombinator.com/item?id=10892696>. One haskell subredditor found it "an excellent article." <https://www.reddit.com/r/haskell/comments/40s85b/how_we_used_category_theor…> - Verity Stob <https://en.wikipedia.org/wiki/Verity_Stob>, the doyen of information technology satire, skewers the cargo culting of Functional Programming <http://www.theregister.co.uk/2016/01/13/stob_remember_the_monoids/> and by the by writes a monad tutorial (omg!). Haskell redditors chuckle and cluck at the hatchet job <https://www.reddit.com/r/haskell/comments/40wqzf/learn_you_func_prog_on_fiv…> . - Team Wander Nauta creates Viskell <https://github.com/wandernauta/viskell>, "an experimental visual programming environment for a typed (Haskell-like) functional programming language." Programming with touch tablets in mind, he implements Viskell in Java 8 because "Haskell lacks suitable GUI libraries, and we need good multi-touch support." A slides PDF contains more screenshots. <https://github.com/wandernauta/viskell/blob/master/viskell-nlfpday.pdf> Well-received on both Hacker News <https://news.ycombinator.com/item?id=10874294> and /r/haskell <https://www.reddit.com/r/haskell/comments/406au9/viskell_visual_programming…> . *Quotes of the Week:* - Tom Ellis: <https://news.ycombinator.com/item?id=10870488#up_10874714> In Haskell you don't fight the type system. It fights your bugs. - Jeremy Bowers: <https://news.ycombinator.com/item?id=10892293#up_10896419> The reason I find Haskell interesting is precisely that it's the only place I know where the theoretically-minded and the practically-minded get together and interpollinate. Everywhere else the one group pretty much just sneers at the other. - Redditor lukewarm: <https://www.reddit.com/r/haskell/comments/40aa4n/how_to_make_industry_quali…> Yes, you can write industry quality software in Haskell. Do all your computations in the IO monad, keep intermediate results in MVars. Use only Int and String types. Use exceptions to handle errors. Write yourself custom constructs to emulate for and while loops, preferably using Template Haskell. -- Kim-Ee

1 0

Call for Participation: BOB 2016 (February 19, Berlin)
by Stefan Wehr 14 Jan '16

14 Jan '16

Quick reminder: the early registration deadline for BOB 2016 is this Sunday! We have some interesting Haskell talks and tutorials at BOB 2016! ================================================================ BOB 2016 Conference "What happens if we simply use what's best?" February 19, 2016 Berlin http://bobkonf.de/2016/ Program: http://bobkonf.de/2016/program.html Registration: http://bobkonf.de/2016/registration.html ================================================================ BOB is the conference for developers, architects and decision-makers to explore technologies beyond the mainstream in software development, and to find the best tools available to software developers today. Our goal is for all participants of BOB to return home with new insights that enable them to improve their own software development experiences. The program features 14 talks and 8 tutorials on current topics: http://bobkonf.de/2016/program.html The subject range of talks includes functional programming, advanced front-end development, data management, and sophisticated uses of types. The tutorials feature introductions to Erlang, Haskell, Scala, Isabelle, Purescript, Idris, Akka HTTP, and Specification by Example. Elise Huard will hold the keynote talk - about Languages We Love. Registration is open online: http://bobkonf.de/2016/registration.html NOTE: The early-bird rates expire on January 17, 2016! BOB cooperates with the :clojured conference on the following day. There is a registration discount available for participants of both events. http://www.clojured.de/

1 0

Reminder: Call for papers EOOLT 2016
by Henrik Nilsson 13 Jan '16

13 Jan '16

Dear all, EOOLT 2016, the 7th Workshop on Equation-Based Object-Oriented Modeling Languages and Tools, may be of interest to people working on e.g. functional reactive programming or more generally aspects of embedded declarative domain-specific languages. EOOLT 2016 is organised in cooperation with ACM SIGPPLAN and the submission deadline is 25 January. The CFP is enclosed below and full information is available here: http://www.eoolt.org/2016 All the best, /Henrik EOOLT 2016 April 18, Milano, Italy 7th International Workshop on Equation-Based Object-Oriented Modeling Languages and Tools Politecnico di Milano, Milano, Italy Deadline for paper submission: January 25, 2016 GENERAL CHAIR Francesco Casella Politecnico di Milano (DEIB) PROGRAM CHAIR Dirk Zimmer German Aerospace Center (DLR) The EOOLT workshop addresses the current state of the art of equation-based object-oriented (EOO) modeling languages and tools. Integration of and comparison with related approaches and languages, such as actor-oriented, synchronous, and domain specific languages, are of particular interest. Contributions to this workshop focus on methodological aspects and describe new solutions for the design and use of equation-based languages. In addition to full contributions, shorter work-in-progress paper are welcome, offering an opportunity to discuss current approaches within the community. Typical themes of the EOOLT workshop range from language design via modeling aspects to simulation code: • Design aspects of equation-based languages and their formal semantics • Relation to other languages such as functional reactive programming (FRP) or synchronous languages • Verification, type systems, and early static checking • Discrete-event and hybrid system modeling • Acausality/non-causality and its role in model reusability • Multi-resolution/multi-scale modeling using EOO languages • Model-driven development related to EOO languages • Equation-based modeling in the frame of system engineering • Reflection and meta-programming • Environments for modeling, simulation and debugging • Mathematical formalisms for simulation semantics • Code generation for real-time systems, embedded system, multi-core platforms, and distributed systems • Tools for analyzing or optimizing equation-based models -- Henrik Nilsson School of Computer Science The University of Nottingham nhn(a)cs.nott.ac.uk This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.

1 0

MSFP 2016: Final Call for Papers
by Bob Atkey 12 Jan '16

12 Jan '16

Sixth Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 8 April 2016, in Eindhoven, The Netherlands A satellite workshop of ETAPS 2016 http://msfp2016.bentnib.org/ NOTE: the deadline for paper submissions has been extended by one day to: *Monday 18th January* Prior submission of an abstract is not required The sixth workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Where would Haskell be without monads? Functional reactive programming without temporal logic? Call-by-push-value without adjunctions? The list goes on. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006, affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP workshop was held in Baltimore, USA, as part of ICFP 2010. The fourth workshop was held in Tallinn, Estonia, as part of ETAPS 2012. The fifth workshop was held in Grenoble, France, as part of ETAPS 2014. Important Dates: ================ Submission 18th January 2016 Notification 17th February 2016 Final version 24th February 2016 Workshop 8th April 2016 Invited Speakers: ================= To be announced. Program Committee: ================== Zena Ariola, University of Oregon Robert Atkey, University of Strathclyde (co-chair) Ornela Dardha, University of Glasgow Helle Hvid Hansen, Delft University of Technology Chantal Keller, IUT d'Orsay Neelakantan Krishnaswami, University of Birmingham (co-chair) Nicolas Wu, University of Bristol Submission: =========== Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the workshop by one of the authors, and will be published under the auspices of EPTCS under a Creative Commons license. There is no specific page limit, but authors should strive for brevity.

1 0

ANN: true-name 0.1.0.0 released
by Liyang HU 11 Jan '16

11 Jan '16

> Also sent to comp.lang.haskell.cafe, & to convince Gmane I'm not top-posting. It is with some shame that I announce ‘true-name’, a package to assist one in violating those pesky module abstraction boundaries via the magick of Template Haskell. http://hackage.haskell.org/package/true-name Take ‘Control.Concurrent.Chan’ for example; you can get your grubby mitts on the ‘Chan’ data constructor, despite it not being exported. Here we pattern match on it, and bind ‘chanR’ and ‘chanW’ to the ‘MVar’s containing the read and write ends of the channel respectively: > chan@[truename| ''Chan Chan | chanR chanW |] <- newChan > writeChan chan (42 :: Int) Now, the type of ’chanR’ references the unexported ‘Stream’ and ‘ChItem’ types. We need the ‘ChItem’ data constructor―which is hidden under a few indirections—but that's not a problem: > streamR <- readMVar chanR > [truename| ''Chan Chan Stream ChItem ChItem | x _ |] <- readMVar streamR > putStrLn $ "chan contains: " ++ show x This gives us a rather dodgy ‘peekChan’. This sort of thing is usually a Bad Idea™, but may sometimes be more palatable than the alternatives. Full example: https://github.com/liyang/true-name/blob/master/sanity.hs Taking another example, suppose we want the ‘Array’ type constructor hidden deep in the bowels of the ‘HashMap’ implementation: ghci> :set -XQuasiQuotes ghci> import Data.HashMap.Strict ghci> :kind [truename| ''HashMap Full Array |] [truename| ''HashMap Full Array |] :: * -> * The ‘Array’ data constructor is one more reification away: ghci> :type [truename| ''HashMap Full Array Array |] [truename| ''HashMap Full Array Array |] :: ghc-prim-0.4.0.0:GHC.Prim.Array# a -> unordered-containers-0.2.5.1:Data.HashMap.Array.Array a Please don't flame me. /Liyang

1 0

CfP: Workshop on Program Transformation for Programmability in Heterogeneous Architectures (Co-located with CGO16); Deadline Jan 15
by Salvador Tamarit 09 Jan '16

09 Jan '16

[Apologies if you receive multiple copies of this announcement.] ********************************************************************************* PROHA 2016, CALL FOR PAPERS First Workshop on Program Transformation for Programmability in Heterogeneous Architectures http://goo.gl/RzGbzY Barcelona, 12th March 2016, in conjunction with the CGO'16 Conference ********************************************************************************* Important Dates: Paper submission deadline: 15 January 2016 23:59 (UTC) Author notification: 5 February 2016 Final manuscript due: 26 February 2016 Scope: Developing and maintaining high-performance applications and libraries for heterogeneous architectures is a difficult task, usually requiring code transformations performed by an expert. Tools assisting in and, if possible, automating such transformations are of course of great interest. However, such tools require significant knowledge and reasoning capabilities. For example, the former could be a machine-understandable descriptions of what a piece of code is expected to do, while the latter could be a set of transformations and a corresponding logical context in which they are applicable, respectively. Furthermore, strategies to identify the sequence of transformations leading to the best resulting code need to be elaborated. This workshop will focus on techniques and foundations which make it possible to perform source code transformations, which preserve the intended semantics of the original code and improve efficiency, portability or maintainability. The topics of interest for the workshop include, but are not limited to: * Program annotations to capture algorithmic properties and intended code semantics. * Programming paradigms able to express underlying (mathematical) properties of code. * Usage of dynamic and static mechanisms to infer relevant code properties. * Transformations which preserve intended semantics. * Strategies to apply transformations. * Heuristics to guide program transformation and techniques to synthesize / learn these heuristics. * Tools Submission Guidelines: Submissions are to be written in English and not exceed 10 pages, including bibliography. Submissions should be written in ACM double-column format using a 10-point type. Authors should follow the information for formatting ACM SIGPLAN conference papers, which can be found at http://www.sigplan.org/Resources/Author . Authors should submit their papers in pdf format using the EasyChair submission website https://easychair.org/conferences/?conf=proha2016 . Publication: The proceedings will be made publicly available through ArXiV. Workshop Organizers: - Manuel Carro, IMDEA Software Institute and Technical University of Madrid - Colin W. Glass, University of Stuttgart - Jan Kuper, University of Twente - Julio Mariño, Technical University of Madrid - Lutz Schubert, University of Ulm - Guillermo Vigueras, IMDEA Software Institute - Salvador Tamarit, Technical University of Madrid If you have any questions, please contact the program chair at manuel.carro(a)imdea.org

1 0

Haskell Weekly News
by Kim-Ee Yeoh 08 Jan '16

08 Jan '16

Folks: Recall the quote from the May Day 2015 issue: <http://haskell.1045720.n5.nabble.com/Haskell-Weekly-News-td5808226.html> The MLs and Haskell remind me of Brian Eno's line about how the first Velvet Underground album only sold 30,000 copies, but "everyone who bought one of those 30,000 copies started a band". This issue spotlights Elm and Idris, two languages implemented in Haskell. Enjoy! *Top Picks:* - Evan Czaplicki of the Elm web-front-end language leaves Prezi for NoRedInk <http://elm-lang.org/blog/new-adventures-for-elm>. A startup dedicated to improving high-school English grammar, NoRedInk already employs 5 engineers writing Elm full-time. A HN comment hyperbolizes that Elm <https://news.ycombinator.com/item?id=10837278#up_10838052> "is Clojure without parens, it's Haskell without academy, it's Redux without facebook, it's duck-typing without quacks, it's MVC without objects, and last but not least Evan Czaplicki (the creator) is the new Aaron Patterson (bright and fun!)." [Ed. Aaron is a Ruby and also Rails core dev.] - Janos Dobronszki, a self-described "Haskell addict, latent Idris fan", introduces Idris <http://crufter.com/2015/01/01/idris-a-language-which-will-change-the-way-yo…> as "a language that will change the way you think about programming <https://news.ycombinator.com/from?site=crufter.com>." He motivates dependent types using the classic list vector example. The Hacker News community enthuses over the article <https://news.ycombinator.com/item?id=10850205> with healthy signs of grassroots static-typing evangelism. Elsewhere, a haskell redditor obtains valuable answers about the tradeoffs that dependently typed programming incurs <https://www.reddit.com/r/haskell/comments/3zc81v/tradeoffs_of_dependent_typ…> . - In "Monads to Machine Code (Part 1)" <http://www.stephendiehl.com/posts/monads_machine_code.html>, Stephen Diehl walks his readers through an LLVM-like runtime machine code generation while introducing the x86 architecture all at the same time. No mean feat, what more x86 as opposed to a RISC architecture. Much-loved on HN <https://news.ycombinator.com/item?id=10842988>. Also on haskell reddit <https://www.reddit.com/r/haskell/comments/3zfca3/monads_to_machine_code_par…>. Compare to Lennart Augustsson's older series on code generation <http://augustss.blogspot.com/search/Label/Code%20generation>. Quality packages on hackage for runtime code generation include harpy <https://hackage.haskell.org/package/harpy> and llvm-general <https://hackage.haskell.org/package/llvm-general>. - A redditor wonders whether 3 nested loops written as a list comprehension <https://www.reddit.com/r/haskell/comments/3zcjn7/optimizing_list_comprehens…> compiles into the tight machine code version of 3 nested loops. Conspicuously absent in the discussion is mention of the Vector package <https://hackage.haskell.org/package/vector> and Don Stewart's 2010 achievements of tight loop optimization <https://donsbot.wordpress.com/2010/02/21/smoking-fast-haskell-code-using-gh…> . *Quotes of the Week:* - ReinH: thanks puregreen for Lens over Tea series puregreen: is grinning all around ReinH: also thanks for not titling it "You could have written lens" johnw: <http://ircbrowse.net/day/haskell/today?id=22057773&timestamp=1451949277#t14…> ReinH, just skip to, "You could have been edwardk", it answer all other questions (Thanks to Gesh for the link.) - From HN: <https://news.ycombinator.com/item?id=10832576#up_10836690> One thing I've learned from using immutable, functional languages (Elixir) is: "Don't tell your computer what to do, tell it how to transform data." While it may seem obvious, it's been a revelation for me and it has totally transformed how I write code, and especially how I test it. - From HN: <https://news.ycombinator.com/item?id=10833240#up_10837893> FP people are nailing composability and reusability to never seen levels just in front of your eyes. You just have to keep them open to see. OOP did it at its time too, it just hit a ceiling; but there's one reason every imperative language is OOP nowadays. - From HN: <https://news.ycombinator.com/item?id=10850205#up_10855934> As someone who learned Haskell and subsequently have been writing a lot of Python, I keep a mental tally of how many of my bugs (some of which took ages to track down) would have been caught immediately by a type system like Haskell's or Idris'. I'd say it's well over half. - From HN: <https://news.ycombinator.com/item?id=10850205#up_10856141> Haskell syntax is the lingua franca when discussing anything related to data types and functional programming these days. *Videos of the Week:* - Watch LambdaConf 2015 <https://www.youtube.com/playlist?list=PLE7tQUdRKcybh21_zOg8_y4f2oMKDHpUS>, organized by John A. De Goes and professionally recorded by Confreaks <http://www.confreaks.com/>. Richard Eisenberg presented on "A practical Introduction to GADTs" <https://www.youtube.com/watch?v=6snteFntvjM>. The video recording gets love over at haskell reddit <https://www.reddit.com/r/haskell/comments/3yw2mg/lambdaconf_2015_videos/> and even a talk summary. -- Kim-Ee

1 0