August 2016 - Haskell

Announcing containers 0.5.8.1
by David Feuer 31 Aug '16

31 Aug '16

There's a lot to see in this one. There are plenty of brand-new functions in Data.Map, Data.Set, and Data.Sequence, including a highly-optimized lens-inspired map alteration function and a brand-new API for merging maps efficiently. Several key map, set, and sequence functions have sped up considerably. The full change log is below. I have tried to give appropriate credit to all the non-maintainers who contributed to this release, some of whom made very major contributions indeed. If I missed anyone, please give a shout. General package changes: Remove all attempts to support nhc98 and any versions of GHC before 7.0. Integrate benchmarks with Cabal. (Thanks, Gabriel Gonzalez!) Make Cabal report required extensions properly, and stop using default extensions. Note that we do not report extensions conditionally enabled based on GHC version, as doing so would lead to a maintenance nightmare with no obvious benefits. Use BangPatterns throughout to reduce noise. This extension is now required to compile containers. Improve QuickCheck properties taking arbitrary functions by using Test.QuickCheck.Function.Fun instead of evil Show instances for functions. Expose several internal modules through Cabal (as requested by Edward Kmett). These remain completely unsupported. New exports and instances: Add alterF, restrictKeys, and withoutKeys to Data.Map and Data.IntMap. Add take, drop, splitAt, takeWhileAntitone, dropWhileAntitone, and spanAntitone for Data.Map and Data.Set. Thanks to Cale Gibbard for suggesting these. Add merge, mergeA, and associated merge tactics for Data.Map. Many thanks to Cale Gibbard, Ryan Trinkle, and Dan Doel for inspiring the merge idea and helping refine the interface. Add fromDescList, fromDescListWith, fromDescListWithKey, and fromDistinctDescList to Data.Map. Add fromDescList and fromDistinctDescList to Data.Set. Add Empty, :<|, and :|> pattern synonyms for Data.Sequence, as originally envisioned in the finger tree paper by Paterson and Hinze. Add adjust', (!?), lookup, chunksOf, cycleTaking, insertAt, deleteAt, intersperse, foldMapWithIndex, and traverseWithIndex for Data.Sequence. Derive Generic and Generic1 for Data.Tree.Tree, Data.Sequence.ViewL, and Data.Sequence.ViewR. Add foldTree for Data.Tree. (Thanks, Daniel Wagner!) Semantic changes: Make Data.Sequence.splitAt strict in its arguments. Previously, it returned a lazy pair. Fix completely erroneous definition of length for Data.Sequence.ViewR. Make Data.Map.Strict.traverseWithKey force result values before installing them in the new map. Make Data.Tree.drawTree handle newlines better. (Thanks, recursion-ninja!) Deprecations: All functions in Data.Map proper that have been documented as deprecated since version 0.5 or before now have DEPRECATED pragmas and will actually be removed after another cycle or two. Tree printing functions in Data.Map intended for library debugging are now deprecated. They will continue to be available for the foreseeable future in an internal module. Performance changes: Substantially speed up splitAt, zipWith, take, drop, fromList, partition, foldl', and foldr' for Data.Sequence. Special thanks to Lennart Spitzner for digging into the performance problems with previous versions of fromList and finding a way to make it really fast. Slightly optimize replicateA. Stop traverse from performing many unnecessary fmap operations. Most operations in Data.Sequence advertised as taking logarithmic time (including >< and adjust) now use their full allotted time to avoid potentially building up chains of thunks in the tree. In general, the only remaining operations that avoid doing more than they really need are the particular bulk creation and transformation functions that really benefit from the extra laziness. There are some situations where this change may slow programs down, but I think having more predictable and usually better performance more than makes up for that. Add rewrite rules to fuse fmap with reverse for Data.Sequence. Switch from hedge algorithms to divide-and-conquer algorithms for union, intersection, difference, and merge in both Data.Map and Data.Set. These algorithms are simpler, are known to be asymptotically optimal, and are faster according to our benchmarks. Speed up adjust for Data.Map. Allow map to inline, and define a custom (<$). This considerably improves mapping with a constant function. Remove non-essential laziness throughout the Data.Map.Lazy implementation. Slightly speed up deletion and alteration functions for Data.IntMap.

