March 2015 - Haskell - Haskell.org

Haskell.org Committee Financial Statement 2014
by Gershom B 08 Mar '15

08 Mar '15

Dear Haskellers, The Haskell.org Committee [1] manages funds for haskell.org and oversees haskell.org infrastructure. The funds available to Haskell.org generally come from two sources: 1) Mentor payments from the Google Summer of Code program. 2) Since the end of 2013, occasional donations [2] from the Haskell community at large. Our funds are held by Software in the Public Interest, a 501(c)3 US non-profit, through which we also accept donations. In return for its services, SPI receives 5% of donations to Haskell.org. According to our charter, "Each year, the committee will post a statement of the haskell.org assets, and the transactions for that year.” We apologize for having been delinquent in this regard. Included in this message is a brief statement of Haskell.org assets over the period 31 December 2013 - 31 December 2014, as well as an approximate breakdown of expenses. The statements we receive from the SPI are not in the most usable format [3], and we hope to provide more accurate accounting in the future. Note that this statement does not reflect 2014 GSoC income, as that had not posted as of 31 December 2014. Thus the fact that we are in the black this year is entirely due to your generous donations. Thank you all so much! 1. Income and Expenses Total income over 2014: 5,187.00 Total expenses over 2014: 2,523.22 ---- Net income over 2014: 2,663.78 2. Expense breakdown Approximate monthly hosting fees (Hetzner): 160.00 Total approximate hosting fees: 1920.00 Other approximate expenses: 603.22 (Other expenses consist of A] payment processing fees for received funds and B] the 5% of donated funds transferred to the SPI). 3. Total Balance Balance as of 31 December 2013: 23,759.13 Balance as of 31 December 2014: 26,422.91 [1] https://wiki.haskell.org/Haskell.org_committee [2] https://wiki.haskell.org/Donate_to_Haskell.org [3] Those wishing to examine further for themselves can find the reports posted to the spi-general list: http://lists.spi-inc.org/pipermail/spi-general/ Best, Gershom Bazerman for the Haskell.org Committee

1 0

APLAS 2015: Call for Papers
by Xinyu Feng 05 Mar '15

05 Mar '15

