- Haskell - Haskell.org

RV 2017 - 2nd Call for Participation
by Klaus Havelund 09 Aug '17

09 Aug '17

CALL FOR PARTICIPATION RV’17 - RUNTIME VERIFICATION 2017 The 17th International Conference on Runtime Verification September 13-16 2017, Seattle, WA, USA Website: http://rv2017.cs.manchester.ac.uk Program: http://easychair.org/smart-program/RV2017/ Affiliated Event: RV-CuBES - An International Workshop on Competitions, Usability, Benchmarks, Evaluation, and Standardisation for Runtime Verification Tools === Early Registration and Accommodation Deadline === **** August 13 **** === OVERVIEW === Runtime verification is concerned with the monitoring and analysis of the runtime behaviour of software and hardware systems. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they provide an additional level of rigor and effectiveness compared to conventional testing, and are generally more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for testing, verification, and debugging purposes, and after deployment for ensuring reliability, safety, and security and for providing fault containment and recovery as well as online system repair. Topics of interest to the conference include: specification languages monitor construction techniques program instrumentation logging, recording, and replay combination of static and dynamic analysis specification mining and machine learning over runtime traces monitoring techniques for concurrent and distributed systems runtime checking of privacy and security policies statistical model checking metrics and statistical information gathering program/system execution visualization fault localization, containment, recovery and repair integrated vehicle health management (IVHM) Application areas of runtime verification include cyber-physical systems, safety/mission-critical systems, enterprise and systems software, autonomous and reactive control systems, health management and diagnosis systems, and system security and privacy. === INVITED TALKS === Rodrigo Fonseca, Brown University, USA: “The Design and Applications for a Tracing Plane for Distributed Systems” Vlad Levin and Jakob Lichtenberg, Microsoft, USA: “Windows Driver Verification Platform” Andreas Zeller, Saarland University, Germany: “Learning Input Languages for Runtime Verification” === TUTORIALS === Ankush Desai and Shaz Qadeer, UC Berkeley and Microsoft Research, USA: “P : Modular and Safe Asynchronous Programming” Madhusudan Parthasarathy, University of Illinois at Urbana-Champaign, USA: “Machine-learning State Properties” Adrian Francalanza, University of Malta, Malta: “Foundations For Runtime Monitoring” === VENUE === The 17th International Conference on Runtime Verification will be held in the Sheraton Seattle Hotel situated in downtown Seattle. The venue is within walking distance of the famous Pike Place Market, Seattle Art Museum, Seattle Aquarium, and the Historic Seattle Waterfront. The weather in September still permits many open-air opportunities to shop, eat, and even sail in the Elliott Bay. Exceptionally well organized, Seattle’s public transport connects the conference venue with the Seattle Center, which is the home of popular attractions like the Space Needle, EMP Museum, and Chihuly Garden and Glass. === REGISTRATION === Registration is available using the web-based registration form, with online payment on a secure website. Please use one form per attendee. Early registration means on or before August 13, 2017. Late registration means after August 13, 2017. Different possibilities of registration are available: Tutorial Day Only (13th September): 210 USD Conference including tutorial day and RV-CuBES (13-16th September) Full Registration Early: 680 USD, Late (after 13 August): 780 USD Student Registration Early: 480 USD, Late (after 13 August): 580 USD === Program Committee === Wolfgang Ahrendt, Chalmers Univ. of Technology/Univ. of Gothenburg, Sweden Cyrille Artho, KTH Royal Institute of Technology, Sweden Howard Barringer, The University of Manchester, UK Ezio Bartocci, Vienna University of Technology, Austria Andreas Bauer, KUKA Systems, Germany Saddek Bensalem, VERIMAG (University of Grenoble Alpes), France Eric Bodden, Paderborn University / Fraunhofer IEM, Germany Borzoo Bonakdarpour, McMaster University, Canada Christian Colombo, University of Malta, Malta Ylies Falcone, University of Grenoble Alpes, France Grigory Fedyukovich, University of Washington, USA Lu Feng, University of Virginia, USA Patrice Godefroid, Microsoft Research, USA Jean Goubault-Larrecq, CNRS & ENS de Cachan, France Alex Groce, Northern Arizona University, USA Radu Grosu, Vienna University of Technology, Austria Sylvain Hallé, University of Québec at Chicoutimi, Canada Marieke Huisman, University of Twente, Netherlands Franjo Ivancic, Google, USA Bengt Jonsson, Uppsala University, Sweden Felix Klaedtke, NEC Europe Ltd. Rahul Kumar, Microsoft Research, USA Kim Larsen, Aalborg University, Denmark Insup Lee, University of Pennsylvania, USA Axel Legay, Inria Rennes, France Martin Leucker, University of Lübeck, Germany Ben Livshits, Imperial College, UK David Lo, Singapore Management University, Singapore Francesco Logozzo, Facebook, USA Parthasarathy Madhusudan, University of Illinois at Urbana-Champaign, USA Leonardo Mariani, University of Milan Bicocca, Italy Madan Musuvathi, Microsoft Research, USA Ayoub Nouri, University of Grenoble Alpes, France Gordon Pace, University of Malta, Malta Doron Peled, Bar Ilan University, Israel Grigore Rosu, University of Illinois at Urbana-Champaign, USA Veselin Raychev, ETH Zurich, Switzerland Cesar Sanchez, IMDEA Software Institute, Spain Gerardo Schneider, Chalmers Univ. of Technology/Univ. of Gothenburg, Sweden Rahul Sharma, Microsoft Research, India Julien Signoles, CEA LIST, France Scott Smolka, Stony Brook University, USA Oleg Sokolsky, University of Pennsylvania, USA Bernhard Steffen, University of Dortmund, Germany Scott Stoller, Stony Brook University, USA Volker Stolz, Western Norway University of Applied Sciences, Norway Frits Vaandrager, Radboud University, Netherlands Neil Walkinshaw, University of Leicester, UK Chao Wang, University of Southern California, USA Eugen Zalinescu, Technische Universitat München, Germany === CHAIRS AND ORGANIZERS === General Chair Klaus Havelund, NASA Jet Propulsion Laboratory, USA Program Chairs Shuvendu Lahiri, Microsoft Research, USA Giles Reger, University of Manchester, UK Finance Chair Oleg Sokolsky, University of Pennsylvania, USA Publicity Chair Ayoub Nouri, University of Grenoble Alpes, France Local Organisation Chairs Grigory Fedyukovich, University of Washington, USA Rahul Kumar, Microsoft Research, USA RV-CuBES, PC chairs Giles Reger, University of Manchester, UK Klaus Havelund, NASA Jet Propulsion Laboratory, USA === SPONSORS === Microsoft Springer --- end --