2 1

I repeat my Question becaue I not really sure to do it right
by CCUTM＠web.de 28 Aug '16

28 Aug '16

2 3

Haskell positions at Facebook
by Simon Marlow 24 Aug '16

24 Aug '16

Want to write Haskell for a living? At Facebook we're looking for Spam Fighters. A large part of this job involves writing Haskell code to run on our Sigma/Haxl platform. It's a fascinating and exciting area to work in, using state of the art tools and systems, working with amazing people, and of course you get to write Haskell every day. Come and see what it's like to write Haskell code that runs at Facebook scale! Job description and application: https://www.facebook.com/careers/jobs/a0I1200000IA7KYEA1/ Note: this is for the Menlo Park (California, USA) office.

1 0

ETAPS 2017 2nd joint call for papers
by Tarmo Uustalu 22 Aug '16

22 Aug '16

****************************************************************** JOINT CALL FOR PAPERS 20th European Joint Conferences on Theory And Practice of Software ETAPS 2017 Uppsala, Sweden, 22-29 April 2017 http://www.etaps.org/2017 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of five main annual conferences, accompanied by satellite workshops. ETAPS 2017 is the twentieth event in the series. -- MAIN CONFERENCES (24-28 April) -- * ESOP: European Symposium on Programming (PC chair Hongseok Yang, University of Oxford, UK) * FASE: Fundamental Approaches to Software Engineering (PC chairs Marieke Huisman, Universiteit Twente, The Netherlands, and Julia Rubin, University of British Columbia, Canada) * FoSSaCS: Foundations of Software Science and Computation Structures (PC chairs Javier Esparza, Technische Universität München, Germany, Andrzej Murawski, University of Warwick, UK) * POST: Principles of Security and Trust (PC chairs Matteo Maffei, Universität des Saarlandes, Germany, Mark D. Ryan, University of Birmingham, UK) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs Axel Legay, INRIA Rennes, France, and Tiziana Margaria, LERO, Ireland) TACAS '17 hosts the 6th Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Michael Ernst (University of Washington, USA) Kim G. Larsen (Aalborg University, DK) * FoSSaCS invited speaker: Joel Ouaknine (University of Oxford, UK) * TACAS invited speaker: Dino Distefano (Facebook and Queen Mary University of London, UK) -- IMPORTANT DATES -- * Abstracts due (ESOP, FASE, FoSSaCS, TACAS): 14 October 2016 * Papers due: 21 October 2016 * Rebuttal (ESOP and FoSSaCS only): 7-9 December 2016 * Notification: 22 December 2016 * Camera-ready versions due: 20 January 2017 -- SUBMISSION INSTRUCTIONS -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. ESOP and FoSSaCS accept only research papers. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere (this does not apply to abstracts). In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's Lecture Notes in Computer Science series. Papers must follow the formatting guidelines specified by Springer at the URL http://www.springer.de/comp/lncs/authors.html and be submitted electronically in pdf through the EasyChair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. FASE will use a light-weight double-blind review process (see http://www.etaps.org/2017/fase) - Research papers FASE, FoSSaCS and TACAS have a page limit of 15 pp (excluding bibliography of max 2 pp) for research papers, whereas POST allows at most 20 pp (excluding bibliography of max 2 pp) and ESOP 25 pp (excluding bibliography of max 2 pp). Additional material intended for the referees but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices and papers must be understandable without them. In addition to regular research papers, TACAS solicits also case study papers (at most 15 pp, excluding bibliography of max 2 pp). Both TACAS and FASE solicit also regular tool papers (at most 15 pp, excluding bibliography of max 2 pp). The rationale of a separate page limit for the bibliography is to remove the possibility to win space for the body of a paper by cutting the bibliography, a practise that has a negative effect on our competitiveness as a community. - Tool demonstration papers Submissions should consist of two parts: * The first part, at most 4 pages, should describe the tool presented. Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool. (This part will be included in the proceedings.) * The second part, at most 6 pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated. ESOP and FoSSaCS do not accept tool demonstration papers. TACAS has a page limit of 6 pages for tool demonstrations. -- SATELLITE EVENTS (22-23 April, 29 April) -- Around 20 satellite workshops will take place before and after the main conferences: BX, CREST, DICE-FOPARA, FESCA, GALOP, GaM, HotSpot, LiVe, MARS, MBT, QAPL, SNR, SynCoP, VerifyThis, VPT. -- HOST CITY -- Uppsala city holds a rich history, having for long periods been the political, religious and academic centre of Sweden. Uppsala University is over 500 years old and ranked among the top 100 in the World and has hosted many great scientists over the years, for instance Carl von Linné, Anders Celsius and Anders Jonas Ångström. The proximity to the capital of Sweden, Stockholm, provides additional benefits as a potential site for arranging both pre- and post congress tours, as well as for excursions or tourism. -- HOST INSTITUTION -- ETAPS 2017 is hosted by the Department of Information Technology, Uppsala University. -- ORGANIZERS Parosh Abdulla (General chair), Mohamed Faouzi Atig, Andreina Francisco, Kaj Lampka, Philipp Rümmer, Konstantinos Sagonas, Björn Victor, Wang Yi, Tjark Weber, Yunyun Zhu -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at parosh.abdulla(a)it.uu.se, mohamed_faouzi.atig(a)it.uu.se