********************************************************************* APLAS 2015, Call for Papers 13th Asian Symposium on Programming Languages and Systems Pohang, Korea, November 30 - December 2, 2015 < http://pl.postech.ac.kr/aplas2015/> ********************************************************************* *IMPORTANT DATES* Submission deadline: June 5, 2015 Author notification: August 17, 2015 Conference: November 30 - December 2, 2015 *INVITED SPEAKERS* Peter O'Hearn, Facebook Sukyoung Ryu, KAIST Eran Yahav, Technion Hongseok Yang, University of Oxford *ABOUT* APLAS aims to stimulate programming language research by providing a forum for the presentation of latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS), founded by Asian researchers in cooperation with many researchers from Europe and the USA. Past APLAS symposiums were successfully held in Singapore ('14), Melbourne ('13), Kyoto ('12), Kenting ('11), Shanghai ('10), Seoul ('09), Bangalore ('08), Singapore ('07), Sydney ('06), Tsukuba ('05), Taipei ('04) and Beijing ('03) after three informal workshops. Proceedings of the past symposiums were published in Springer's LNCS. *TOPICS* The symposium is devoted to foundational and practical issues in programming languages and systems. Papers are solicited on topics such as * semantics, logics, foundational theory * design of languages, type systems and foundational calculi * domain-specific languages * compilers, interpreters, abstract machines * program derivation, synthesis and transformation * program analysis, verification, model-checking * logic, constraint, probabilistic and quantum programming * software security * concurrency and parallelism * tools and environments for programming and implementation Topics are not limited to those discussed in previous symposiums. Papers identifying future directions of programming and those addressing the rapid changes of the underlying computing platforms are especially welcome. Demonstration of systems and tools in the scope of APLAS are welcome to the System and Tool presentations category. Authors concerned about the appropriateness of a topic are welcome to consult with program chair prior to submission. *SUBMISSION* We solicit submissions in two categories: a) Regular research papers - describing original scientific research results, including tool development and case studies. Regular research papers should not exceed 18 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as an appendix or a link to a web page, but reviewers are not obliged to read them. b) System and tool presentations - describing systems or tools that support theory, program construction, reasoning, or program execution in the scope of APLAS. System and Tool presentations are expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the described systems or tools. It is highly desirable that the tools are available on the web. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings will be published as a volume in Springer's LNCS series. Accepted papers must be presented at the conference. *ORGANIZERS* General Chair: Sungwoo Park (Pohang Univ. of Science and Technology (POSTECH), Korea) Program Chair: Xinyu Feng (Univ. of Science and Technology of China, China) Program Committee: James Brotherston (Univ. College London, UK) James Cheney (Univ. of Edinburgh, UK) Huimin Cui (Institute of Computing Technology, CAS, China) Mike Dodds (Univ. of York, UK) Xinyu Feng (Univ. of Science and Technology of China, China) Nate Foster (Cornell Univ., USA) Alexey Gotsman (IMDEA Software Institute, Spain) Aquinas Hobor (School of Computing, National Univ. of Singapore / Yale-NUS College) Chung-Kil Hur (Seoul National Univ., Korea) Radha Jagadeesan (DePaul Univ., USA) Annie Liu (Stony Brook Univ., USA) Andreas Lochbihler (ETH Zurich, Switzerland) Santosh Nagarakatte (Rutgers Univ., USA) David A. Naumann (Stevens Inst. of Tech., USA) Michael Norrish (NICTA, Australia) Hakjoo Oh (Seoul National Univ., Korea) Murali Krishna Ramanathan (Indian Institute of Science, India) Xavier Rival (CNRS / ENS / INRIA, France) Kohei Suenaga (Kyoto Univ., Japan) Gang Tan (Lehigh Univ., USA) Alwen Tiu (Nanyang Technological University, Singapore) Martin Vechev (ETH Zurich, Switzerland) Bow-Yaw Wang (Academia Sinica, Taiwan) Nobuko Yoshida (Imperial College London, UK) Lijun Zhang (Institute of Software, CAS, China)

1 0

CFP: Workshop on Generic Programming 2015 - Deadline May 15
by Sebastian Erdweg 05 Mar '15

05 Mar '15

====================================================================== CALL FOR PAPERS WGP 2015 11th ACM SIGPLAN Workshop on Generic Programming Vancouver, Canada Sunday, August 30, 2015 http://www.wgp-sigplan.org/2015 Co-located with the International Conference on Functional Programming (ICFP 2015) ====================================================================== Goals of the workshop --------------------- Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * generic programming, * programming with (C++) concepts, * meta-programming, * programming with type classes, * programming with modules, * programming with dependent types, * type systems for generic programming, * polytypic programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * implementation of generic programming languages, * static and dynamic analyses of generic programs, * and so on. Program Committee ----------------- * Patrick Bahr (co-chair), University of Copenhagen * Sebastian Erdweg (co-chair), Technical University of Darmstadt * Edwin Brady, University of St Andrews * Edsko de Vries, Well-Typed LLP * Mauro Jaskelioff, National University of Rosario * Johan Jeuring, Utrecht University * Pieter Koopman, Radboud University Nijmegen * Bruno C. d. S. Oliveira, University of Hong Kong * Nicolas Pouillard, IT University of Copenhagen * Sukyoung Ryu, Korea Advanced Institute of Science and Technology * Sibylle Schupp, Hamburg University of Technology * Sam Tobin-Hochstadt, Indiana University Proceedings and Copyright ------------------------- We plan to have formal proceedings, published by the ACM. Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance (http://authors.acm.org/main.html) but may retain copyright if they wish. Authors are encouraged to publish auxiliary material with their paper (source code, test data, and so forth). The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. Submission details ------------------ * Submission deadline: Fri, 15th May 2015 * Author notification: Fri, 26th June 2015 * Final version due: Sun, 19th July 2015 * Workshop: Sun, 30th August 2015 Submitted papers should fall into one of two categories: * Regular research papers (12 pages) * Short papers: case studies, tool demos, generic pearls (6 pages) Regular research papers are expected to present novel and interesting research results. Short papers need not present novel or fully polished results. Good candidates for short papers are those that report on interesting case studies of generic programming in open source or industry, present demos of generic programming tools or libraries, or discuss elegant and illustrative uses of generic programming ('pearls'). All submissions should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (two-column, 9pt). Regular research papers must not exceed 12 pages. Short papers must not exceed 6 pages. If applicable, papers should be marked with one of the labels 'case study, 'tool demo' or 'generic pearl' in the title at the time of submission. Papers should be submitted via HotCRP at https://icfp-wgp15.hotcrp.com/ Travel Support -------------- Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC program, see its web page (http://www.sigplan.org/PAC.htm) History of the Workshop on Generic Programming ---------------------------------------------- Earlier Workshops on Generic Programming have been held in * Gothenburg, Sweden 2014 (affiliated with ICFP), * Boston, Massachusetts, US 2013 (affiliated with ICFP), * Copenhagen, Denmark 2012 (affiliated with ICFP), * Tokyo, Japan 2011 (affiliated with ICFP), * Baltimore, Maryland, US 2010 (affiliated with ICFP), * Edinburgh, UK 2009 (affiliated with ICFP), * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop). There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). WGP Steering Committee ---------------------- * Andres Löh * Ronald Garcia * Jacques Carette * Jeremiah Willcock * José Pedro Magalhães * Tiark Rompf * Tarmo Uustalo * Stephanie Weirich * Fritz Henglein