1 0

Extended deadline: IFL 2017 (29th Symposium on Implementation and Application of Functional Languages)
by publicityifl＠gmail.com 07 Aug '17

07 Aug '17

<div dir="ltr">Hello, Please, find below the third call for papers for IFL 2017. Note that some of the deadlines have been extended. Details are given below. Please forward these to anyone you think may be interested. Apologies for any duplicates you may receive. best regards, Jurriaan Hage Publicity Chair of IFL --- IFL 2017 - CALL FOR PAPERS: DEADLINES EXTENDED ============================================== 29th SYMPOSIUM ON IMPLEMENTATION AND APPLICATION OF FUNCTIONAL LANGUAGES ======================================================================= University of Bristol, UK In cooperation with ACM SIGPLAN Wednesday 30 August - Friday 1 September, 2017 <a href="http://iflconference.org/">http://iflconference.org/</a> Scope ----- The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2017 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Peer-review ----------- Following the IFL tradition, IFL 2017 will use a post-symposium review process to produce the formal proceedings. All participants of IFL 2017 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. At no time may work submitted to IFL be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy: <a href="http://www.sigplan.org/Resources/Policies/Republication">http://www.sigplan.org/Resources/Policies/Republication</a> The submissions will be screened by the program committee chair to make sure they are within the scope of IFL, and will appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. Hence, publications that appear only in the draft proceedings are not subject to the ACM SIGPLAN republication policy. After the symposium, authors will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal review process. From the revised submissions, the program committee will select papers for the formal proceedings considering their correctness, novelty, originality, relevance, significance, and clarity. The formal proceedings will appear in the International Conference Proceedings Series of the ACM Digital Library. Important dates --------------- Note that the original deadlines for submission and registration have been extended. | | | | ----------------------| -----------------------------------------------------------| | Thu 17 August 2017 | Submission deadline draft papers | | Fri 18 August 2017 | Notification of acceptance for presentation | | Mon 21 August 2017 | Early registration deadline | | Mon 21 August 2017 | Submission deadline for pre-symposium proceedings | | Fri 25 August 2017 | Late registration deadline | | Wed 30 August 2017 - Fri 1 September 2017 | IFL Symposium | | Mon 4 December 2017 | Submission deadline for post-symposium proceedings | | Wed 31 January 2018 | Notification of acceptance for post-symposium proceedings | | Mon 12 March 2018 | Camera-ready version for post-symposium proceedings | Submission details ------------------ Prospective authors are encouraged to submit papers or extended abstracts to be published in the draft proceedings and to present them at the symposium. All contributions must be written in English. Papers must use the new ACM two columns conference format, which can be found at: <a href="http://www.acm.org/publications/proceedings-template">http://www.acm.org/publications/proceedings-template</a> For the pre-symposium proceedings we adopt a 'weak' page limit of 12 pages. For the post-symposium proceedings the page limit of 12 pages is firm. Authors submit through EasyChair: <a href="https://easychair.org/conferences/?conf=ifl2017">https://easychair.org/conferences/?conf=ifl2017</a> Topics ------ IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools in the context of functional programming. If you are not sure whether your work is appropriate for IFL 2017, please contact the PC chair at <a href="mailto:nicolas.wu@bristol.ac.uk">nicolas.wu(a)bristol.ac.uk</a>. Topics of interest include, but are not limited to: - language concepts - type systems, type checking, type inferencing - compilation techniques - staged compilation - run-time function specialization - run-time code generation - partial evaluation - (abstract) interpretation - metaprogramming - generic programming - automatic program generation - array processing - concurrent/parallel programming - concurrent/parallel program execution - embedded systems - web applications - (embedded) domain specific languages - security - novel memory management techniques - run-time profiling performance measurements - debugging and tracing - virtual/abstract machine architectures - validation, verification of functional programs - tools and programming techniques - (industrial) applications Peter Landin Prize ------------------ The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honored article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Programme committee ------------------- Chair: Nicolas Wu, University of Bristol, UK - Kenichi Asai, Ochanomizu University, Japan - Sandrine Blazy, University of Rennes 1, France - Carlos Camarao, Universidade Federal de Minas Gerais, Brazil - Stephen Dolan, University of Cambridge, UK - Jurriaan Hage, Utrecht University, Netherlands - Yukiyoshi Kameyama, University of Tsukuba, Japan - Benjamin Lerner, Brown University, USA - Bas Lijnse, Radboud University, Netherlands - Garrett Morris, University of Kansas, USA - Miguel Pagano, Universidad Nacional de C√≥rdoba, Argentina - Tomas Petricek, Alan Turing Institute, UK - Maciej Pir√≥g, University of Wroclaw, Poland - Exequiel Rivas, Universidad Nacional de Rosario, Argentina - Neil Sculthorpe, Nottingham Trent University, UK - Melinda Toth, Eotvos Lorand University, Hungary - Phil Trinder, Glasgow University, UK - Kanae Tsushima, National Institute of Informatics, Japan - Marcos Viera, Universidad de la Republica, Uruguay - Meng Wang, University of Kent, UK Venue ----- The IFL 2017 will be held in association with the Department of Computer Science, University of Bristol, UK. Bristol is located in South West England, and can be easily reached from Bristol Airport. See the website for more information on the venue. </div>  <a style='display: block; margin: 32px 0 40px 0; padding: 10px; font-size: 1em; text-align: center; border: 0; border-top: 1px solid gray; ' href='https://goo.gl/2ksdRv'>powered by GSM. Free mail merge and email marketing software for Gmail.</a>