1 0

Postdoctoral position in programming languages at U Tuebingen
by Klaus Ostermann 19 Aug '16

19 Aug '16

I'm pleased to announce that we have an open position for a Postdoc in programming languages. The position is for up to 36 months and can start on January 1, 2017 or later. The position is part of the chair on programming languages and software technology in the department of computer science at the University of Tuebingen in Germany. The position is not bound to a particular project or research topic, hence it enables the Postdoc to build his or her own research field and lay the foundation for an academic or industrial research career. We have a generous budget for traveling and equipment and will provide the opportunity to participate in a range of research projects in our group. The Postdoc will have the opportunity to form his/her own research group and participate in the supervision of PhD students. Topics that are of particular interest for this position include: Probabilistic programming, type and module systems, domain-specific languages, programming language design, programming education, generative programming, programming techniques, programming and theorem proving. Applicants for the postdoctoral position should have a PhD (or be close to completion) in computer science, with a track record of high quality publications in programming languages. Fluency in German is not a requirement; the working language in our research group is English. More information about the research group can be found at: http://ps.informatik.uni-tuebingen.de Please send informal enquiries about the position via email to Klaus Ostermann http://ps.informatik.uni-tuebingen.de/team/ostermann/ -- Klaus

1 0

Last Call for Participation: LOPSTR 2016 - 26th Intl. Symp. on Logic-Based Program Synthesis and Transformation
by Pedro López García 15 Aug '16

15 Aug '16

