- Haskell-Cafe - Haskell.org

From function body to DAG and back again?
by Mario Lang 14 Dec '22

14 Dec '22

Hi. I have a binary instance for a file format[1] which describes a graph of DSP primitives. This DAG was generated from a function body[2] (in another programming language). I think that language can be boiled down to a pure language with let expressions, to allow an output to be consumed by several inputs. And there the trouble starts. I am working on this without the usual theoretical background. I am not a PLD student, I am a self-taught Haskell fan. The function body is basically a very neat way to make a DAG readable without using visualisation. Since I am blind, this topic has always fascinated me. Since I have this bidirectional binary instance, and Haskell is supposed to be great at writing small languages, I wonder what would be required to * write a decompiler which would generate a version of the original function body as a data structure and * write a compiler which would translate that data structure back to the graph. This is very much for my own learning experience, especially since there is already a Haskell library which implements at least the compilation part, and more. However, I always found it very fascinating to try to understand how this translation works, so I'd finally like to take a stab at implementing it myself. I have now searched a day for matching learning material which would shed some light on the problem for me, without any great success. Most SLC-examples I stumbled across immediately proceed to implement an evaluation fucntion, which is not quite what I need. For both directions, I need to work out the data structure for my small language first, which is where I am stuck. I have a feeling the decompiler might be easier to write then the compiler. My intuition says all I need to do is work backwards from the last graph node, resolving all inputs until I am done. However, I am stuck on the data structure and the compiler part. Any hints on what could help me to get a better grasp on the problem and how to solve it in Haskell are greatly appreciated. [1] https://github.com/mlang/sound-supercollider/blob/master/Sound/SuperCollide… [2] SynthDef(\default, { arg out=0, freq=440, amp=0.1, pan=0, gate=1; var z = LPF.ar( Mix.new( VarSaw.ar(freq + [0, Rand(-0.4,0.0), Rand(0.0,0.4)], 0, 0.3, 0.3) ), XLine.kr(Rand(4000,5000), Rand(2500,3200), 1) ) * Linen.kr(gate, 0.01, 0.7, 0.3, 2); OffsetOut.ar(out, Pan2.ar(z, pan, amp)); }, [\ir]).writeDefFile; Which translates to the following graph. The pairs are inputs, pointing at the corresponding outputs in the graph, -1 refering to the list of constants at the beginning. defaultSynthDef :: SynthDef defaultSynthDef = SynthDef [ GraphDef "default" [-0.4,0.0,0.4,0.3,4000.0,5000.0,2500.0,3200.0,1.0,1.0e-2,0.7,2.0] [0.0,440.0,0.1,0.0,1.0] [("out",0),("freq",1),("amp",2),("pan",3),("gate",4)] [ UGen "Control" Scalar 0 [] [Scalar] , UGen "Control" Control 1 [] [Control,Control,Control,Control] , UGen "VarSaw" Audio 0 [(1,0),(-1,1),(-1,3)] [Audio] , UGen "BinaryOpUGen" Audio 2 [(2,0),(-1,3)] [Audio] , UGen "Linen" Control 0 [(1,3),(-1,9),(-1,10),(-1,3),(-1,11)] [Control] , UGen "Rand" Scalar 0 [(-1,0),(-1,1)] [Scalar] , UGen "BinaryOpUGen" Control 0 [(1,0),(5,0)] [Control] , UGen "VarSaw" Audio 0 [(6,0),(-1,1),(-1,3)] [Audio] , UGen "BinaryOpUGen" Audio 2 [(7,0),(-1,3)] [Audio] , UGen "Rand" Scalar 0 [(-1,1),(-1,2)] [Scalar] , UGen "BinaryOpUGen" Control 0 [(1,0),(9,0)] [Control] , UGen "VarSaw" Audio 0 [(10,0),(-1,1),(-1,3)] [Audio] , UGen "BinaryOpUGen" Audio 2 [(11,0),(-1,3)] [Audio] , UGen "Sum3" Audio 0 [(12,0),(8,0),(3,0)] [Audio] , UGen "Rand" Scalar 0 [(-1,4),(-1,5)] [Scalar] , UGen "Rand" Scalar 0 [(-1,6),(-1,7)] [Scalar] , UGen "XLine" Control 0 [(14,0),(15,0),(-1,8),(-1,1)] [Control] , UGen "LPF" Audio 0 [(13,0),(16,0)] [Audio] , UGen "BinaryOpUGen" Audio 2 [(17,0),(4,0)] [Audio] , UGen "Pan2" Audio 0 [(18,0),(1,2),(1,1)] [Audio,Audio] , UGen "OffsetOut" Audio 0 [(0,0),(19,0),(19,1)] [] ] [] ] -- CYa, ⡍⠁⠗⠊⠕