1 0

Re: [Haskell] Haskell Digest, Vol 168, Issue 3
by Geraldus 06 Aug '17

06 Aug '17

Wow, looks very promising. сб, 5 авг. 2017 г. в 17:29, <haskell-request(a)haskell.org>: > Send Haskell mailing list submissions to > haskell(a)haskell.org > > To subscribe or unsubscribe via the World Wide Web, visit > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell > or, via email, send a message with subject or body 'help' to > haskell-request(a)haskell.org > > You can reach the person managing the list at > haskell-owner(a)haskell.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Haskell digest..." > > > Today's Topics: > > 1. [ANN] brittany - haskell source code formatting tool - > hackage release (lennart spitzner) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Fri, 4 Aug 2017 15:01:51 +0200 > From: lennart spitzner <hexagoxel(a)hexagoxel.de> > To: undisclosed-recipients: ; > Subject: [Haskell] [ANN] brittany - haskell source code formatting > tool - hackage release > Message-ID: <14f23926-b296-865d-7eeb-1a232427fd07(a)hexagoxel.de> > Content-Type: text/plain; charset=utf-8 > > Greetings, > > I am happy to (finally) announce the first hackage release of brittany, a > configurable haskell source code formatter based on ghc-exactprint [2]. > > https://hackage.haskell.org/package/brittany > https://github.com/lspitzner/brittany > > > *Introduction* > > Brittany aims to nicely layout the code and retain empty lines and > comments as > they appear in the input. For that it uses a fundamentally different > approach > (see [7]/theory) than other formatters. The project is not finished, yet it > already is usable and produces better results than other formatters in many > cases. Of course these words come from its creator, so see for yourself: I > have included some examples at the bottom of this mail; see [3] and [4] for > some more. > > I wish to stress that this project will only progress at a very slow speed > barring support from the community. I hereby offer to work on this and ask > for funding. See the "future" paragraph below. > > > *Changelog* > > Since the "alpha-release" announced previously [5] the most important > changes > are: > > - Release under the AGPL-v3; > - Release on hackage; > - Make horizontal alignment less aggressive by default (see example [6]); > - Add high-level documentation (see [7]). This might be of interest to > anyone > considering to write a formatter (haskell or even otherwise); > - Improve testsuite setup; > - Improve layouting in many many cases and fix various bugs; > - Add a library interface (this integrates with haskell-ide-engine [8]); > > Brittany still.. > > - does not touch anything other than top-level type signatures and > bindings (imports, classes, instances, data decls, .. are not modified); > - contains some bugs (but it checks its own output for validity and > aborts); > - does not handle many "uncommon" syntactic constructs/extentions > (e.g. arrow notation); > > In preparation of this release the `butcher` and `czipwith` packages were > published on hackage as well. I will cover those in separate announcements. > > > *Building* > > Brittany currently requires ghc-8.0 (no support for previous ghc versions > is > planned, but 8.2 will be). Now that this package is on hackage, cabal users > should be able to install it directly; stack users will currently have to > clone > and go from there (a stack.yaml is provided). Detailed building guides for > cabal, cabal-new and stack are in the project README. > > Inclusion in stackage is coming as soon as all dependencies are included. > > > *Known issues* > > - Bad performance for large inputs (really noticeable at >1k loc). The > cause > is already determined - quadratic instead of linear complexity in one > specific function (see issue #34 [9]). Should be fixable and has high > priority. > - The config (file) lacks documentation. > - Comments are not always reproduced exactly when reformatting. There is a > lack > of testcases for comments in the testsuite. There is the known case of > comments in List/MonadComprehensions that currently breaks idempotency > (the > comments move further left each roundtrip through brittany) where a > solution > will most likely involve some non-trivial changes in ghc-exactprint > (see [10]). > - As mentioned above: only certain module elements are transformed, and > not all syntactical constructs are supported. re-layouting of imports, > data > decls, classes and instances are on the radar, but all require a good > amount > of work. > - CPP is not officially supported. This is mostly a WONTFIX. One can > enable it > by force, and it works to a degree, but it is relatively easy to find > cases > where it will break (conditional code not being reformatted, leading to > syntax errors and theoretically also to change semantics)). > - No fine-grained (per file or even per-function) control/configuration, > e.g. > it is not yet possible to add some pragma/comment to disable reformatting > this one carefully layouted-by-hand function that brittany messes up. > - No adaption to ghc-8.2 yet. > > > *Future/Outlook* > > As far as I can tell brittany already works rather well - I use it all the > time, even though I still run into issues from time to time. Still, > brittany is > not finished (these projects never really are, are they?). > > Up on my list are ghc-8.2 adaption, fixing the performance bug mentioned > above, > layouting of data decls, layouting of instances, and controlling > behaviour/config via flags in the source (as comments). > But implementing new functionality costs a lot of time, even with the DSL > used > internally: One has to understand the GHC AST (which is not always > documented), > think of all possible interactions ("do users really use record syntax when > having more than one constructor?" "are GADT records a thing?"), write the > layouting transformation and test it. > > I have already invested a good amount of my free time into this project > but its > scope is too large and I decided to put a limit on my personal investment. > This means that barring some form of support from the community I don't > see new > features being implemented at any certain pace. This leaves the following > paths: > > 1) This project is supported monetarily: I hereby offer to (part-time) > work on > this provided appropriate funding. I am not sure who exactly might be > interested in providing this kind of support - I am no student anymore > so > GSoC is out of the question. Feel free to contact me on- or off-list if > interested. > > 2) (More) Contributors add tests, report (and maybe fix) bugs and most > importantly implement new functionality (layouting for any syntactic > constructs of the haskell language not yet supported, etc.) > > I realize that this is not a trivial project to dive into, and there is > a > good amount of stuff one has to get familiar with before one can start > making use of the abstractions (the DSL) provided. > > On the other hand, I _think_ that the project source code is relatively > well-structured (although in-source comments are really sparse, > admittedly) > and the high-level (markdown) documentation <strike>will scare everyone > away due to their length</strike> will allow understanding the project > relatively quickly. > > 3) The project will progress only rather slowly. > > Regardless I plan to continue maintaining this project, fix bugs as they > come > up and also work on expanding functionality when I find the time. > > > *Contributing* > > In ascending order of involvement, you can contribute by: > > - Reporting issues, especially instances of bad layouting (especially when > it > is not a pure matter of opinion); > - Add to the testsuite, specifically to the `tests.blt` file of the > `littests` > test. It contains a large number of tests already, but the coverage is > not > very good. > - If you want to really help implementing more stuff, the high-level docs > [7] > are the right place to get a rough overview, especially the theory > document > [11]. I have not documented how to write new layouters yet, so for now I > recommend looking at the existing ones, e.g. in `Expr.hs`. > > > -- lennart > > > [1] https://hackage.haskell.org/package/brittany > https://github.com/lspitzner/brittany/ > [2] https://mpickering.github.io/posts/2015-07-23-ghc-exactprint.html > https://hackage.haskell.org/package/ghc-exactprint > [3] > https://github.com/lspitzner/brittany/blob/da692a4341399390018fb03773e15865… > [4] https://github.com/lspitzner/brittany/tree/master/doc/showcases > [5] > https://mail.haskell.org/pipermail/haskell-cafe/2016-September/124793.html > [6] > https://github.com/lspitzner/brittany/blob/da692a4341399390018fb03773e15865… > [7] > https://github.com/lspitzner/brittany/blob/master/doc/implementation/index.… > [8] https://github.com/haskell/haskell-ide-engine > [9] https://github.com/lspitzner/brittany/issues/34 > [10] https://github.com/alanz/ghc-exactprint/issues/53 > [11] > https://github.com/lspitzner/brittany/blob/master/doc/implementation/theory… > > > -- > > some layouting examples - would be (re)produced in exactly this way by > brittany: > > > main = do > > > > now <- getCurrentTime > > let (_, _, week) = toWeekDate . utctDay $ now > > putStrLn $ ("it's "++) $ case week of > > 6 -> "the weekend" > > 7 -> "the weekend" > > _ -> "a weekday" > > > > localtime <- utcToLocalZonedTime now > > let hr = todHour . localTimeOfDay . zonedTimeToLocalTime $ localtime > > case hr of > > _ | hr < 12 -> putStrLn "it's before noon" > > | otherwise -> putStrLn "it's after noon" > > > -- 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 > > > > > ------------------------------ > > Subject: Digest Footer > > _______________________________________________ > Haskell mailing list > Haskell(a)haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell > > > ------------------------------ > > End of Haskell Digest, Vol 168, Issue 3 > *************************************** >