============================================================ LAST CALL FOR PARTICIPATION: LOPSTR 2016 26th International Symposium on Logic-Based Program Synthesis and Transformation, Edinburgh, Scotland UK, September 6-8, 2016 http://www.cliplab.org/Conferences/LOPSTR16/ co-located with PPDP 2016 18th International Symposium on Principles and Practice of Declarative Programming, Edinburgh, Scotland UK, September 5-7, 2016 http://ppdp16.webs.upv.es/ and SAS 2016 23rd Static Analysis Symposium, Edinburgh, Scotland UK, September 8-10, 2016 http://staticanalysis.org/sas2016/ ============================================================ Registration is open at: http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/ ** EARLY REGISTRATION UNTIL AUGUST 15 ** VISA Please check here: https://www.gov.uk/check-uk-visa whether you require a visa to visit the UK. If so, contact us as soon as possible as explained here: http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/registration.html Getting a visa can take from 3-6 weeks depending on the nationality and country from which applying. We recommend that anyone considering attending who needs a visa register now and apply now. If you are eventually unable to attend due to visa issues we will refund your registration fee. INVITED TALKS - Greg Morrisett, Cornell University, USA (jointly with PPDP'16): Challenges in Compiling Coq. - Francesco Logozzo, Facebook, USA (jointly with PPDP'16): Abstract interpretation for taint analysis at scale. - Martin Vechev, ETH Zurich, Switzerland (jointly with SAS'16): Learning from Programs: Probabilistic Models, Program Analysis and Synthesis. ACCEPTED PAPERS - Symbolic Abstract Contract Synthesis in a Rewriting Framework. María Alpuente, Daniel Pardo and Alicia Villanueva. - Coinductive Soundness of Corecursive Type Class Resolution. Frantisek Farka, Ekaterina Komendantskaya, Kevin Hammond and Peng Fu. - MiniZinc with Strings. Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey and Guido Tack. - On the Completeness of Selective Unification in Concolic Testing of Logic Programs. Fred Mesnard, Etienne Payet and German Vidal. - Verification of Time-Aware Business Processes using Constrained Horn Clauses. Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi and Maurizio Proietti. - Tuning Fuzzy Logic Programs with Symbolic Execution. Gines Moreno, Jaime Penabad and German Vidal. - A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms. Paul Tarau. - A New Functional-Logic Compiler for Curry: Sprite. Sergio Antoy and Andy Jost. - Towards Reversible Computation in Erlang. Naoki Nishida, Adrian Palacios and German Vidal. - Slicing Concurrent Constraint Programs. Moreno Falaschi, Maurizio Gabbrielli, Carlos Olarte and Catuscia Palamidessi. - Scaling Bounded Model Checking By Transforming Programs With Arrays. Anushri Jana, Uday Khedker, Advaita Datar, R Venkatesh and Niyas C. - Hierarchical Shape Abstraction of Free-List Memory Allocators. Bin Fang and Mihaela Sighireanu. - A Productivity Checker for Logic Programming. Ekaterina Komendantskaya, Patricia Johann and Martin Möhrmann. - Automata Theory Approach to Predicate Intuitionistic Logic. Maciej Zielenkiewicz and Aleksy Schubert. - Nominal Unification of Higher Order Expressions with Recursive Let. Manfred Schmidt-Schauss, Temur Kutsia, Jordi Levy and Mateu Villaret. - A Formal, Resource Consumption-Preserving Translation of Actors to Haskell. Elvira Albert, Nikolaos Bezirgiannis, Frank De Boer and Enrique Martin-Martin. - Partial Evaluation of Order-sorted Equational Programs modulo Axioms. María Alpuente, Angel Cuenca, Santiago Escobar and Jose Meseguer. - lpopt: A Rule Optimization Tool for Answer Set Programming. Manuel Bichler, Michael Morak and Stefan Woltran. - CurryCheck: Checking Properties of Curry Programs. Michael Hanus. - Intuitionistic Logic Programming for SQL. Fernando Saenz-Perez. Hope to see you in Edinburgh! Manuel Hermengildo and Pedro Lopez-Garcia LOPSTR 2016 Co-chairs

1 0

Call for Participation: LOPSTR 2016 - 26th Intl. Symp. on Logic-Based Program Synthesis and Transformation
by pedro.lopez 09 Aug '16

09 Aug '16

