- Haskell-Cafe - Haskell.org

Cobertura from .tix/.mix
by Paul 24 Aug '18

24 Aug '18

Hello, Cafe! Is any tool to generate Cobertura from .tix/.mix files? As I understand they are serialized Mix and Tix types from HPC related libraries, but better to avoid coding and to use ready tool :)

1 0

GHC gets simpler!?
by Jeffrey Brown 24 Aug '18

24 Aug '18

I just flipped through the list of accepted GHC proposals[1]. I feel like a kid in a candy shop. I am particularly excited to see the large fraction of proposals that look like either simplifications or homogenizations (making the language more uniform): * Make Constraint not apart from Type * Allow signatures on pattern synonym constructors * Explicit foralls ("Permit ``forall ...`` to bind type variables after the word ``instance`` ...") * Remove the * kind syntax * Allow ScopedTypeVariables to refer to types * Treat kind and type vars identically with `forall` * Embrace (Type :: Type) ("This proposal expands the meaning of -XPolyKinds to include -XTypeInType, deprecates -XTypeInType, and advocates for using Type in place of *.") At various times, I have tried to explore the GHC extensions thoroughly -- well enough to know which ones will let you do what, so that I can learn the right one in detail when I need to. I have always turned back; the space seems too big to cover, and only growing. But now I see that GHC hosts competing forces of simplification and complication. This might be a squishy question, but I'm interested in your feelings regarding how navigable the space of extensions is, and whether you think balkanization is a problem, and how you expect those qualities to evolve. [1] https://github.com/ghc-proposals/ghc-proposals/pulls?page=2&q=label%3AAccep… -- Jeff Brown | Jeffrey Benjamin Brown Website <https://msu.edu/~brown202/> | Facebook <https://www.facebook.com/mejeff.younotjeff> | LinkedIn <https://www.linkedin.com/in/jeffreybenjaminbrown>(spammy, so I often miss messages here) | Github <https://github.com/jeffreybenjaminbrown>

1 0

How to express constraint succeeded?
by Paul 23 Aug '18

23 Aug '18

Hello, Dear Cafe! I have expression 'True ~ 'True in right hand side of type level function. Is some "constant" for the same?

2 2

CFP: 4th International Workshop on Real World Domain Specific Languages
by Simon Thompson 23 Aug '18

23 Aug '18

Apologies for any duplicates! CALL FOR PAPERS 4th International Workshop on Real World Domain Specific Languages https://sites.google.com/site/realworlddsl In conjunction with The International Symposium on Code Generation and Optimisation 2019. http://cgo.org/cgo2019/ Washington DC, USA, 16th February, 2019 As the use of computers proliferates, the complexity and variety of systems continues to grow. As a result, it is becoming increasingly inflexible to "hard wire” behaviours into software. Software developers can enable more control over their software configurations by exploiting Domain Specific Languages (DSLs). Such DSLs provide a systematic way to structure the underlying computational components: to coin a phrase, a DSL is a library with syntax. There is an enormous variety of DSLs for a very wide range of domains. Most DSLs are highly idiosyncratic, reflecting both the specific natures of their application domains and their designers’ own preferences. This workshop will bring together constructors of DSLs for “real world” domains; that is, DSLs intended primarily to aid in building software to solve real world problems rather than to explore the more theoretical aspects of language design and implementation. We are looking for submissions that present the motivation, design, implementation, use and evaluation of such DSLs. Previous workshops were RWSDL’16 (Barcelona), RWDSL’17 (Austin) and RWDSL’18 (Vienna), all collocated with CGO and published in the ACM Digital Library. Key Dates: Paper submission deadline: 9th November 2018 Author notification: 7th December 2018 Final manuscript due: 11th January 2019 Workshop: 16th February 2019 Submission Instructions: The EasyChair submission page for this workshop is: https://easychair.org/conferences/?conf=rwdsl19 Accepted submissions will be published in the ACM Digital Library within its International Conference Proceedings Series. Submissions should be 8-10 pages in ACM double-column format. Authors should follow the information for formatting ACM SIGPLAN conference papers, which can be found at http://www.acm.org/publications/proceedings-template. Full submission details are on the workshop web page. Program Chairs Rob Stewart, Heriot-Watt University, UK Greg Michaelson, Heriot-Watt University, UK PC Members Allin Cottrell, Wake Forest University, USA Nina Dethlefs, University of Hull, UK Andy Gill, X – The Moonshot Factory, USA Kevin Hammond, University of St Andrews, UK Patrick Maier, University of Glasgow, UK Mathijs Schuts, Phillips Healthcare, Netherlands Simon Thompson, University of Kent, UK Phil Trinder, University of Glasgow, UK Contact Please email inquiries concerning the workshop to: R.Stewart(a)hw.ac.uk