1 0

[ANN] brittany - haskell source code formatting tool - hackage release
by lennart spitzner 04 Aug '17

04 Aug '17

Greetings, I am happy to (finally) announce the first hackage release of brittany, a configurable haskell source code formatter based on ghc-exactprint [2]. https://hackage.haskell.org/package/brittany https://github.com/lspitzner/brittany *Introduction* Brittany aims to nicely layout the code and retain empty lines and comments as they appear in the input. For that it uses a fundamentally different approach (see [7]/theory) than other formatters. The project is not finished, yet it already is usable and produces better results than other formatters in many cases. Of course these words come from its creator, so see for yourself: I have included some examples at the bottom of this mail; see [3] and [4] for some more. I wish to stress that this project will only progress at a very slow speed barring support from the community. I hereby offer to work on this and ask for funding. See the "future" paragraph below. *Changelog* Since the "alpha-release" announced previously [5] the most important changes are: - Release under the AGPL-v3; - Release on hackage; - Make horizontal alignment less aggressive by default (see example [6]); - Add high-level documentation (see [7]). This might be of interest to anyone considering to write a formatter (haskell or even otherwise); - Improve testsuite setup; - Improve layouting in many many cases and fix various bugs; - Add a library interface (this integrates with haskell-ide-engine [8]); Brittany still.. - does not touch anything other than top-level type signatures and bindings (imports, classes, instances, data decls, .. are not modified); - contains some bugs (but it checks its own output for validity and aborts); - does not handle many "uncommon" syntactic constructs/extentions (e.g. arrow notation); In preparation of this release the `butcher` and `czipwith` packages were published on hackage as well. I will cover those in separate announcements. *Building* Brittany currently requires ghc-8.0 (no support for previous ghc versions is planned, but 8.2 will be). Now that this package is on hackage, cabal users should be able to install it directly; stack users will currently have to clone and go from there (a stack.yaml is provided). Detailed building guides for cabal, cabal-new and stack are in the project README. Inclusion in stackage is coming as soon as all dependencies are included. *Known issues* - Bad performance for large inputs (really noticeable at >1k loc). The cause is already determined - quadratic instead of linear complexity in one specific function (see issue #34 [9]). Should be fixable and has high priority. - The config (file) lacks documentation. - Comments are not always reproduced exactly when reformatting. There is a lack of testcases for comments in the testsuite. There is the known case of comments in List/MonadComprehensions that currently breaks idempotency (the comments move further left each roundtrip through brittany) where a solution will most likely involve some non-trivial changes in ghc-exactprint (see [10]). - As mentioned above: only certain module elements are transformed, and not all syntactical constructs are supported. re-layouting of imports, data decls, classes and instances are on the radar, but all require a good amount of work. - CPP is not officially supported. This is mostly a WONTFIX. One can enable it by force, and it works to a degree, but it is relatively easy to find cases where it will break (conditional code not being reformatted, leading to syntax errors and theoretically also to change semantics)). - No fine-grained (per file or even per-function) control/configuration, e.g. it is not yet possible to add some pragma/comment to disable reformatting this one carefully layouted-by-hand function that brittany messes up. - No adaption to ghc-8.2 yet. *Future/Outlook* As far as I can tell brittany already works rather well - I use it all the time, even though I still run into issues from time to time. Still, brittany is not finished (these projects never really are, are they?). Up on my list are ghc-8.2 adaption, fixing the performance bug mentioned above, layouting of data decls, layouting of instances, and controlling behaviour/config via flags in the source (as comments). But implementing new functionality costs a lot of time, even with the DSL used internally: One has to understand the GHC AST (which is not always documented), think of all possible interactions ("do users really use record syntax when having more than one constructor?" "are GADT records a thing?"), write the layouting transformation and test it. I have already invested a good amount of my free time into this project but its scope is too large and I decided to put a limit on my personal investment. This means that barring some form of support from the community I don't see new features being implemented at any certain pace. This leaves the following paths: 1) This project is supported monetarily: I hereby offer to (part-time) work on this provided appropriate funding. I am not sure who exactly might be interested in providing this kind of support - I am no student anymore so GSoC is out of the question. Feel free to contact me on- or off-list if interested. 2) (More) Contributors add tests, report (and maybe fix) bugs and most importantly implement new functionality (layouting for any syntactic constructs of the haskell language not yet supported, etc.) I realize that this is not a trivial project to dive into, and there is a good amount of stuff one has to get familiar with before one can start making use of the abstractions (the DSL) provided. On the other hand, I _think_ that the project source code is relatively well-structured (although in-source comments are really sparse, admittedly) and the high-level (markdown) documentation <strike>will scare everyone away due to their length</strike> will allow understanding the project relatively quickly. 3) The project will progress only rather slowly. Regardless I plan to continue maintaining this project, fix bugs as they come up and also work on expanding functionality when I find the time. *Contributing* In ascending order of involvement, you can contribute by: - Reporting issues, especially instances of bad layouting (especially when it is not a pure matter of opinion); - Add to the testsuite, specifically to the `tests.blt` file of the `littests` test. It contains a large number of tests already, but the coverage is not very good. - If you want to really help implementing more stuff, the high-level docs [7] are the right place to get a rough overview, especially the theory document [11]. I have not documented how to write new layouters yet, so for now I recommend looking at the existing ones, e.g. in `Expr.hs`. -- lennart [1] https://hackage.haskell.org/package/brittany https://github.com/lspitzner/brittany/ [2] https://mpickering.github.io/posts/2015-07-23-ghc-exactprint.html https://hackage.haskell.org/package/ghc-exactprint [3] https://github.com/lspitzner/brittany/blob/da692a4341399390018fb03773e15865… [4] https://github.com/lspitzner/brittany/tree/master/doc/showcases [5] https://mail.haskell.org/pipermail/haskell-cafe/2016-September/124793.html [6] https://github.com/lspitzner/brittany/blob/da692a4341399390018fb03773e15865… [7] https://github.com/lspitzner/brittany/blob/master/doc/implementation/index.… [8] https://github.com/haskell/haskell-ide-engine [9] https://github.com/lspitzner/brittany/issues/34 [10] https://github.com/alanz/ghc-exactprint/issues/53 [11] https://github.com/lspitzner/brittany/blob/master/doc/implementation/theory… -- some layouting examples - would be (re)produced in exactly this way by brittany: > main = do > > now <- getCurrentTime > let (_, _, week) = toWeekDate . utctDay $ now > putStrLn $ ("it's "++) $ case week of > 6 -> "the weekend" > 7 -> "the weekend" > _ -> "a weekday" > > localtime <- utcToLocalZonedTime now > let hr = todHour . localTimeOfDay . zonedTimeToLocalTime $ localtime > case hr of > _ | hr < 12 -> putStrLn "it's before noon" > | otherwise -> putStrLn "it's after noon" > -- 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