1 0

[TFPIE 2015] 2nd call for papers
by Peter Achten 05 Mar '15

05 Mar '15

Trends in Functional Programming in Education (TFPIE 2015) 2nd Call for papers https://wiki.science.ru.nl/tfpie/TFPIE2015 The 4th International Workshop on Trends in Functional Programming in Education, TFPIE 2015, will be held on June 2, 2015 in Sophia-Antipolis in France. It is co-located with the Symposium on Trends in Functional Programming (TFP 2015) which takes place from June 3 - 5. *** Goal *** The goal of TFPIE is to gather researchers, teachers and professionals that use, or are interested in the use of, functional programming in education. TFPIE aims to be a venue where novel ideas, classroom-tested ideas and work-in-progress on the use of functional programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. The program chair of TFPIE 2015 will screen submissions to ensure that all presentations are within scope and are of interest to participants. Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 16 pages) in EPTCS style. The authors of accepted presentations will have their preprints and their slides made available on the workshop's website/wiki. Visitors to the TFPIE 2015 website/wiki will be able to add comments. This includes presenters who may respond to comments and questions as well as provide pointers to improvements and follow-up work. After the workshop, presenters will be invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the journal Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. TFPIE workshops have previously been held in St Andrews, Scotland (2012), Provo Utah, USA (2013), and Soesterberg, The Netherlands (2014). *** Program Committee *** Peter Achten, Radboud University Nijmegen, The Netherlands Edwin Brady, University of St Andrews, UK Johan Jeuring, Utrecht University and Open University, The Netherlands (Chair) Shriram Krishnamurthi, Brown University, US Rita Loogen, Philipps-Universität Marburg, Germany Marco Morazan, Seton Hall University, US Norman Ramsey, Tufts University, US *** Submission Guidelines *** TFPIE 2015 welcomes submissions describing techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: - FP and beginning CS students - FP and Computational Thinking - FP and Artificial Intelligence - FP in Robotics - FP and Music - Advanced FP for undergraduates - Tools supporting learning FP - FP in graduate education - Engaging students in research using FP - FP in Programming Languages - FP in the high school curriculum - FP as a stepping stone to other CS topics - FP and Philosophy *** Best Lectures *** In addition to papers, we request “best lecture” presentations. What is your best lecture topic in an FP related course? Do you have a fun way to present FP concepts to novices or perhaps an especially interesting presentation of a difficult topic? In either case, please consider sharing it. Best lecture topics will be selected for presentation based on a short abstract describing the lecture and its interest to TFPIE attendees. *** Submission *** Papers and abstracts can be submitted via easychair at the following link: https://easychair.org/conferences/?conf=tfpie2015 It is expected at at least one author for each submitted paper will attend the workshop. *** Important Dates *** April 7, 2015: Early Registration for TFP closes April 27, 2015: Submission deadline for draft TFPIE papers and abstracts May 3 2015: Notification of acceptance for presentation ?? (Probably May 22 2015): Registration for TFPIE closes - as does late registration for TFP June 2, 2015: Presentations in Sophia-Antipolis, France July 7, 2015: Full papers for EPTCS proceedings due. September 1, 2015: Notification of acceptance for proceedings September 22, 2015: Camera ready copy due for EPTCS Submission of an abstract implies no obligation to submit a full version; abstracts with no corresponding full versions by the full paper deadline will be considered as withdrawn.