2 1

Some questions on Atkey-style indexed monads
by Nicolas Trangez 04 Dec '22

04 Dec '22

All, For some project, I'm considering (again) to use an indexed state monad, which are now somewhat ergonomic to use with QualifiedDo. When looking into existing packages exposing relevant types/classes, I had some questions: 1. These packages provide something like ``` class IxFunctor f where imap :: (a -> b) -> f i j a -> f i j b class IxFunctor f => IxApplicative f where ... ``` Is this `IxFunctor` actually required/useful? It seems to me the implementation of `imap` for some `IxFunctor f` would be equal to `fmap` in the `Functor` implementation for `forall i j. f i j`. Hence, can `IxFunctor` be dropped in lieu of ``` class (forall i j. Functor (f i j)) => IxApplicative f where ... ``` 2. Existing packages predate MonadFail and QualifiedDo. The latter requires (in some cases) an implementation of `fail` and `mfix` to be provided by the module also providing `>>=` etc. I was wondering whether or not there need to be (or can be) `IxMonadFail` and `IxMonadFix` classes like ``` class IxMonad m => IxMonadFail m where ifail :: String -> m i j a class IxMonad m => IxMonadFix m where ifix :: (a -> m i j a) -> m i j a ``` I'm not sure it "makes sense" to have an `ifail` which returns an `m i j a` vs. having only a `MonadFail` (and hence `fail`) implementation for `m i i` only, taking into account the requirement for `fail f >>= k` to be equal to `fail f`, hence `ifail f >>=: k` to be equal to `ifail f`. I think the above question boils down to: is there any use in having `ifail :: String -> m i j a` next to `fail :: String -> m i i a`, or should (i)fail always be state-type-preserving? Similar doubts about `IxMonadFix m` vs. `MonadFix (m i i)`. Thanks for any insights, Nicolas

2 2

TFPIE 2023 call for submissions (deadline Dec 27th)
by Elena Machkasova 03 Dec '22

03 Dec '22

Trends in Functional Programming in Education (TFPIE) 2023 Call for papers https://wiki.tfpie.science.ru.nl/TFPIE2023 (January 12th 2023, Boston, MA, USA, co-located with TFP 2023 and followed by POPL 2023) TFPIE 2023 welcomes submissions describing techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. 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. In addition, the speaker can provide commentary on effectiveness or student feedback. 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=tfpie2023 After the workshop, presenters are invited to submit (a revised version of) their article for the formal 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. Important Dates Submission deadline: December 27th 2022, Anywhere on Earth. Notification: December 30th 2022 (Note: earlier submissions will receive earlier response) TFPIE Registration Deadline: see https://trendsfp.github.io/register.html Workshop: January 12th 2023 Submission for formal review: April 19th 2023, Anywhere on Earth. Notification of full article: May 24th 2023 Camera ready: July 1st 2023 Program Committee Christopher Anand - McMaster University, Canada Attila Egri-Nagy - Akita International University, Japan Jason Hemann - Seton Hall University, USA Kevin Kappelmann - Technical University of Munich, Germany Elena Machkasova (Chair) - University of Minnesota Morris, USA Kristina Sojakova - INRIA, France Jørgen Villadsen - Technical University of Denmark, Denmark Invited Speaker: Shriram Krishnamurthi, Brown University Registration information: See https://wiki.tfpie.science.ru.nl/TFPIE2023 for updated information. Registration and attendance are mandatory for at least one author of every paper that is presented at the workshop. Only papers that have been presented at TFPIE may be submitted to the post-reviewing process. -- Dr. Elena Machkasova Associate Professor of Computer Science Division of Science and Mathematics University of Minnesota, Morris Office: Sci 2325 (320) 589-6308 http://cda.morris.umn.edu/~elenam/ Pronouns: she/her/hers or any other

