- Haskell-Cafe - Haskell.org

Where do trivial functions on the usual containers live?
by Olaf Klinke 21 Dec '20

21 Dec '20

> I am looking for a place where I can find or put some simple > functions that I > expect but do not find in the `containers` or elsewhere in the > standard > libraries. Many hackage contributors seem to maintain their own <maintainer>-utils package containing bits and bobs they personally deem useful but can not find elsewhere. I might add my own one soon. Not saying this is a good thing, though. > Some examples I have in mind: > > * Group a collection by an equivalence relation: > > classify ∷ Ord π ⇒ (a → π) → [a] → [[a]] GHC.Exts.groupWith or Data.List.groupBy might do want you want, depending on whether you want to aggregate globally or only consecutive runs of equivalent elements. > > * From a finite map, get a map from its range to its fibers: > > fibers ∷ (Ord k, Ord v) ⇒ Map k v → Map v (NonEmpty k) The usual Semigroup instance of Map k v destroys data upon key collision. For problems like this I have a newtype wrapper newtype SemiMap f v = SemiMap {getSemiMap :: f v} instance (Semigroup v, Ord k) => Semigroup (SemiMap (Map k) v) so that one can implement 'fibers' using foldMapWithKey. Is this worth its own package? > > * Put a type into the diagonal of its square: > > diagonal = λx → (x, x) This may be too trivial to be a library function, and its proper type should rather be x -> Pair x since we know both components have the same type. Pair is a Monad and this function is its return. In package ghc Pair has an Applicativeinstance at least. Regards, Olaf

2 1

Intermediate Modern Haskell
by Jacques Carette 20 Dec '20

20 Dec '20

I will be teaching a second Haskell course next semester. Let's assume that Introducing functional programming Getting started with Haskell and GHCi Basic types and definitions Designing and writing programs Data types, tuples and lists Programming with lists Defining functions over lists Playing the game: I/O in Haskell Reasoning about programs Generalization: patterns of computation Higher-order functions Developing higher-order programs Overloading, type classes and type checking Algebraic types (i.e. the first chapters of Thompson's Haskell: the Craft of Functional Programming book is "beginner, classic Haskell". The next few chapters, namely Abstract data types Lazy programming Programming with monads Domain-Specific Languages Time and space behaviour would be (re)done at the start of such a second course. The question for cafe is: what else? I will likely cover: - Typeclassopedia - finally tagless - Template Haskell - Optics - GADTs - recursion schemes I should probably cover parser combinators, pretty-printing, cabal&stack. I know that http://dev.stephendiehl.com/hask/ <http://dev.stephendiehl.com/hask/> gives me one heck of a smorgasbord of options, which is kind of a problem. Things I know I will not cover: - dependent types (if I was going to do that, I'd switch to Idris/Agda) - concurrency (don't ask) Jacques

7 7

Where do trivial functions on the usual containers live?
by Ignat Insarov 20 Dec '20

20 Dec '20

Hello. I am looking for a place where I can find or put some simple functions that I expect but do not find in the `containers` or elsewhere in the standard libraries. Some examples I have in mind: * Group a collection by an equivalence relation: classify ∷ Ord π ⇒ (a → π) → [a] → [[a]] * From a finite map, get a map from its range to its fibers: fibers ∷ (Ord k, Ord v) ⇒ Map k v → Map v (NonEmpty k) * Put a type into the diagonal of its square: diagonal = λx → (x, x) These are all very common and trivial mathematical constructions and I really want such things to be common place in Haskell, so that they may have a canonical, polished definition. It is unfeasible to put them into the standard libraries. _(Attempts were made.)_ So I wonder if there is a package around that would accept them!

3 6

[CFP]Automatic Debugging, Error and Impact Reporting Approaches workshop
by mgajda＠mimuw.edu.pl 20 Dec '20

20 Dec '20