============================================================ CALL FOR PARTICIPATION: LOPSTR 2016 26th International Symposium on Logic-Based Program Synthesis and Transformation, Edinburgh, Scotland UK, September 6-8, 2016 http://www.cliplab.org/Conferences/LOPSTR16/ co-located with PPDP 2016 18th International Symposium on Principles and Practice of Declarative Programming, Edinburgh, Scotland UK, September 5-7, 2016 http://ppdp16.webs.upv.es/ and SAS 2016 23rd Static Analysis Symposium, Edinburgh, Scotland UK, September 8-10, 2016 http://staticanalysis.org/sas2016/ ============================================================ Registration is open at: http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/ ** EARLY REGISTRATION UNTIL AUGUST 15 ** VISA Please check here: https://www.gov.uk/check-uk-visa whether you require a visa to visit the UK. If so, contact us as soon as possible as explained here: http://conferences.inf.ed.ac.uk/ppdp-lopstr-sas-2016/registration.html Getting a visa can take from 3-6 weeks depending on the nationality and country from which applying. We recommend that anyone considering attending who needs a visa register now and apply now. If you are eventually unable to attend due to visa issues we will refund your registration fee. INVITED TALKS - Greg Morrisett, Cornell University, USA (jointly with PPDP'16): Challenges in Compiling Coq. - Francesco Logozzo, Facebook, USA (jointly with PPDP'16): Abstract interpretation for taint analysis at scale. - Martin Vechev, ETH Zurich, Switzerland (jointly with SAS'16): Learning from Programs: Probabilistic Models, Program Analysis and Synthesis. ACCEPTED PAPERS - Symbolic Abstract Contract Synthesis in a Rewriting Framework. María Alpuente, Daniel Pardo and Alicia Villanueva. - Coinductive Soundness of Corecursive Type Class Resolution. Frantisek Farka, Ekaterina Komendantskaya, Kevin Hammond and Peng Fu. - MiniZinc with Strings. Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey and Guido Tack. - On the Completeness of Selective Unification in Concolic Testing of Logic Programs. Fred Mesnard, Etienne Payet and German Vidal. - Verification of Time-Aware Business Processes using Constrained Horn Clauses. Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi and Maurizio Proietti. - Tuning Fuzzy Logic Programs with Symbolic Execution. Gines Moreno, Jaime Penabad and German Vidal. - A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms. Paul Tarau. - A New Functional-Logic Compiler for Curry: Sprite. Sergio Antoy and Andy Jost. - Towards Reversible Computation in Erlang. Naoki Nishida, Adrian Palacios and German Vidal. - Slicing Concurrent Constraint Programs. Moreno Falaschi, Maurizio Gabbrielli, Carlos Olarte and Catuscia Palamidessi. - Scaling Bounded Model Checking By Transforming Programs With Arrays. Anushri Jana, Uday Khedker, Advaita Datar, R Venkatesh and Niyas C. - Hierarchical Shape Abstraction of Free-List Memory Allocators. Bin Fang and Mihaela Sighireanu. - A Productivity Checker for Logic Programming. Ekaterina Komendantskaya, Patricia Johann and Martin Möhrmann. - Automata Theory Approach to Predicate Intuitionistic Logic. Maciej Zielenkiewicz and Aleksy Schubert. - Nominal Unification of Higher Order Expressions with Recursive Let. Manfred Schmidt-Schauss, Temur Kutsia, Jordi Levy and Mateu Villaret. - A Formal, Resource Consumption-Preserving Translation of Actors to Haskell. Elvira Albert, Nikolaos Bezirgiannis, Frank De Boer and Enrique Martin-Martin. - Partial Evaluation of Order-sorted Equational Programs modulo Axioms. María Alpuente, Angel Cuenca, Santiago Escobar and Jose Meseguer. - lpopt: A Rule Optimization Tool for Answer Set Programming. Manuel Bichler, Michael Morak and Stefan Woltran. - CurryCheck: Checking Properties of Curry Programs. Michael Hanus. - Intuitionistic Logic for SQL. Fernando Saenz-Perez. Hope to see you in Edinburgh! Manuel Hermengildo and Pedro Lopez-Garcia LOPSTR 2016 Co-chairs

1 0

PhD position in computational music structure analysis using functional programming
by Wouter Swierstra 09 Aug '16

09 Aug '16