1 0

How to create a list of each constructor value
by PICCA Frederic-Emmanuel 03 Dec '22

03 Dec '22

Hello, I have a type like this data InputType = CristalK6C | MarsFlyscan | MarsSbs | SixsFlyMedH | SixsFlyMedV | SixsFlyMedVEiger | SixsFlyMedVS70 | SixsFlyScanUhv | SixsFlyScanUhv2 | SixsFlyScanUhvTest | SixsFlyScanUhvUfxc | SixsSbsFixedDetector | SixsSbsMedH | SixsSbsMedV | SixsSbsMedVFixDetector deriving (Eq, Show) I want to create a list of each values in order to create meaningfull error message for the user and simplify my Arbitrary instances. I do not want to type two time the values. instance Arbitrary InputType where arbitrary = oneof (map pure [ CristalK6C , MarsFlyscan , MarsSbs , SixsFlyMedH , SixsFlyMedV , SixsFlyMedVEiger , SixsFlyMedVS70 , SixsFlyScanUhv , SixsFlyScanUhv2 , SixsFlyScanUhvTest , SixsFlyScanUhvUfxc , SixsSbsFixedDetector , SixsSbsMedH , SixsSbsMedV , SixsSbsMedVFixDetector ] ) Thanks for your help Frederic

7 12

Debugging a test suite freeze
by David Feuer 01 Dec '22

01 Dec '22

The logict-sequence test suite consistently freezes up on the last test when compiled with GHC 9.4.3. logict-sequence and its test suite don't do anything special with that GHC/base version as far as I can see, or anything particularly strange in general, so I'm pretty confident the problem lies elsewhere. My best guesses are hedgehog, tasty, and tasty-hedgehog. Has anyone else run into weird issues with any/all of these on GHC 9.4.3? David

3 7

ANN: hledger 1.28
by Simon Michael 01 Dec '22

01 Dec '22

I'm pleased to announce hledger 1.28 ! https://github.com/simonmichael/hledger/releases/1.28 https://hledger.org/install https://hledger.org/release-notes.html#hledger-1-28 Nothing earth-shaking for users in this release, but internal changes and the usual incremental improvements. Highlights: new hledger-ui screens and default screen; new hledger-move, watchaccounts scripts. Thank you to release contributors Felix Yan, Patrick Fiaux. What is hledger ? - Fast, reliable, free, multicurrency, double-entry, plain text accounting[1] software that runs on unix, mac, windows, and the web - Built around human-readable, version-controllable plain text files - Inspired by and largely compatible with Ledger CLI[2]; convertible to and from Beancount[3] - Written in Haskell for correctness and longevity. For help getting started, or more info, see https://hledger.org and join our chat via Matrix or IRC: https://hledger.org/support Newcomers, experts, contributors, sponsors, feedback are welcome! Aloha, -Simon [1] https://plaintextaccounting.org [2] https://ledger-cli.org [3] https://beancount.github.io

1 0

FOSDEM Haskell devroom: we need proposals!
by Fraser Tweedale 30 Nov '22

30 Nov '22

Previously: https://mail.haskell.org/pipermail/haskell-cafe/2022-November/135674.html **We need more proposals! We need your help!** FOSDEM 2023 will be held on 4 & 5 February 2023, in Brussels. For more information see the [official site](https://fosdem.org/2023/). The Haskell devroom (specialist track) will take place on Sunday 5 February, from 13:10 to 17:00 UTC+1. This is an amazing opportunity to promote Haskell, and functional programming generally, to a legion of free software developers and enthusiasts. But right now, we are not even close to filling our schedule. If we don't fill our ~4 hour schedule, the Haskell devroom will not happen. Therefore we are extending our Call for Proposals until Saturday 2022-12-10. We are also now welcoming proposals for tutorials/workshops and longer presentations (up to 45 minutes). Shorter presentations are still welcome, of course. So if you want to propose an introductory workshop, install fest, hack session, or something similar, have at it. You can also help by sharing our CFP far and wide, and encourage specific people you think might have something interesting to present, to submit a proposal. Thanks, Fraser Tweedale