International workshop on Automatic Debugging, Error and Impact Reporting Approaches ==================================================================================== Automatic debugging, error fixing, and reporting is getting more and more popularity across different research communities. We aim to provide a forum for exchange of latest work and document best practices across different disciplines. - Automatic reproducers like those generated by LLDB - Automatic unit test extraction and using decorators and code inspection - Automatic reproducer/error case minimization - Interactive error recovery systems and their applications - Error algebras and error-tracing algebras - Formalizations of debugging - Fault impact reporting and accuracy estimation - Provenance tracking in term rewriting - Error analytics pipelines and databases - Error monitoring in intrusion detection systems - Delta debugging - Automatic generation of error dashboards - Global fault analysis of systems with both computational and human component, and cyber-physical systems. Note that workshop particularly encourage treatment of all kinds of errors, be they compile-time, run-time, discrepancies between intent and specification, hardware failures, or human errors to the degree to which they are amenable to automatic analysis and reporting. Intended audience ----------------- - Experts in automated debugging, error fixing wishing to exchange knowledge with their peers. - Industry practitioners interested to learn more about approaches to automated analysis of errors. - Academics in quest for formalization of automated error analysis and fixing - Financial industry practitioners interested in computer science approaches to satisfy risk reporting guidelines with respect to error impact tracing and reporting of accuracy - Management scientist looking for automatic global fault reporting and impact reporting methodologies. Because of this, we encourage you to reference used theories and methodologies, and provide a introductions with use cases. The workshop is held as a part of [Programming Conference 2021](https://2021.programming-conference.org/). Goals ----- - Our main goal is to encourage social exchange of ideas related to automatic error analysis and impact reporting. - We call for position papers, research expositions, early stage work, and industry experience papers to encourage exchange of on-going research and implementation efforts. Important dates =============== Abstract registration deadline : January 15th, 2021 Submission deadline : January 20th, 2021 Author response period : February 14th-21st, 2021 Acceptance notification : March 1st, 2021 Programme committee ------------------- - Kenichi Asai, [Ochanomizu University](http://pllab.is.ocha.ac.jp/~asai/) - Michał J. Gajda, [Migamake Pte Ltd](https://migamake.com) *(chair)* - Michał "phoe" Herda [\#lisp @ Freenode IRC](https://netsplit.de/channels/details.php?room=%23lisp&net=freenode) - Henrik Nilsson [University of Nottingham](http://www.cs.nott.ac.uk/~psznhn/) - Vladimir Panteleev [DustMite](https://github.com/CyberShadow/DustMite) - Francesco Spegni [Università Politecnica delle Marche](https://www.dii.univpm.it/francesco.spegni) - Dmitry Vostokov [DumpAnalysis.org](https://DumpAnalysis.org) - Vadim Zaytsev [Universiteit Twente](http://grammarware.net) Submissions =========== We welcome original, unpublished papers of the following forms: full articles, extended abstracts, case studies. Please submit your paper or extended abstract [by EasyChair](https://easychair.org/conferences/?conf=adeira2021). You may [contact the committee chair](https://www.linkedin.com/in/mjgajda/) with any questions you have about submission. The paper evaluation will use the following criteria: \* Novelty \* Clarity of exposition \* Transferrability of innovation(s) to other domains \* Scientific rigour and form of the article \* Cross-pollination potential with other papers \* Preliminary papers will be offered feedback on how to improve the quality in all these factors before and during the workshop All submissions should use [ACM DL template](https://www.acm.org/publications/proceedings-template).

1 0

[CFP]Automatic Debugging, Error and Impact Reporting Approaches workshop
by mgajda＠mimuw.edu.pl 20 Dec '20

20 Dec '20

Dear Friends, The emerging interest in the rigorous and agile data science and functional ETL pipelines has driven the developments of many new libraries, frameworks and methodologies. We invite industry practitioners and academics to present their latest work on agile functional data pipelines as a workshop at the EDI'2021 conference. Call for papers =============== The following would be accepted: - Exposures of methodologies for building agile functional data pipelines - Presentations of frameworks used for data pipelines in industry and academia - Experience reports from building of data pipelines in industry and academia - Benchmarks and optimization of agile data pipeline frameworks - Solutions to data integration and exchange problems within ETL pipelines. In particular, we encourage: - Agile functional data methodologists - Authors of ETL frameworks, streaming libraries and databases, reactive streaming, streaming benchmarks, high-performance workflow engines - Position papers on the use of agile and functional data methodologies - Descriptions of environments for interactive and live programming with data - Benchmarks of state-of-the-art solutions for agile functional data pipelines. Details at https://afdp.github.io Important dates =============== Abstract registration deadline : December 27th, 2020 (extended) Submission deadline : January 3rd, 2020 (extended) Acceptance notification : January 12th 2021 Final manuscripts : January 23rd, 2021 Presentation at the conference : March 23rd-26th 2021 Submission instructions ======================= Original, unpublished papers are solicited for presentation at the AFDP workshop. Prospective authors are invited to submit papers (electronically, PDF only) that are no longer than 6 pages for full papers, including all figures and references. For work-in-progress, we also solicit extended abstracts for presentations. The submitted paper must be formatted according to the guidelines of Procedia Computer Science. All accepted papers will be published in Procedia Computer Science. Location ======== This workshop will be held as a part of [The 4th International Conference on Emerging Data and Industry 4.0 (EDI40)](http://cs-conferences.acadiau.ca/EDI40-21/) held on March 23 - 26, 2021 in Warsaw, Poland. -- Best regards Michał

1 0

[CFP]Agile and Functional Data Pipelines workshop
by mgajda＠mimuw.edu.pl 20 Dec '20

20 Dec '20

Dear Friends, The emerging interest in the rigorous and agile data science and functional ETL pipelines has driven the developments of many new libraries, frameworks and methodologies. We invite industry practitioners and academics to present their latest work on agile functional data pipelines as a workshop at the EDI'2021 conference. Call for papers =============== The following would be accepted: - Exposures of methodologies for building agile functional data pipelines - Presentations of frameworks used for data pipelines in industry and academia - Experience reports from building of data pipelines in industry and academia - Benchmarks and optimization of agile data pipeline frameworks - Solutions to data integration and exchange problems within ETL pipelines. In particular, we encourage: - Agile functional data methodologists - Authors of ETL frameworks, streaming libraries and databases, reactive streaming, streaming benchmarks, high-performance workflow engines - Position papers on the use of agile and functional data methodologies - Descriptions of environments for interactive and live programming with data - Benchmarks of state-of-the-art solutions for agile functional data pipelines. Details at https://afdp.github.io Important dates =============== Abstract registration deadline : December 27th, 2020 (extended) Submission deadline : January 3rd, 2020 (extended) Acceptance notification : January 12th 2021 Final manuscripts : January 23rd, 2021 Presentation at the conference : March 23rd-26th 2021 Submission instructions ======================= Original, unpublished papers are solicited for presentation at the AFDP workshop. Prospective authors are invited to submit papers (electronically, PDF only) that are no longer than 6 pages for full papers, including all figures and references. For work-in-progress, we also solicit extended abstracts for presentations. The submitted paper must be formatted according to the guidelines of Procedia Computer Science. All accepted papers will be published in Procedia Computer Science. Location ======== This workshop will be held as a part of [The 4th International Conference on Emerging Data and Industry 4.0 (EDI40)](http://cs-conferences.acadiau.ca/EDI40-21/) held on March 23 - 26, 2021 in Warsaw, Poland. -- Best regards Michał

1 0

[TFPIE'21] Second Call For Papers: Trends in Functional Programming *in Education* 2021, 16 February 2021 (with Lambda Days 2021 & TFP 2021)
by Peter Achten 18 Dec '20

18 Dec '20

----------------------------------- TFPIE 2021 2nd Call for papers ----------------------------------- https://wiki.tfpie.science.ru.nl/TFPIE2021#TFPIE_2021 (February 16 2021, co-organized with TFP 2021 and Lambda Days 2021) Because of the covid pandemic, the events are online this year. The goal of the International Workshops on Trends in Functional Programming in Education is to gather researchers, professors, teachers, and all professionals that use or are interested in the use of functional programming in education. TFPIE aims to be a venue where novel ideas, classroom-tested ideas, and work in progress on the use of functional programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. TFPIE 2021 welcomes submissions in the above mentioned areas. This year many teaching programmes have had to make a rapid transition to online teaching, and we explicitly solicit papers that explore this area of teaching functional programming. Topics of interest include, but are not limited to: - FP and beginning CS students - FP and Computational Thinking - FP and Artificial Intelligence - FP in Robotics - FP and Music - Advanced FP for undergraduates - FP in graduate education - Engaging students in research using FP - FP in Programming Languages - FP in the high school curriculum - FP as a stepping stone to other CS topics - FP and Philosophy - The pedagogy of teaching FP - FP and e-learning: MOOCs, automated assessment etc. - Best Lectures - more details below In addition to papers, we are requesting best lecture presentations. What's your best lecture topic in an FP related course? Do you have a fun way to present FP concepts to novices or perhaps an especially interesting presentation of a difficult topic? In either case, please consider sharing it. Best lecture topics will be selected for presentation based on a short abstract describing the lecture and its interest to TFPIE attendees. The length of the presentation should be comparable to that of a paper. On top of the lecture itself, the presentation can also provide commentary on the lecture. Submissions Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 20 pages) in EPTCS style. The authors of accepted presentations will have their preprints and their slides made available on the workshop's website. Papers and abstracts can be submitted via easychair at the following link: https://easychair.org/conferences/?conf=tfpie2021 After the workshop, presenters are invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. Dates - Submission deadline: January 11 2021, Anywhere on Earth. - Notification: January 15 2021 - Workshop: February 16 2021 - Submission for formal review: April 20 2021, Anywhere on Earth. - Notification of full article: June 7 2021 - Camera ready: July 1st 2021 Program Committee - Peter Achten, Radboud University, Netherlands (chair) - Edwin Brady, University of St Andrews, UK - Laura Castro, Universidade da Coruña, Spain - Stephen Chang, University of Massachusetts Boston, USA - Youyou Cong, Tokyo Institute of Technology, Japan - Matthew Flatt, University of Utah, USA - Seth Fogarty, Trinity University, USA - Alex Gerdes, University of Gothenburg, Sweden - Gabriele Keller, Utrecht University, Netherlands - Prabhakar Ragde, University of Waterloo, Canada - Melinda Tóth, Eötvös Loránd University, Budapest, Hungary Registration TFPIE is part of Lambda Days. Please visit the Lambda Days 2021 pages when registration information becomes available. Only papers that have been presented at TFPIE may be submitted to the post-reviewing process. Information on Lambda Days is available at https://www.lambdadays.org/lambdadays2021 Information on TFP is available at http://tfp2021.org

1 0

Re: [Haskell-cafe] Intermediate Modern Haskell
by Johannes Waldmann 17 Dec '20

17 Dec '20

Hi, when I was in a similar situation two years ago (an advanced course, after something basic) I had this list of topics https://imweb.imn.htwk-leipzig.de/~waldmann/edu/modul/seminar/fkps/ This was not a lecture but "Seminar", meaning that students give talks. Not all topics were actually presented - depending on number, and preferences, of participants. Meanwhile, I would probably add something on Foldable (cf. Section 7 of https://arxiv.org/abs/1808.08329) and I do plan to use https://thinkingwithtypes.com/ next time. Best regards, Johannes. PS: overview of my basic course: https://imweb.imn.htwk-leipzig.de/~waldmann/talk/17/wflp/ with that regard - on your list of topics: "Basic: ... algebraic data types" - comes last - good heavens! For me, it's first. See also Joachim's CIS 194. "likely cover: ... recursion schemes" - by all means do! Second lecture of basic course! Full marks for Brent's version of CIS194 https://www.cis.upenn.edu/~cis194/spring13/lectures.html

2 1

PhD studentships in Robotics (Edinburgh Center for Robotics)
by Ekaterina Komendantskaya 17 Dec '20

17 Dec '20

Dear colleagues, Edinburgh Center for Robotics has published a fresh call for PhD scholarship applications. There will be space for verification and programming language research: see item 3: *" explainable AI, certification, verification, safety, security, multi-agent interactions;"* It is an ideal opportunity for PhD students who wish to apply their knowledge in Programming Languages and Verification to the growing field of Robotics and Autonomous systems research. See below the official advert and contact me directly if you need more information. *************************************** The Edinburgh Centre of Robotics is offering exciting PhD Studentships <https://www.edinburgh-robotics.org/projects-list> for September 2021 through the EPSRC Centre for Doctoral Training in Robotics and Autonomous Systems (CDT-RAS). A limited number of industry PhD placements may also be available and information about these opportunities is posted here <https://www.edinburgh-robotics.org/industry-studentships>. *Closing date 29**th** January 2021* Heriot-Watt University and the University of Edinburgh are jointly offering an exciting opportunity to study a PhD through an innovative 4-year PhD training programme, drawing on our extensive experience with postgraduate teaching and research supervision in the area of Robotics and Autonomous Systems. The Centre's goal is to train innovation-ready robotics researchers to be part of a multi-disciplinary team, focusing on *Safe Interaction for Robotics.* PhD candidates specialise in one of the following four areas, whilst gaining a deep understanding of technical aspects and theoretical foundations: 1. *Physical Interactions**: *control, actuation, compliance, sensing, mapping, planning, embodiments, swarms; 2. *People Interactions*: human-robot interaction, affective robotics, smart spaces, human-robot teaming, collaborative decision-making, cobots, multimodal interfaces; 3. *Self-Interactions*: condition monitoring, prognosis, explainable AI, certification, verification, safety, security, multi-agent interactions; 4. *Interaction Enablers*: vision, embedded and parallel computing, novel and soft fabrication methods, optimisation, (transparent) machine learning, deep reinforcement learning and other AI techniques inc. natural language processing (NLP). Achieving impact with robotics also requires non-technical skills, for example an understanding of technology translation, creativity and entrepreneurial processes. These are an essential component of the CDT programme, captured in the #Cauldron <https://www.edinburgh-robotics.org/content/cauldron> training programme. Why join us? · Flexible programme structure allows students to tailor courses to match research area of interest in year one, ensuring students have a strong general grounding in responsible research, current theory, methods and applications as a solid foundation for their PhD research. · Cohort approach with activities including group projects and away days encourages peer support and cross fertilisation of ideas. · Opportunity for international placement in prestigious research laboratory in year three. · Bespoke #Cauldron training programme to provide non-technical skills such as understanding of technology translation, creativity, and entrepreneurial processes. · Gateway seminars with prestigious speakers. · Fund to seed innovation. · Fully funded posts available paying stipend and Home fees, limited posts for overseas students More information on PhD placements and how to apply: www.edinburgh-robotics.org/apply *************** Prof. Ekaterina Komendantskaya Department of Computer Science School of Mathematical and Computer Sciences Earl Mountbatten Building [ building 21, office G26 ] Heriot-Watt University Edinburgh, UK, EH14 4AS +44 (0)131 451 8283 http://www.macs.hw.ac.uk/~ek19/ http://www.laiv.ac.uk

1 0

Compilers written in Haskell that generate assembly
by Vanessa McHale 17 Dec '20

17 Dec '20

Hi all, Have any of you written compilers or backends that generate assembly? Lots of projects seem to "end" at LLVM. I have a project (https://hackage.haskell.org/package/kempe) where I used something like maximal munch and a linear register allocator, but I was wondering if there was anything more sophisticated out there! So far I've found http://hackage.haskell.org/package/linearscan-hoopl also Cheers, Vanessa McHale

6 6