1 0

Access violation when stack haddock haskell-src-exts since LTS 12.0
by Yuji Yamamoto 23 Aug '18

23 Aug '18

I always get an " Access violation in generated code when reading 0x28900000" error when executing > stack haddock haskell-src-exts since LTS 12.0. I'm not sure to which project I should submit a bug report. GHC? Haddock? Or Stack? And how can I make a smaller case to reproduce the same error? I attached a log when executing with --verbose --cabal-verbose for your info. -- 山本悠滋 twitter: @igrep GitHub: https://github.com/igrep GitLab: https://gitlab.com/igrep Facebook: http://www.facebook.com/igrep Google+: https://plus.google.com/u/0/+YujiYamamoto_igrep

8 11

ANN: leancheck-v0.7.2, enumerative QuickCheck-like testing
by Rudy Matela 22 Aug '18

22 Aug '18

Hello Haskell-Café, LeanCheck is a simple enumerative property-based testing library for Haskell. It is highly portable, and even works on Hugs98 (v2006-09). It does not pull any dependencies other than what's bundled with GHC. Check it out on Hackage and GitHub: https://hackage.haskell.org/package/leancheck https://github.com/rudymatela/leancheck A simple example follows: > import Test.LeanCheck > import Data.List (sort, union) > check $ \xs -> sort (sort xs) == sort (xs::[Int]) +++ OK, passed 200 tests. > check $ \xs ys -> xs `union` ys == ys `union` (xs::[Int]) *** Failed! Falsifiable (after 4 tests): [] [0,0] LeanCheck works on all types that are instances of the Listable typeclass. A TH automatic deriver is provided with LeanCheck so you don't need to learn LeanCheck's DSL to test with your types. I recently released 0.7.2, there are several additions since last announcement here. Notable changes include: * minor fixes for loading on Hugs98; * functions to compute statistics about generated values; and * a family of functions to test invariants of typeclass instances: > data MyTy = ... > instance ... MyTy where ... > import Test.LeanCheck.Utils > check $ (okEqOrd :: MyTy -> MyTy -> MyTy -> Bool) +++ OK, passed 200 tests. > check $ (okNum :: MyTy -> MyTy -> MyTy -> Bool) +++ OK, passed 200 tests. LeanCheck is available on Hackage or Stackage, and can be installed using: $ cabal install leancheck As far as I am aware, there are no bindings to use LeanCheck with tasty, test-framework or hspec yet, but contributions are welcome. I may create bindings for those if I ever get the time. Best Regards, Rudy

1 0

how do FFI calls show up in profiling info?
by Johannes Waldmann 22 Aug '18

22 Aug '18

Dear Cafe, how would FFI calls show up in profiles? I am using hmatrix-glpk. The relevant FFI call is in https://hackage.haskell.org/package/hmatrix-glpk-0.19.0.0/docs/src/Numeric.… I am compiling with profiling (for executables and libraries), and I am running with +RTS -P . The .prof file does not contain c_simplex_sparse (the C function) It does mention simplexSparse (the Haskell function that calls it) but with a suspiciously low time. - J.W.