1 0

Haskell Weekly News
by Kim-Ee Yeoh 04 Mar '15

04 Mar '15

*Top picks:* Jasper Van der Jeugt <http://jaspervdj.be/posts/2015-02-24-lru-cache.html> shows how you can write an intuitive, obviously correct LRU cache perfectly polymorphic in both the key and value types of the cache lookup function. (Reddit discussion.) <http://www.reddit.com/r/haskell/comments/2wz4tj/writing_an_lru_cache_in_has…> Core is broken! Well, no, ticket 9858 <https://ghc.haskell.org/trac/ghc/ticket/9858> reported previously is still open, and it's about translating an exotic species of Haskell into Core. But Javran Cheng <https://ghc.haskell.org/trac/ghc/ticket/10121> found out that the documented specification of Core's operational semantics is incomplete. Neil Mitchell <http://neilmitchell.blogspot.com/2015/02/making-withsocketsdo-unnecessary.h…> removes the error-prone wart of withSocketsDo <http://hackage.haskell.org/package/network-2.6.0.2/docs/Network.html#v:with…> in Windows network programming. Moving in for the kill is the triple combo of evaluate, NOINLINE, and unsafePerformIO. (Reddit discussion.) <http://www.reddit.com/r/haskell/comments/2x7js6/making_withsocketsdo_unnece…> Can you write a sorting algorithm? Can you write a fancy sorting algorithm? Can you write a sorting algorithm so fancy it hides a subtle bug? Can you write a sorting algorithm so fancy that it hides a bug so subtle <https://github.com/timjb/haskell-timsort/commit/d9c3e1e454c7d338320f8c2aa12…> that it evades even QuickCheck because the smallest testcase is 2^49 big? But the good news is that QuickCheck doesn't see any regression in the bugfix. (Hacker News discussion.) <https://news.ycombinator.com/item?id=9100107#up_9112425> The consequence of misspelling pragmas <https://ghc.haskell.org/trac/ghc/ticket/10106>, Or: when stumped on a compile error, turn on -Werror to see if you aren't missing something obvious. *Quote of the week:*garry__cairns <https://twitter.com/garry__cairns/status/571087073739976704>: The trouble with learning #haskell is the more I expose myself to it the more I dislike what I have to work with to pay the bills. *Repo of the week: *Kalium <https://github.com/int-index/kalium>: Turn Pascal <https://int-index.github.io/kalium/examples.html> into Haskell -- Kim-Ee

1 0

Haskell 2015: 2nd Call for Papers
by Ben Lippmeier 04 Mar '15

04 Mar '15