1 0

Haskell in Leipzig 2017: submission deadline shifted by two weeks
by Wolfgang Jeltsch 02 Aug '17

02 Aug '17

Hi! We have shifted the submission deadline for Haskell in Leipzig 2017 by two weeks. The new deadline is at 18 August 2017. Looking forward to your contribution. 😉 Event: Haskell in Leipzig 2017 Time: October 26–28, 2017 Place: HTWK Leipzig, Germany Homepage: https://hal2017.softbase.org/ About ===== Haskell is a modern functional programming language that allows rapid development of robust and correct software. It is renowned for its expressive type system, its unique approaches to concurrency and parallelism, and its excellent refactoring capabilities. Haskell is both the playing field of cutting-edge programming language research and a reliable base for commercial software development. The workshop series Haskell in Leipzig (HaL), now in its 12th year, brings together Haskell developers, Haskell researchers, Haskell enthusiasts, and Haskell beginners to listen to talks, take part in tutorials, join in interesting conversations, and hack together. To support the latter, HaL will include a one-day hackathon this year. The workshop will have a focus on functional reactive programming (FRP) this time, while continuing to be open to all aspects of Haskell. As in the previous year, the workshop will be in English. Contributions ============= Everything related to Haskell is on topic, whether it is about current research, practical applications, interesting ideas off the beaten track, education, or art, and topics may extend to functional programming in general and its connections to other programming paradigms. Contributions can take the form of * talks (about 30 minutes), * tutorials (about 90 minutes), * demonstrations, artistic performances, or other extraordinary things. Please submit an abstract that describes the content and form of your presentation, the intended audience, and required previous knowledge. We recommend a length of 2 pages, so that the program committee and the audience get a good idea of your contribution, but this is not a hard requirement. Please submit your abstract as a PDF document at https://easychair.org/conferences/?conf=hal2017 until Friday, August 18, 2017. You will be notified by Friday, September 8, 2017. Hacking Projects ================ Projects for the hackathon can be presented during the workshop. A prior submission is not needed for this. Invited Speaker =============== * Ivan Perez, University of Nottingham, UK Invited Performer ================= * Lennart Melzer, Robert-Schumann-Hochschule Düsseldorf, Germany Program Committee ================= * Edward Amsden, Plow Technologies, USA * Heinrich Apfelmus, Germany * Jurriaan Hage, Utrecht University, The Netherlands * Petra Hofstedt, BTU Cottbus-Senftenberg, Germany * Wolfgang Jeltsch, Tallinn University of Technology, Estonia (chair) * Andres Löh, Well-Typed LLP, Germany * Keiko Nakata, SAP SE, Germany * Henrik Nilsson, University of Nottingham, UK * Ertuğrul Söylemez, Intelego GmbH, Germany * Henning Thielemann, Germany * Niki Vazou, University of Maryland, USA * Johannes Waldmann, HTWK Leipzig, Germany Questions ========= If you have any questions, please do not hesitate to contact Wolfgang Jeltsch at wolfgang-it(a)jeltsch.info.