============================================================== VACANCY : PhD position in computational music structure analysis using functional programming ============================================================== The research group of Software Technology is part of the Software Systems division of in the department of Information and Computer Science at the Utrecht University. We focus our research on functional programming, compiler construction, program analysis, validation, and verification. We are currently advertising a PhD position, together with the Interaction Technology group, to explore the use of functional programming -- and data type generic programming in particular -- to describe and analyze musical structure. This project continues the line of research initiated by Bas de Haas and José Pedro Magalhães, that has lead to several successful publications and a flourishing start-up, Chordify. Besides research, the successful candidate will be expected to help supervise MSc students and assist teaching courses. Candidates must be willing to start before January 2017. --------------------------------- What we are looking for --------------------------------- The ideal candidate should have an MSc in Computer Science, be highly motivated, speak and write English well, and be proficient in producing scientific reports. Furthermore, candidates should be able to demonstrate * experience with functional programming languages, such as Haskell, OCaml, ML, Agda, Idris, or Coq; * an interest in music and musical theory. --------------------------------- What we offer --------------------------------- The candidate is offered a full-time position for four years. A part-time of at least 0.8 fte may also be possible. The salary is supplemented with a holiday bonus of 8% and an end-of-year bonus of 8,3% per year. In addition we offer: a pension scheme, partially paid parental leave, and flexible employment conditions. Conditions are based on the Collective Labour Agreement Dutch Universities. The research group will provide the candidate with necessary support on all aspects of the project. More information is available on the website: Terms and employment: http://bit.ly/1elqpM7 Utrecht is consistently ranked as one of the best places in the world to live: http://bbc.in/2aFS5n1 --------------------------------- In order to apply --------------------------------- To apply please attach a letter of motivation, a curriculum vitae, and (email) addresses of two referees. Make sure to also include a transcript of the courses you have followed (at bachelor and master level), with the grades you obtained, and to include a sample of your scientific writing, such as your master thesis. It is possible to apply for this position if you are close to obtaining your Master's. In that case include a letter of your supervisor with an estimate of your progress, and do not forget to include at least a sample of your technical writing skills. Application closes on September 7th. You can apply through the University's website: http://bit.ly/2abk3pe --------------- Contact --------------- For further information you can direct your inquiries to: Wouter Swierstra e-mail: w.s.swierstra(a)uu.nl. Anja Volk email: a.volk(a)uu.nl

1 0

Call for Participation: Functional Art, Music, Modelling and Design (September 24, Nara, Japan)
by Michael Sperber 07 Aug '16

07 Aug '16

4th ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design Nara, Japan September 24, 2016 (co-located with ICFP 2016) http://functional-art.org/2016 The ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design (FARM) gathers together people who are harnessing functional techniques in the pursuit of creativity and expression. Functional Programming has emerged as a mainstream software development paradigm, and its artistic and creative use is booming. A growing number of software toolkits, frameworks and environments for art, music and design now employ functional programming languages and techniques. FARM is a forum for exploration and critical evaluation of these developments, for example to consider potential benefits of greater consistency, tersity, and closer mapping to a problem domain. This year, authors at FARM will present research papers, demos of new tools, and calls for collaboration. The evening will also feature computer music performances of artists integrating functional programming techniques into their work. To register for FARM, visit the ICFP registration page - early registration ends August 17. Some funding support is available for the main ICFP conference and related workshops like FARM. This information can be found on the travel support page. Registration ------------ You can register via the ICFP 2016 registration: http://conf.researchr.org/attending/icfp-2016/Registration Early registration deadline is August 17. Program --------------- 9:15 - 10:15 Bithoven: Gödel Encoding of Chamber Music and Functional 8-Bit Audio Synthesis Jay McCarthy Structured reactive programming with polymorphic temporal tiles David Janin and Simon Archipoff 10:35-11:25 Juniper: A Functional Reactive Programming Language for the Arduino Caleb Helbling and Samuel Guyer Demo: Juniper: A Functional Reactive Programming Language for the Arduino Caleb Helbling and Samuel Guyer 11:45-12:35 Arrp: A Functional Language with Multi-dimensional Signals and Recurrence Equations Jakob Leben Demo: Klangmeister Chris Ford 14:00-14:50 o.OM: Structured-Functional Communication between Computer Music Systems using OSC and Odot Jean Bresson, John MacCallum and Adrian Freed Demo: VoxelCAD, a collaborative voxel-based CAD tool Csongor Kiss and Toby Shaw 16:20-16:10 Call for Collaboration: Algomusicology, ????, Profit Chris Ford Demo: Alda: A text-based music composition language Dave Yarwood 16:40-18:00 A Livecoding Semantics for Functional Reactive Programming Tom E. Murphy Demo: Epimorphism Francis Shuman Live Performances 19:30-21:30 @ Live House Beverly Hills, Nara, Japan Tentative lineup includes: - Akihiro Kubota: Live Coding Cosmic Sound Poetry - Selçuk Artut, Alp Tuğan: RAW - Atsuro Hoshino: Warm Fuzzy Thing - Alexandra Cárdenas (via remote streaming) - Renick Bell Workshop Organisation --------------------- - Workshop Chair: David Janin, University of Bordeaux - Program Chair: Mike Sperber, Active Group GmbH - Publicity Chair: Mark Santolucito, Yale - Performance Chair: Renick Bell Program Committee: --------------------- - Renick Bell (performance chair) - Rebecca Fiebrink, Goldsmiths University of London - David Janin, University of Bordeaux (co-chair) - Akihiro Kubota, Tama Art University - John Lato, Google - José Pedro Magalhães, Standard Chartered Bank and Chordify - Alex McLean, University of Leeds - Dan Piponi, Google - Prabhakar Ragde, University of Waterloo - Mark Santolucito, Yale (publicity chair) - Fabienne Serrière, KnitYak - Michael Sperber, Active Group GmbH (co-chair) - John Stell, University of Leeds