2 1

DSLDI 2018: Extended Call for Talk Proposals
by Sam Tobin-Hochstadt 21 Aug '18

21 Aug '18

We've extended the deadline for DSLDI talk proposals until the 24th. ********************************************************************* EXTENDED CALL FOR TALK PROPOSALS DSLDI 2018 Sixth Workshop on Domain-Specific Language Design and Implementation November 6th, 2018 Boston, USA Co-located with SPLASH http://2018.splashcon.org/track/dsldi-2018-talks https://twitter.com/wsdsldi ********************************************************************* Deadline for talk proposals: 24th of August, 2018, AoE Well-designed and implemented domain-specific languages (DSLs) can achieve both usability and performance benefits over general-purpose programming languages. By raising the level of abstraction and exploiting domain knowledge, DSLs can make programming more accessible, increase programmer productivity, and support domain-specific optimizations. ## Workshop Goal Domain-Specific Language Design and Implementation (DSLDI) is a workshop intended to bring together researchers and practitioners interested in discussing how DSLs should be designed, implemented, supported by tools, and applied in realistic contexts. The focus of the workshop is on all aspects of this process, from soliciting domain knowledge from experts, through the design and implementation of the language, to evaluating whether and how a DSL is successful. More generally, we are interested in continuing to build a community that can drive forward the development of modern DSLs. ## Workshop Format DSLDI is a single-day workshop and will consist of an invited speaker followed by moderated audience discussions structured around a series of short talks. The role of the talks is to facilitate interesting and substantive discussion. Therefore, we welcome and encourage talks that express strong opinions, describe open problems, propose new research directions, and report on early research in progress. Proposed talks should be on topics within DSLDI’s area of interest, which include but are not limited to: * solicitation and representation of domain knowledge * DSL design principles and processes * DSL implementation techniques and language workbenches * domain-specific optimizations * human factors of DSLs * tool support for DSL users * community and educational support for DSL users * applications of DSLs to existing and emerging domains * studies of usability, performance, or other benefits of DSLs * experience reports of DSLs deployed in practice ## Call for Talk Proposals We solicit talk proposals in the form of short abstracts (max. 2 pages). A good talk proposal describes an interesting position, open problem, demonstration, or early achievement. The submissions will be reviewed on relevance and clarity, and used to plan the mostly interactive sessions of the workshop day. Publication of accepted abstracts and slides on the website is voluntary. * Deadline for talk proposals: August 17th, 2018 * Notification: September 17th, 2018 * Workshop: November 6th, 2018 * Submission website: https://dsldi18.hotcrp.com/ ## Workshop Organization Co-chairs: * Sam Tobin-Hochstadt (samth(a)indiana.edu) Indiana University * Lindsey Kuper (lindsey(a)composition.al) University of California, Santa Cruz Follow us on Twitter at https://twitter.com/wsdsldi Program committee: * Eric Van Wyk (University of Minnesota) * Katherine Ye (Carnegie Mellon University) * Nate Foster (Cornell University) * Spencer Florence (Northwestern University) * Phitchaya Mangpo Phothilimthana (University of California, Berkeley) * Jeremy Gibbons (University of Oxford) * Edwin Brady (University of St. Andrews)

1 0

Six new assistant/associate professor positions in Nottingham
by Graham Hutton 21 Aug '18

21 Aug '18

Dear all, The School of Computer Science at the University of Nottingham is seeking to make multiple new appointments (potentially up to 6) at the Assistant or Associate Professor level: https://www.nottingham.ac.uk/jobs/currentvacancies/ref/SCI190718 Applications in the area of the Functional Programming (FP) lab would be most welcome. The FP lab is keen to receive applications from candidates with an excellent publication record and the ability to secure external funding to support their research. Further information about the FP lab is available from: https://www.nottingham.ac.uk/research/groups/fp-lab/ The deadline for applications is 30th September 2018. The advert mentions some specific research areas, but the positions are open to applicants from any area of Computer Science. Best wishes, Graham Hutton — Professor Graham Hutton School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~pszgmh This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law.