1 0

PEPM 2018 Call for Papers
by PEPM Workshop 01 Aug '17

01 Aug '17

-- CALL FOR PAPERS -- ACM SIGPLAN Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM) 2018 =============================================================================== * Website : http://popl18.sigplan.org/track/PEPM-2018 * Time : 8th – 9th January 2018 * Place : Los Angeles, CA, US (co-located with POPL 2018) The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM), which has a history going back to 1991 and has co-located with POPL every year since 2006, originates in the discoveries of practically useful automated techniques for evaluating programs with only partial input. Over the years, the scope of PEPM has expanded to include a variety of research areas centred around the theme of semantics-based program manipulation — the systematic exploitation of treating programs not only as subject to black-box execution, but also as data structures that can be generated, analysed, and transformed while establishing or maintaining important semantic properties. Scope ----- In addition to the traditional PEPM topics (see below), PEPM 2018 welcomes submissions in new domains, in particular: * Semantics based and machine-learning based program synthesis and program optimisation. * Modelling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications. More generally, topics of interest for PEPM 2018 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, embedded and resource-limited computation, and security. This list of categories is not exhaustive, and we encourage submissions describing new theories and applications related to semantics-based program manipulation in general. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme co-chairs, Fritz Henglein (http://www.diku.dk/~henglein/) and Josh Ko (https://josh-hs-ko.github.io) Submission categories and guidelines ------------------------------------ Two kinds of submissions will be accepted: Regular Research Papers and Short Papers. * Regular Research Papers should describe new results, and will be judged on originality, correctness, significance, and clarity. Regular research papers must not exceed 12 pages (excluding bibliography). * Short Papers may include tool demonstrations and presentations of exciting if not fully polished research, and of interesting academic, industrial, and open-source applications that are new or unfamiliar. Short papers must not exceed 6 pages (excluding bibliography). Both kinds of submissions should be typeset using the two-column ‘sigplan’ sub-format of the new ‘acmart’ format available at: http://sigplan.org/Resources/Author/ and submitted electronically via HotCRP: https://pepm18.hotcrp.com/ PEPM 2018 will employ lightweight double-blind reviewing according to the rules of POPL 2018. Quoting from POPL 2018’s call for papers: “submitted papers must adhere to two rules: 1. author names and institutions must be omitted, and 2. references to authors’ own related work should be in the third person (e.g., not “We build on our previous work ...” but rather “We build on the work of ...”). The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important background references should not be omitted or anonymized. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas.” See POPL 2018’s Submission and Reviewing FAQ page for more information: http://popl18.sigplan.org/track/POPL-2018-papers#Submission-and-Reviewing-F… Submissions are welcome from PC members (except the two co-chairs) provided that there are non-PC co-authors. Accepted papers will appear in formal proceedings published by ACM, and be included in the ACM Digital Library. Authors of short papers, however, can ask for their papers to be left out of the formal proceedings. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research tool demonstration papers will be made available on the PEPM 2018 web site. Student participants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. 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 programme, see its web page. Important dates --------------- * Paper submission deadline : Friday 6th October 2017 (AoE) (firm) * Author notification : Saturday 4th November 2017 * Workshop : Monday 8th – Tuesday 9th January 2018 The proceedings will be published 2 weeks pre-conference. AUTHORS TAKE NOTE: The official publication date 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 your conference. The official publication date affects the deadline for any patent filings related to published work. (For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.) Best paper award ---------------- PEPM 2018 continues the tradition of a Best Paper award. The winner will be announced at the workshop. Programme committee ------------------- Nada Amin (EPFL) Shigeru Chiba (University of Tokyo) Ezgi Çiçek (Max Planck Institute for Software Systems) Olivier Danvy (Yale-NUS College) Ronald Garcia (University of British Columbia) Simon Gay (University of Glasgow) Andy Gill (X, the Moonshot Factory) Fritz Henglein (co-chair) (University of Copenhagen) Anastasia Izmaylova (IMC Financial Markets) Johan Jeuring (Utrecht University) Gabriele Keller (University of New South Wales) Oleg Kiselyov (Tohoku University) Hsiang-Shang Ko (co-chair) (National Institute of Informatics) Ralf Lämmel (University of Koblenz-Landau) Julia Lawall (Inria) Simon Peyton Jones (Microsoft Research Cambridge) Frank Pfenning (Carnegie Mellon University) Sriram Rajamani (Microsoft Research India) Norman Ramsey (Tufts University) Thomas Reps (University of Wisconsin-Madison) Sergei Romanenko (Keldysh Institute of Applied Mathematics) Tiark Rompf (Purdue University) Wolfram Schulte (Facebook) Peter Sestoft (IT University of Copenhagen) Harald Søndergaard (University of Melbourne) Kohei Suenaga (Kyoto University) Martin Vechev (ETH Zurich) Marcos Viera (University of the Republic) Nobuko Yoshida (Imperial College London)