===================================================================== ACM SIGPLAN CALL FOR SUBMISSIONS Haskell Symposium 2015 Vancouver, Canada, 3-4 September 2015, directly after ICFP http://www.haskell.org/haskell-symposium/2015 ===================================================================== ** The Haskell Symposium has an early track this year ** ** See the Submission Timetable for details. ** The ACM SIGPLAN Haskell Symposium 2015 will be co-located with the International Conference on Functional Programming (ICFP 2015) in Vancouver, Canada. The Haskell Symposium aims to present original research on Haskell, discuss practical experience and future development of the language, and to promote other forms of denotative programming. Topics of interest include: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal semantics of the present language or future extensions, type systems, effects, metatheory, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management, as well as foreign function and component interfaces; * Libraries, that demonstrate new ideas or techniques for functional programming in Haskell; * Tools, such as profilers, tracers, debuggers, preprocessors, and testing tools; * Applications, to scientific and symbolic computing, databases, multimedia, telecommunication, the web, and so forth; * Functional Pearls, being elegant and instructive programming examples; * Experience Reports, to document general practice and experience in education, industry, or other contexts. Papers in the latter three categories need not necessarily report original academic research results. For example, they may instead report reusable programming idioms, elegant ways to approach a problem, or practical experience that will be useful to other users, implementors, or researchers. The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a standard solution to a standard programming problem, or report on experience where you used Haskell in the standard way and achieved the result you were expecting. More advice is available via the Haskell wiki: (http://wiki.haskell.org/HaskellSymposium/ExperienceReports) Regular papers should explain their research contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and relating it to previous work, and to other languages where appropriate. In addition, we solicit proposals for: * System Demonstrations, based on running software rather than novel research results. These proposals should summarize the system capabilities that would be demonstrated. The proposals will be judged on whether the ensuing session is likely to be important and interesting to the Haskell community at large, whether on grounds academic or industrial, theoretical or practical, technical, social or artistic. Please contact the program chair with any questions about the relevance of a proposal. Travel Support: =============== Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC program, see its web page (http://pac.sigplan.org) Proceedings: ============ Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance (http://authors.acm.org/main.html) Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. Accepted proposals for system demonstrations will be posted on the symposium website, but not formally published in the proceedings. All accepted papers and proposals will be posted on the conference website one week before the meeting. Publication date: The official publication date of accepted papers is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. Submission Details: =================== Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm) The text should be in a 9-point font in two columns. The length is restricted to 12 pages, except for "Experience Report" papers, which are restricted to 6 pages. Papers need not fill the page limit -- for example, a Functional Pearl may be much shorter than 12 pages. Each paper submission must adhere to SIGPLAN's republication policy, as explained on the web. Demo proposals are limited to 2-page abstracts, in the same ACM format as papers. "Functional Pearls", "Experience Reports", and "Demo Proposals" should be marked as such with those words in the title at time of submission. The paper submission deadline and length limitations are firm. There will be no extensions, and papers violating the length limitations will be summarily rejected. A link to the paper submission system will appear on the Haskell Symposium web site closer to the submission deadline. Submission Timetable: ===================== Early Track Regular Track System Demos ---------------- ------------------- --------------- 13th March Paper Submission 1st May Notification 19th May Abstract Submission 22nd May Paper Submission 5th June Resubmission Demo Submission 26th June Notification Notification Notification 19th July Final papers due Final papers due Deadlines stated are valid anywhere on earth. In this iteration of the Haskell Symposium we are trialling a two-track submission process, so that some papers can gain early feedback. Papers can be submitted to the early track on 13th March. On 1st May, strong papers are accepted outright, and the others will be given their reviews and invited to resubmit. On 5th June early track papers may be resubmitted, and are sent back to the same reviewers. The Haskell Symposium regular track operates as in previous years. Papers accepted via the early and regular tracks are considered of equal value and will not be distinguished in the proceedings. Although all papers may be submitted to the early track, authors of functional pearls and experience reports are particularly encouraged to use this mechanism. The success of these papers depends heavily on the way they are presented, and submitting early will give the program committee a chance to provide feedback and help draw out the key ideas. Program Committee: =================== Mathieu Boespflug - Tweag I/O Edwin Brady - University of St Andrews Atze Dijkstra - Utrecht University Tom DuBuisson - Galois Torsten Grust - University of Tuebingen Patrik Jansson - Chalmers University of Technology Patricia Johann - Appalachian State University Oleg Kiselyov - Tohoku University Edward Kmett - McGraw Hill Financial Neelakantan Krishnaswami - University of Birmingham Ben Lippmeier (chair) - Vertigo Technology Hai (Paul) Liu - Intel Labs Garrett Morris - University of Edinburgh Dominic Orchard - Imperial College London Matt Roberts - Macquarie University Tim Sheard - Portland State University Joel Svensson - Indiana University Edsko de Vries - Well Typed =====================================================================