1 0

DSLDI 2016: Final Call for Talk Proposals (Extended Deadline)
by Eric Walkingshaw 05 Aug '16

05 Aug '16

********************************************************************* FINAL CALL FOR TALK PROPOSALS DSLDI 2016 Fourth Workshop on Domain-Specific Language Design and Implementation October 31, 2016 Amsterdam, Netherlands Co-located with SPLASH http://2016.splashcon.org/track/dsldi2016 https://twitter.com/wsdsldi ********************************************************************* Deadline for talk proposals: August 15, 2016 (extended!) *** Workshop Goal *** Well-designed and implemented domain-specific languages (DSLs) can achieve both usability and performance benefits over general-purpose programming languages. By raising the level of abstraction and exploiting domain knowledge, DSLs can make programming more accessible, increase programmer productivity, and support domain-specific optimizations. The goal of the DSLDI workshop is to bring together researchers and practitioners interested in discussing how DSLs should be designed, implemented, supported by tools, and applied in realistic contexts. The focus of the workshop is on all aspects of this process, from soliciting domain knowledge from experts, through the design and implementation of the language, to evaluating whether and how a DSL is successful. More generally, we are interested in continuing to build a community that can drive forward the development of modern DSLs. An additional goal of this year's workshop is to encourage discussion about the usability of DSLs, and to establish connections with researchers in related areas, such as end-user software engineering, who have studied human factors of programming languages and tools. *** Workshop Format *** DSLDI is a single-day workshop and will consist of moderated audience discussions structured around a series of talks. The role of the talks is to facilitate interesting and substantive discussion. Therefore, we welcome and encourage talks that express strong opinions, describe open problems, propose new research directions, and report on early research in progress. Proposed talks should be on topics within DSLDI's area of interest, which include but are not limited to: * solicitation and representation of domain knowledge * DSL design principles and processes * DSL implementation techniques and language workbenches * domain-specific optimizations * human factors of DSLs * tool support for DSL users * community and educational support for DSL users * applications of DSLs to existing and emerging domains * studies of usability, performance, or other benefits of DSLs * experience reports of DSLs deployed in practice *** Call for Submissions *** We solicit talk proposals in the form of short abstracts (max. 2 pages). A good talk proposal describes an interesting position, open problem, 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: August 15, 2016 * Notification: September 5, 2016 * Workshop: October 31, 2016 * Submission website: https://dsldi16.hotcrp.com/ *** Workshop Organization *** Organizers: * Eric Walkingshaw (Oregon State University) * Tijs van der Storm (CWI) Program committee: * Iman Avazpour (Deakin University) * Christopher Bogart (Carnegie Mellon University) * Andy Gill (University of Kansas) * Sylvia Grewe (TU Darmstadt) * Kate Howland (University of Sussex) * Lindsey Kuper (Intel Labs) * Darya Kurilova (Carnegie Mellon University) * Ralf Lämmel (University of Koblenz-Landau) * Tanja Mayerhofer (Vienna University of Technology) * Marjan Mernik (University of Maribor) * Sarah Mount (King's College London) * Justin Pombrio (Brown University) * Tillmann Rendel (University of Tübingen) * Tiark Rompf (Purdue & Oracle Labs) * Sonja Schimmler (Bundeswehr University Munich) * Markus Völter (itemis) * Peng Wu (Huawei America Lab)

1 0