1 0

Re: [Haskell-cafe] Is there a library that has a strict version of `sum`?
by Damian Nadales 19 Aug '18

19 Aug '18

Ok, so if understood the bottom line of the answers I got from Vanessa and Hiromi the take away seems to be: if you're prototyping then stick to the lazy version of sum, otherwise use more advanced data structures (Vectors or Folds). On Tue, Aug 14, 2018 at 5:18 PM Vanessa McHale <vanessa.mchale(a)iohk.io> wrote: > Actually, vector has a sum function already: > http://hackage.haskell.org/package/vector-0.12.0.1/docs/Data-Vector.html#v:… > > It's strict, and I'd guess more efficient than foldl' on lists. > > On 08/14/2018 09:44 AM, Vanessa McHale wrote: > > To be more explicit: unless you've actually benchmarked sum vs sum' this > seems to be a premature optimization and you'd be better off just using the > stock sum with a sensible data structure. > > On 08/14/2018 09:40 AM, Damian Nadales wrote: > > > > On Tue, Aug 14, 2018 at 4:25 PM Vanessa McHale <vanessa.mchale(a)iohk.io> > wrote: > >> If you'd rather import a custom prelude instead of writing `sum = foldl' >> (+) 0` you might want to think about how dependencies affect maintaining a >> package. >> >> What's the actual problem you're trying to solve? >> > Just add a list of values. I was expecting such a function to be already > defined somewhere else. > > Personally, in terms of cognitive complexity I find `sum` less complex > than `fold' (+) 0`... > > >> >> On 08/14/2018 04:09 AM, Damian Nadales wrote: >> >> I thought the answer would be easy to find on the internet, but I cannot >> find any package that features a strict version of `sum`. >> >> Do you know if such a function is defined anywhere? (like a custom >> prelude for instance) >> >> I know it is trivial to define, but I would prefer not to repeat myself >> (and somebody else). >> >> Thanks! >> >> >> _______________________________________________ >> 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. >> >> _______________________________________________ >> 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. > > > -- > > > > *Vanessa McHale* > Functional Compiler Engineer | Chicago, IL > > Website: www.iohk.io <http://iohk.io> > Twitter: @vamchale > PGP Key ID: 4209B7B5 > > [image: Input Output] <http://iohk.io> > > [image: Twitter] <https://twitter.com/InputOutputHK> [image: Github] > <https://github.com/input-output-hk> [image: LinkedIn] > <https://www.linkedin.com/company/input-output-global> > > > This e-mail and any file transmitted with it are confidential and intended > solely for the use of the recipient(s) to whom it is addressed. > Dissemination, distribution, and/or copying of the transmission by anyone > other than the intended recipient(s) is prohibited. If you have received > this transmission in error please notify IOHK immediately and delete it > from your system. E-mail transmissions cannot be guaranteed to be secure or > error free. We do not accept liability for any loss, damage, or error > arising from this transmission > > > -- > > > > *Vanessa McHale* > Functional Compiler Engineer | Chicago, IL > > Website: www.iohk.io <http://iohk.io> > Twitter: @vamchale > PGP Key ID: 4209B7B5 > > [image: Input Output] <http://iohk.io> > > [image: Twitter] <https://twitter.com/InputOutputHK> [image: Github] > <https://github.com/input-output-hk> [image: LinkedIn] > <https://www.linkedin.com/company/input-output-global> > > > This e-mail and any file transmitted with it are confidential and intended > solely for the use of the recipient(s) to whom it is addressed. > Dissemination, distribution, and/or copying of the transmission by anyone > other than the intended recipient(s) is prohibited. If you have received > this transmission in error please notify IOHK immediately and delete it > from your system. E-mail transmissions cannot be guaranteed to be secure or > error free. We do not accept liability for any loss, damage, or error > arising from this transmission >

13 20