- Haskell - Haskell.org

SPLASH'16 Amsterdam: Call For Participation
by Tijs van der Storm 12 Sep '16

12 Sep '16

################################################# ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'16) ################################################# Amsterdam, The Netherlands Sun 30th October - Fri 4th November , 2016 http://2016.splashcon.org https://twitter.com/splashcon https://www.facebook.com/SPLASHCon/ ** REGISTRATION ** 30 September 2016 (Early Deadline) Contact: info(a)splashcon.org http://2016.splashcon.org/attending/registration # What's happening at SPLASH? ## Keynotes - Benjamin Pierce (SPLASH) The Science of Deep Specification - Andy Ko (SPLASH) A Human View of Programming Languages - Martin Odersky (SPLASH) - Guy Steele Jr. (SPLASH-I) - Robby Findler (SLE) Redex: Lightweight Semantics Engineering - Tiark Rompf (GPCE) Lightweight Modular Staging: Generate all the things! - Simon Peyton Jones (SPLASH-I/E) The dream of a lifetime: shaping how our children learn computing - Laurence Tratt (Scala) ## Workshop Keynotes - Andrew Black (NOOL) - Alan Blackwell (PLATEAU) - Alastair Donald (WODA) - Sam Guyer (WODA) - Felienne Hermans (DSLDI) - Ben Liblit (WODA) - Benjamin Livshits (WODA) - Ivano Malavolta (Mobile!) - Yannis Smaragdakis (WODA) - Frank Tip (WODA) - Markus Voelter (ITSLE) ** Conference Program ** http://2016.splashcon.org/program/program-splash2015 ** SPLASH-I Track ** SPLASH-I is a series of invited and solicited talks that address topics relevant to the SPLASH community. Speakers are world-class experts in their field, selected and invited by the organizers. The SPLASH-I talks series is held in parallel with the rest of SPLASH during the week days. Talks are open to all attendees. A selection of confirmed talks: - Edwin Brady Type-driven Development in Idris - Jürgen Cito Using Docker Containers to Improve Reproducibility in PL/SE Research - Yvonne Coady Exploratory Analysis in Virtual Reality: The New Frontier - Adam Chlipala Rapid Development of Web Applications with Typed Metaprogramming in Ur/Web - Tudo Girba Software Environmentalism - Brian Harvey Snap! Scheme Disguised as Scratch - Lennart Kats Responsive Language Tooling For Cloud-based IDEs - Ralf Laemmel The basic skill set of software language engineering - Crista Lopes Simulating Cities: The Spacetime Framework - Heather Miller Language Support for Distributed Systems - Mark Miller & Bill Tulloh The elements of decision alignment: Large programs as complex organizations - Boaz Rosenan & David Lorenz Define Your App, Don’t Implement It: Building a Scalable Social Network in 45 minutes - Emmanuel Schanzer Bootstrap - Chris Seaton Truffle and Graal: Fast Programming Languages With Modest Effort - Emma Söderbergh From Tricorder to Tricium: Useful Static Analysis and the Importance of Workflow Integration - Emma Tosch Designing and Debugging Surveys with SurveyMan - Todd Veldhuizen Fast Datalog - Markus Völter How Domain Requirements Shape Languages - Jos Warmer Making Mendix Meta Model Driven - Andy Zaidman Fact or fiction? What software analytics can do for us (developers and researchers) More information here: http://2016.splashcon.org/track/splash2016-splash-i ** Research tracks - OOPSLA http://2016.splashcon.org/track/splash-2016-oopsla#event-overview - Onward! http://2016.onward-conference.org/track/onward-2016-papers#event-overview - Onward! Essays http://2016.onward-conference.org/track/onward2016-essays#program - Software Language Engineering (SLE) http://conf.researchr.org/track/sle-2016/sle-2016-papers#event-overview - Generative Programming: Concepts & Experiences (GPCE) http://conf.researchr.org/track/gpce-2016/gpce-2016-papers#event-overview - Dynamic Languages Symposium (DLS) http://conf.researchr.org/track/dls-2016/dls-2016-papers#event-overview - Scala Symposium http://conf.researchr.org/track/scala-2016/scala-2016#event-overview ** Other Events - Doctoral Symposium http://2016.splashcon.org/track/splash-2016-ds#event-overview - Programming Language Mentoring Workshop (PLMW) http://2016.splashcon.org/track/splash-2016-plmw - Student Research Competition (SRC) http://2016.splashcon.org/track/splash-2016-src - Posters http://2016.splashcon.org/track/splash-2016-posters#event-overview ** Workshops SPLASH'16 is hosting a record number of 15 workshops: - AGERE! Programming based on Actors, Agents, and Decentralized Control http://2016.splashcon.org/track/agere2016 - DSLDI: Domain-Specific Language Design and Implementation http://2016.splashcon.org/track/dsldi2016 - DSM: Domain-Specific Modeling http://2016.splashcon.org/track/dsm2016 - FOSD: Feature-oriented Software Development http://www.fosd.net/workshop2016 - ITSLE: Industry Track Software Language Engineering http://2016.splashcon.org/track/itsle2016 - LWC@SLE: Language Workbench Challenge http://2016.splashcon.org/track/lwc2016 - META http://2016.splashcon.org/track/meta2016 - Mobile! http://2016.splashcon.org/track/mobile2016 - NOOL: New Object-Oriented Languages http://2016.splashcon.org/track/nool2016 - PLATEAU: Evaluation and Usability of Programming Languages and Tools http://2016.splashcon.org/track/plateau2016 - Parsing@SLE http://2016.splashcon.org/track/parsing2016 - REBLS: Reactive and Event-based Languages & Systems http://2016.splashcon.org/track/rebls2016 - SA-MDE: Tutorial on MDD with Model Catalogue and Semantic Booster http://2016.splashcon.org/track/samde2016 - SEPS: Software Engineering for Parallel Systems http://2016.splashcon.org/track/seps2016 - VMIL: Virtual Machines and Intermediate Languages http://2016.splashcon.org/track/vmil2016 - WODA: Workshop on Dynamic Analysis http://2016.splashcon.org/track/woda2016 ## SPLASH'16 is kindly supported by the following organizations: - ACM: http://www.acm.org/ - SIGPLAN: http://www.sigplan.org/ - LogicBlox (Gold): http://www.logicblox.com/ - Oracle (Silver): http://www.oracle.com/index.html - TU Delft (Silver): http://tudelft.nl/ - Huawei (Bronze): http://www.huawei.com/en/ - Facebook (Bronze): https://research.facebook.com/ - IBM Research (Bronze): http://www.research.ibm.com/ - Google (Bronze): https://www.google.com - Itemis (Bronze): https://www.itemis.com/en/ - ING (Bronze): https://www.ing.nl Interested in supporting SPLASH'16? See our options here: http://2016.splashcon.org/attending/support-program.