1 0

Constraint Satisfaction Problem
by K Sai Anirudh 04 Mar '15

04 Mar '15

Hello, I tried to solve simple constraint satisfaction problem. This is my code " http://pastebin.com/VAaRYSEA " . This gives solution for present list of domains, but when I change the domain of 'd' in the list 'ld' then I get error. I think the error is in line 52. I indexed the first value, but I tried filtering the results where all the variables are assigned and I get error. Thanks for any help Sai

2 1

DSLDI: 3rd Workshop on Domain-Specific Language Design and Implementation
by Tijs van der Storm 03 Mar '15

03 Mar '15

********************************************************************* FIRST CALL FOR TALK PROPOSALS DSLDI 2015 Third Workshop on Domain-Specific Language Design and Implementation July 7, 2015 Prague, Czech Republic Co-located with ECOOP http://2015.ecoop.org/track/dsldi-2015-papers ********************************************************************* Deadline for talk proposals: 2nd of April, 2015 If designed and implemented well, domain-specific languages (DSLs) combine the best features of general-purpose programming languages (e.g., performance) with high productivity (e.g., ease of programming). *** Workshop Goal *** The goal of the DSLDI workshop is to bring together researchers and practitioners interested in sharing ideas on how DSLs should be designed, implemented, supported by tools, and applied in realistic application contexts. We are both interested in discovering how already known domains such as graph processing or machine learning can be best supported by DSLs, but also in exploring new domains that could be targeted by DSLs. More generally, we are interested in building a community that can drive forward the development of modern DSLs. *** Workshop Format *** DSLDI is a single-day workshop and will consist of a series of short talks whose main goal is to trigger exchange of opinion and discussions. The talks should be on the topics within DSLDI's area of interest, which include but are not limited to the following ones: * DSL implementation techniques, including compiler-level and runtime-level solutions * utilization of domain knowledge for driving optimizations of DSL implementations * utilizing DSLs for managing parallelism and hardware heterogeneity * DSL performance and scalability studies * DSL tools, such as DSL editors and editor plugins, debuggers, refactoring tools, etc. * applications of DSLs to existing as well as emerging domains, for example graph processing, image processing, machine learning, analytics, robotics, etc. * practitioners reports, for example descriptions of DSL deployment i a real-life production setting *** Call for Submissions *** We solicit talk proposals in the form of short abstracts (max. 2 pages). A good talk proposal describes an interesting position, demonstration, or early achievement. The submissions will be reviewed on relevance and clarity, and used to plan the mostly interactive sessions of the workshop day. Publication of accepted abstracts and slides on the website is voluntary. * Deadline for talk proposals: April 2nd, 2015 * Notification: May 1st, 2015 * Workshop: July 7th, 2015 * Submission website: https://easychair.org/conferences/?conf=dsldi2015 *** Workshop Organization *** Organizers * Tijs van der Storm (storm(a)cwi.nl) CWI, The Netherlands * Sebastian Erdweg (erdweg(a)informatik.tu-darmstadt.de) TU Darmstadt, Germany Follow us on Twitter at https://twitter.com/wsdsldi Program committee * Emilie Balland * Martin Bravenboer (LogicBlox) * Hassan Chafi (Oracle Labs) * William Cook (UT Austin) * Shriram Krishnamurthi (Brown University) * Heather Miller (EPFL) * Bruno Oliveira (University of Hong Kong) * Cyrus Omar (CMU) * Richard Paige (University of York) * Tony Sloane (Macquarie University) * Emma Söderberg (Google) * Emma Tosch (University of Massachusetts, Amherst) * Jurgen Vinju (CWI) -- Researcher Centrum Wiskunde & Informatica (CWI) Master of Software Engineering Universiteit van Amsterdam (UvA) Dr. Tijs van der Storm @ Centrum Wiskunde & Informatica (CWI) Office: L225 | Phone: +31 (0)20 5924164 | Address: Science Park 123 P.O. Box 94079 | Postal code: 1090 GB | Amsterdam, The Netherlands

1 0