1 0

Call for Haskell.org Committee Nominations
by Ida Bzowska 29 Nov '22

29 Nov '22

Dear Haskellers, The Haskell.org Committee is happy to announce that we are opening the call for nominations for new members. Details can be found [here <https://discourse.haskell.org/t/call-for-haskell-org-committee-nominations-…> ]. You can nominate yourself or your friend! If you have any questions, don't hesitate to ask. λCheers Ida Bzowska

1 0

Writing and testing a Storable instance for a record wrapping ForeignPtrs
by Hécate 29 Nov '22

29 Nov '22

Hi everyone, In a fit of madness I have found myself writing Haskell code where I need to implement a Storable instance. However, by virtue of not being a C programmer, I'm fairly lost on some of the details, especially the value of the sizeOf and alignment methods. My Haskell-level record is the following: data SignedMessage = SignedMessage { messageLength :: CSize , messageForeignPtr :: ForeignPtr CUChar , signatureForeignPtr :: ForeignPtr CUChar } Here is the code of the Storable instance: https://gist.github.com/Kleidukos/31346d067f309f2a86cbd97a85c0f1e8#file-sig… And so I used `hedgehog-classes` to test the Storable instance. However, all the tests fail with the same reason: Prelude.undefined: https://gist.github.com/Kleidukos/31346d067f309f2a86cbd97a85c0f1e8#file-und… The main problem (and that's certainly a red herring for me) is that the `undefined` call comes frombase:Foreign.Marshal.Array. Which shouldn't be a problem, as it is not supposed to be evaluated! Yet apparently it is. If you're interested to see the full code, it's located here: https://github.com/haskell-cryptography/libsodium-bindings/blob/add-sel-pac… I'm not sure how to proceed from here. What would be a good angle to approach this? Cheers, Hécate -- Hécate ✨ 🐦: @TechnoEmpress IRC: Hecate WWW: https://glitchbra.in RUN: BSD

5 10

PhD and post-doc positions in Mainz, Germany
by Erdweg, Sebastian 25 Nov '22

25 Nov '22

We have multiple open positions for PhD students and post-docs in the PL Group of the University of Mainz in Germany. The available positions include a gross monthly salary of ~4000 Euro. Our team meets and socializes in Mainz; remote work is an option. The PL Group at the University of Mainz was founded in 2019. Our goal is to support developers in creating and maintaining software systems that are easier to write, more secure, run faster, and consume less energy. Our current research topics include: -- Incremental computing: How can a computation react to a change of its input efficiently? We have observed up to 10,000x speedups in prior work, can incrementality help us save as much energy? Can we build a new foundation for incremental computing to support a wider range of computations? -- WebAssembly: How can we discover and prevent security vulnerabilities in WebAssembly? We have built a data-flow analysis platform for WebAssembly to identify properties of WebAssembly programs at compile time. Can this platform be used to protect WebAssembly users while also optimizing the code for performance? -- Datalog: How can the power of Datalog best be exploited in modern software development? How can we abstract over and hide the technicalities of Datalog, for example, by compiling DSLs to Datalog. And how can we optimize Datalog code to provide truly declarative performance, without exposing users to details of the underlying database technology? -- Language engineering: How can we build programming-language tools with modest effort and without duplicating the language's semantics? For example, can we derive type checkers, debuggers, and other editor services from the language’s semantics? And does this require a language workbench or can we support rich services for embedded languages as well? Mainz is part of the Frankfurt Metropolitan Area and only a short train ride away from Frankfurt's international community and culture. Mainz itself lies at the confluence of the Rhine and Main rivers, surrounded by plenty of nature. https://mainz.de/en/worth-seeing/reasons-to-love-mainz.php I'm excited to hear from interested candidates via email. If you know potential candidates, please forward this message to them. Sebastian Erdweg https://www.pl.informatik.uni-mainz.de/erdweg

1 0