1 0

Haskell eXchange and related events -- Call for Participation
by Andres Löh 09 Sep '16

09 Sep '16

Hi everyone. As Tom Ellis has correctly pointed out in another thread, I should have announced the Haskell eXchange on this list. Let me do that now: ===================================================================== Haskell eXchange 2016 London, 6-7 October 2016 ===================================================================== The Haskell eXchange is a general Haskell conference aimed at Haskell enthusiasts of all skill levels. The Haskell eXchange is organized annually, and 2016 is its fifth year. For the second year in a row, the venue will be Skills Matter’s CodeNode, where we have space for three parallel tracks. New this year: a large number of beginner-focused talks. At all times, at least one track will be available with a talk aimed at (relative) newcomers to Haskell. Of course, there are also plenty of talks on more advanced topics. Keynote speakers: Don Stewart, Conor McBride, Graham Hutton, Simon Peyton Jones Talks and workshops (some changes may still occur) by: Julian Arni, Christiaan Baaij, Thomas van Binsbergen, Mathieu Boespflug, Lars Brünjes, Ben Clifford, Philip Cunningham, Tom Ellis, Matthias Fischmann, Oleg Grenrus, Nickolay Kudasov, Robert Henderson, Csaba Hruska, Robin Kay, Csongor Kiss, Steven Kutsch, Kris Jenkins, David Luposchainsky, Neil Mitchell, Andrey Mokhov, Romeo Moura, Jann Müller, Boldizsár Németh, Andor Penzes, Ivan Perez, Michał Płachta, Nicolas Pouillard, Arian van Putten, Andrzej Rybczak, Jeremy Singer, Nicolas Wu Homepage and registration: https://skillsmatter.com/conferences/7276-haskell-exchange-2016 If you're interested in the Haskell eXchange, you might also be interested in the Haskell eXchange Haskell Hackathon and/or in the Haskell courses (2-day introductory, 1-day on types, 2-day on performance) offered by Well-Typed on the surrounding days. More info here: http://www.well-typed.com/blog/125/ Cheers, Andres -- Andres Löh, Haskell Consultant Well-Typed LLP, http://www.well-typed.com Registered in England & Wales, OC335890 250 Ice Wharf, 17 New Wharf Road, London N1 9RF, England

1 0

[ANN] brittany - haskell source code formatting tool - experimental/alpha
by lennart spitzner 06 Sep '16

06 Sep '16