1 0

[ANNOUNCE] GHC 8.2.1 available
by Ben Gamari 27 Jul '17

27 Jul '17

=============================================== The Glasgow Haskell Compiler -- version 8.2.1 =============================================== The GHC developers are very happy to announce the long-awaited 8.2.1 release of Glasgow Haskell Compiler. Binary and source distributions can be found at https://downloads.haskell.org/~ghc/8.2.1/ This is the second release in the 8.0 series. As such, the focus of this release is performance, stability, and consolidation. Consequently numerous cleanups can be seen throughout the compiler including, * Significant improvements in compiler performance * More robust support for levity polymorphism * Reliable DWARF debugging information * Improved runtime system performance on NUMA systems * Retooling of the cost-center profiler, including support for live streaming of profile data via the GHC event log * Interface file determinism * More robust treatment of join points, enabling significantly better code generation in many cases * Numerous improvements in robustness on Windows * and the resolution of over 500 other tickets In addition, there are a number of new features, * A new, more type-safe type reflection mechanism * The long-awaited Backpack module system * Deriving strategies to disambiguate between GHC's various instance deriving mechanisms * Unboxed sum types, for efficient unpacked representation of sum data types * Compact regions, allowing better control over garbage collection in the presence of large heaps containing many long-lived objects. * Colorful messages and caret diagnostics for more legible errors A more thorough list of the changes in this release can be found in the release notes, https://haskell.org/ghc/docs/8.2.1/docs/html/users_guide/8.2.1-notes.html There are a few changes in release-engineering that should be noted, * Binary distributions for 32-bit CentOS 6.7 have been dropped. Moreover, there are no dedicated CentOS 7.0 distributions as CentOS 7 can use can use Debian 8 binaries. If you would like us to continue to produce 32-bit CentOS 6.7 distributions please let us know. * GHC HQ now builds FreeBSD and OpenBSD distributions for amd64; this comes after many years of these distributions being faithfully provided by Karel Gardas and Pali Gabor Janos, who we should heartily thank for their contributions. GHC HQ building these distributions ourselves will allow us to more quickly ship distributions to users by eliminating the need for a long lag time between source release availability and having all binary distributions available. * There is a technology-preview of an AArch64 Linux binary distribution, as well as an ARM Linux build. AArch64 support is quite preliminary but should be stable in 8.4 thanks to further linker fixes by Moritz Angerman. ARM should be stable. * GHC now tries to use the gold and lld linkers by default. These linkers are significantly faster than the BFD linker implementation that most Linux distributions use by default. If gold or lld are not available GHC will use the system's default linker. GHC can be forced to use the default linker by passing --disable-ld-override to configure. This release has been the result of over a year of hard work by over 150 code contributors. Thanks to everyone who has helped in writing patches, testing, reporting bugs, and offering feedback over the last year. This release cycle was admittedly quite drawn out, significantly longer than expected or desired. While we are confident that the result is worth the wait, we have been steadily working on infrastructure which should help shrink future release cycles and give us better testing between releases. More details on this coming soon. As always, let us know if you encounter trouble. How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: http://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating efficient code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces. GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://ghc.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://ghc.haskell.org/trac/ghc/wiki/Contributors Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://ghc.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://ghc.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://mail.haskell.org/cgi-bin/mailman/listinfo/glasgow-haskell-users http://mail.haskell.org/cgi-bin/mailman/listinfo/ghc-tickets There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see https://mail.haskell.org/cgi-bin/mailman/listinfo Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug

