November 2016 - Haskell-Cafe

Cfa TTT 2017 (Type Theory Based Tools)
by Andreas Abel 01 Nov '16

01 Nov '16

CALL FOR ABSTRACTS TTT : Type Theory Based Tools ============================= Satellite workshop of POPL 2017, Paris France, January 15th [We have funding possibilities for students and young researchers, see below. Note the early deadline!] Overview ======== The aim of this workshop is to showcase modern tools based on type theory, whether designed for programming or for verification, whether academic projects or used in an industrial setting. It will provide a forum to highlight and discuss their common and their distinctive features, and the future directions of development of the tools. The program will consist of invited and contributed talks, and will encourage informal discussion. Abstracts will be displayed on the website of the workshop but there will be no proceedings. We solicit abstract submissions proposing demos, case studies, describing the impact of a theoretical result on practice, or any other aspect of the development and use of tools based on type theory. In particular, we welcome submissions about prototype implementations and promising work in progress, as soon as they have the potential of raising interesting discussions. This workshop is funded by the EUTypes COST project (https://eutypes.cs.ru.nl/) The program will include a plenary discussion on the role of the EUTypes project in the community and planning of activities for 2017. Invited Speakers ================ Robbert Krebbers, Delft University of Technology, Netherlands Aaron Tomb, Galois, US More speakers to be confirmed Registration ============ Registration information will be soon available at the main POPL 2017 website: http://conf.researchr.org/home/POPL-2017 Participant funding =================== The EUTypes COST project (https://eutypes.cs.ru.nl/) can fund students and young researchers from countries participating in the project to attend the workshop – check http://www.cost.eu/COST_Actions/ca/CA15123?parties to see if your country is listed. The application should include the following information: * Your name * Your institution * The name of your supervisor(s) * The url of your webpage if you have one * Your research topics or interests in 1 paragraph and should be sent to ttt2017(a)easychair.org as soon as possible and no later than November 20th. Contact ======= For any query about this workshop, please contact us at ttt2017(a)easychair.org Call for abstracts ================== Submissions for talks and demonstrations should be described in an extended abstract, between 1 and 2 pages in length. We suggest formatting the text using the two-column SIGPLAN LaTeX style (9pt font). Submission page: https://easychair.org/conferences/?conf=ttt2017 Important dates =============== Submission deadline: 30 November 2016 Notification: 15 December 2016 Workshop: 15 January 2017 Program Committee ================= Andreas Abel, Gothenburg University, Sweden Andrej Bauer, University of Ljubljana, Slovenia Assia Mahboubi, Inria Université Paris-Saclay, France Keiko Nakata, Germany -- Andreas Abel <>< Du bist der geliebte Mensch. Department of Computer Science and Engineering Chalmers and Gothenburg University, Sweden andreas.abel(a)gu.se http://www2.tcs.ifi.lmu.de/~abel/

1 0

Suggestion for Data Structure regarding Timetabling and Time Intervals
by Michael Roth 01 Nov '16

01 Nov '16

I would like to experiment with timetabling algorithms and resource scheduling in a special use case: I have time intervals like A, B and C and they are put sequentially on a time line. However, between the major time intervals like A, B etc. their are always "minor" time intervals which separates the major ones. For example: a, A, ab, B, bc, C, c Upper case letters denotes "major" time intervals and lower case letters denotes the minor intervals which always separates the major ones. The minor time intervals only have a duration, their exact occurrence in time doesn't matter, only the fact that they occur between the major time intervals are important. The major time intervals start and stop a specific time; they don't overlap and maybe there is free time between major and/or minor time intervals. The minor time intervals "a" and "b" at the beginning and ending of the complete time line I'm not interested in and can be omitted completely. Say, to insert a time interval X after B, assuming there is enough free time between B and C, the resulting structure is: a, A, ab, B, bx, X, xc, C, c The minor time interval "bc" is discarded and two new minor time intervals "bx" and "xc" are inserted. I'm a little bit stuck what a good data structure would be for this problem. Additionally I would like to use an infinite data structure, because a priori I don't know how many time intervals have to be created and inserted into the time line. The time intervals are not generated in an ascending order. An algorithm will search for possible places to insert the new created major time intervals and creates the corresponding minor time intervals. There is the concept of a "present time" in this process. The algorithm can only manipulate the future. I thought to push all time intervals in the past respective to this "present time" to a MonadWriter to get my infinite list of time intervals. The "present time" is moved forward at specific events. What do you experts think about the approach with the MonadWriter? What would be a good data structure to ensure that all major time intervals are separated by minor time intervals? Thank you in advance for your ideas and comments, Michael Roth

1 0

Suggestion: A catalog of Language extensions
by Zachary Kessin 01 Nov '16

01 Nov '16

I have noticed that almost every haskell source file I have looked at has 4-8 language extensions. It would be very nice if there was a page somewhere that listed them all and gave a short (1 paragraph) description of what that extension does and what it is normally used for. That is not a detailed description of the API but a short description of *WHY* you might want to use it. Followed by a link to the API -- Zach Kessin SquareTarget <http://squaretarget.rocks?utm_source=email-sig> Twitter: @zkessin <https://twitter.com/zkessin> Skype: zachkessin ᐧ

4 3

Call for Workshop Proposals: ICFP 2017
by Lindsey Kuper 01 Nov '16

01 Nov '16

CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2017 22nd ACM SIGPLAN International Conference on Functional Programming September 3-9, 2017 Oxford, United Kingdom http://conf.researchr.org/home/icfp-2017 The 22nd ACM SIGPLAN International Conference on Functional Programming will be held in Oxford, United Kingdom on September 3-9, 2017. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for workshops (and other co-located events, such as tutorials) to be affiliated with ICFP 2017 and sponsored by SIGPLAN. These events should be less formal and more focused than ICFP itself, include sessions that enable interaction among the attendees, and foster the exchange of new ideas. The preference is for one-day events, but other schedules can also be considered. The workshops are scheduled to occur on September 3 (the day before ICFP) and September 7-9 (the three days after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: November 19, 2016 Notification of acceptance: December 18, 2016 Prospective organizers of workshops or other co-located events are invited to submit a completed workshop proposal form in plain text format to the ICFP 2017 workshop co-chairs (David Christiansen and Andres Loeh), via email to icfp2017-workshops(a)googlegroups.com by November 19, 2016. (For proposals of co-located events other than workshops, please fill in the workshop proposal form and just leave blank any sections that do not apply.) Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by December 18, 2016, and if successful, depending on the event, they will be asked to produce a final report after the event has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available at: http://www.icfpconference.org/icfp2017-files/icfp17-workshops-form.txt Further information about SIGPLAN sponsorship is available at: http://www.sigplan.org/Resources/Proposals/Sponsored/ ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2017 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: David Christiansen (Indiana University) Workshop Co-Chair: Andres Loeh (Well-Typed LLP) General Chair: Jeremy Gibbons (University of Oxford) Program Chair: Mark Jones (Portland State University) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (David Christiansen and Andres Loeh), via email to icfp2017-workshops(a)googlegroups.com

1 0