Greetings, I am happy to announce a first alpha release of brittany (0.7.0.0), a haskell source code formatting tool based on ghc-exactprint [2] (and thus ghc's parser). https://github.com/lspitzner/brittany Two small feature cases that brittany would produce/leave unmodified: > -- Newlines are used sparingly: Only after "do" and when the > -- `liftBaseOpDiscard` application would lead to overflowing 80 columns. > main :: IO () > main = do > pool <- createPostgresqlPool (toS databaseConnectionString) 10 > initiate $ \chan -> forever $ do > flip runDbConn pool $ do > makeSureQueueIsFull chan > void $ liftBaseOpDiscard (consumeMsgs chan responseQueue Ack) > (uncurry processMsg) > threadDelay 1000000 > -- Alignment of patterns > go [] "" = True > go [WildCard ] "" = True > go (WildCard :rest) (c:cs) = go rest (c : cs) || go (WildCard : rest) cs > go (Union globs:rest) cs = any (\glob -> go (glob ++ rest) cs) globs > go [] (_:_) = False > go (_:_) "" = False Yet this is an alpha release, for the following reasons: - Brittany currently only transforms top-level type signatures and (function) bindings. - Not all syntactical constructs (even of plain 2010 haskell) are understood. All common constructs should work, but "common" is purely subjective. - Not all (syntactic) extensions are supported, either. - Needs more testing. (And less than a hundred automated testcases is not very much to explore every syntactic corner of haskell.) On the other hand - I have started using the tool successfully, albeit selectively. - There are checks in place that detect 1) if output is not valid haskell or 2) if source comments are not transcribed to the output. That is, running into non-handled cases should lead to error messages that are harmless, not into any silent it-overwrote-my-code-with-garbage. *How to build?* Brittany requires ghc-8. See https://github.com/lspitzner/brittany#building A hackage release is not planned yet. *Brittany's formatting style* Currently brittany does _not_ give the user many choices. A few flags exist, most prominently to change the indentation (default 2) or the columns (default 80). I am open to suggestions of how to improve the style, but trying to make everyone happy is not a fulfilling goal for me. *Implementation/documentation/performance* The implementation and its core ideas are not documented. The core algorithm in theory has linear complexity in input size; the implementation probably is quadratic dues to some misuses of plain lists or other such implementation details. Providing at least a high-level overview is on my to-do list. [1] https://github.com/lspitzner/brittany [2] https://hackage.haskell.org/package/ghc-exactprint -- lennart

2 1

[ANN] lentil - frugal issue tracker
by Francesco Ariis 02 Sep '16

02 Sep '16

I am pleased to announce the release of lentil 1.0 [0]. [0] http://hackage.haskell.org/package/lentil-1.0.0.1 ============================= lentil - frugal issue tracker ============================= lentil is a minimum effort issue tracker; if you litter your code with: -- FIXME: does outPop work with b/w terminals? [ansi] lentil can help you listing, sorting, exporting, tagging slicing and dicing those `todo`s. To see it in action just type: cabal install lentil # or use stack cd ~/your-project-folder/ lentil . Any repo will do, not only Haskell ones! For further information, check the project homepage [1] and the user manual [2]. [1] http://ariis.it/static/articles/lentil/page.html [2] http://ariis.it/static/articles/lentil-manual/page.html Heartfelt "thank you!" to anyone who contributed [3] by providing valuable feedback, suggestions, patches! [3] http://ariis.it/link/repos/lentil/contributors.txt

1 0

New edition of "Programming in Haskell"
by Graham Hutton 01 Sep '16

01 Sep '16

Dear all, I'm delighted to announce that the new edition of "Programming in Haskell" is now available! Further details are provided below, and are also available from: http://tinyurl.com/hnfjdgc. Best wishes, Graham ================================================================= *** BOOK ANNOUNCEMENT *** Programming in Haskell - 2nd Edition Graham Hutton, University of Nottingham Cambridge University Press, 1st September 2016 320 pages, 120 exercises, ISBN 9781316626221 http://tinyurl.com/hnfjdgc ================================================================= DESCRIPTION: Haskell is a purely functional language that allows programmers to rapidly develop clear, concise, and correct software. The language has grown in popularity in recent years, both in teaching and in industry. This book is based on the author's experience of teaching Haskell for more than twenty years. All concepts are explained from first principles and no programming experience is required, making this book accessible to a broad spectrum of readers. While Part I focuses on basic concepts, Part II introduces the reader to more advanced topics. This new edition has been extensively updated and expanded to include recent and more advanced features of Haskell, new examples and exercises, selected solutions, and freely downloadable lecture slides and example code. The presentation is clean and simple, while also being fully compliant with the latest version of the language, including recent changes concerning applicative, monadic, foldable, and traversable types. ================================================================= CONTENTS: Foreword Preface Part I. Basic Concepts: 1. Introduction 2. First steps 3. Types and classes 4. Defining functions 5. List comprehensions 6. Recursive functions 7. Higher-order functions 8. Declaring types and classes 9. The countdown problem Part II. Going Further: 10. Interactive programming 11. Unbeatable tic-tac-toe 12. Monads and more 13. Monadic parsing 14. Foldables and friends 15. Lazy evaluation 16. Reasoning about programs 17. Calculating compilers Appendix A. Selected solutions Appendix B. Standard prelude Bibliography Index ================================================================= AUTHOR: Graham Hutton is Professor of Computer Science at the University of Nottingham. He has taught Haskell to thousands of students and received numerous best lecturer awards. Hutton has served as an editor of the Journal of Functional Programming, Chair of the Haskell Symposium and the International Conference on Functional Programming, and Vice-Chair of the ACM Special Interest Group on Programming Languages, and he is an ACM Distinguished Scientist. ================================================================= 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

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