1 0

Re: [Haskell] [Haskell-cafe] Static analysis engineering at Facebook (Clang/OCaml)
by Don Stewart 27 Jul '17

27 Jul '17

Link moved, apply here: https://www.facebook.com/careers/jobs/a0I1200000LT8aAEAT On Thu, Jul 27, 2017 at 12:39 PM, Shannon Sequeira < shannonsequeira(a)gmail.com> wrote: > Hi Don, the job link appears to be broken. > > Best, > Shannon Sequeira > > On 26 July 2017 at 13:11, Don Stewart <dons00(a)gmail.com> wrote: > >> The Infer static analysis team at Facebook is hiring. We have a >> functional programming engineering role in London to work on the open >> source Clang/C++ frontend to Infer. >> >> Infer is a static analysis suite for C++, Java and Objective C used by >> thousands of engineers at Facebook and elsewhere to find bugs. >> >> The role is a "compiler" role - working on the Clang AST to OCaml, and >> intermediate phases of Infer to improve our C++ analysis capabilities. Good >> FP engineering skills (e.g. Haskell or OCaml) are desirable. >> >> You should have a working knowledge of C++ semantics, language or >> compiler design or experience in a range of C++ projects. >> >> Infer: >> >> http://fbinfer.com/ >> >> Apply via: >> >> https://www.facebook.com/careers/jobs/a0I1200000LT8aA >> >> _______________________________________________ >> Haskell-Cafe mailing list >> To (un)subscribe, modify options or view archives go to: >> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe >> Only members subscribed via the mailman list are allowed to post. >> > >

1 0

Static analysis engineering at Facebook (Clang/OCaml)
by Don Stewart 26 Jul '17

26 Jul '17

The Infer static analysis team at Facebook is hiring. We have a functional programming engineering role in London to work on the open source Clang/C++ frontend to Infer. Infer is a static analysis suite for C++, Java and Objective C used by thousands of engineers at Facebook and elsewhere to find bugs. The role is a "compiler" role - working on the Clang AST to OCaml, and intermediate phases of Infer to improve our C++ analysis capabilities. Good FP engineering skills (e.g. Haskell or OCaml) are desirable. You should have a working knowledge of C++ semantics, language or compiler design or experience in a range of C++ projects. Infer: http://fbinfer.com/ Apply via: https://www.facebook.com/careers/jobs/a0I1200000LT8aA

1 0

PLMW@ICFP: CALL FOR SCHOLARSHIP APPLICATIONS and PARTICIPATION (deadline July 31!)
by Neel Krishnaswami 24 Jul '17

24 Jul '17

[Apologies for the double-post; I had an incorrect URL in the first message.] CALL FOR SCHOLARSHIP APPLICATIONS and PARTICIPATION (deadline July 31!) ACM SIGPLAN Programming Languages Mentoring Workshop, Oxford, UK Co-located with ICFP'17 PLMW web page: http://icfp17.sigplan.org/track/PLMW-ICFP-2017 ### The purpose of this mentoring workshop is to encourage graduate students and senior undergraduate students to pursue careers in programming language research. This workshop will provide technical sessions on cutting-edge research in programming languages, and mentoring sessions on how to prepare for a research career. We will bring together leaders in programming language research from academia and industry to give talks on their research areas. The workshop will engage students in a process of imagining how they might contribute to our research community. So far, we have the following speakers and panelists confirmed for the workshop: - Amal Ahmed (Northeastern University) - Nada Amin (University of Cambridge) - Derek Dreyer (Max Planck Institute for Software Systems) - Richard Eisenberg (Bryn Mawr College) - Ron Garcia (University of British Columbia) - Chris Martens (North Caroline State University) - Conor McBride (Strathclyde University) - Sam Staton (Oxford) We especially encourage women and underrepresented minority students to attend PLMW. This workshop is part of the activities surrounding ICFP, the International Conference on Functional Programming, and takes place the day before the main conference. One goal of the workshop is to make ICFP conference more accessible to newcomers. We hope that participants will stay through the entire conference. ## Travel Scholarship Applications (Due 31 July) Please fill out [this form](https://goo.gl/forms/qDYTkvNndApNc91N2) by 31 July to apply for travel funding. These scholarships will provide funds towards airfare, hotel, and registration fees for attendance at both the workshop and ICFP, but are limited. We welcome students with alternative sources of travel funding to attend PLMW as well. Selected participants will be notified by 2 August and will need to pre-register and commit to attending the workshop by August 4. Applicants who apply after July 31 may be eligible to receive funding, if funds remain. The workshop registration is open to all. Students with alternative sources of funding are welcome. -- Neel Krishnaswami nk480(a)cl.cam.ac.uk

1 0