- Haskell-Cafe - Haskell.org

Re: [Haskell-cafe] Haskell type declaration summary
by Andrew Butterfield 04 May '17

04 May '17

Hi Kevin, yes - I can do that, but it is tedious to issue each command, and I may not remember what all the types are called (I know that :browse will tell me what things exist in the current module with a capital letter) Also I want to be able to do this for a file different to the one currently loaded in GHCi. Something along the lines of (assuming a unix shell): $> showtypes MyBigMonsterHaskellFile.hs data X = A | B type Name = String newtype Y = Z Name .... $> (maybe with a blank line for each one..) Has no-one rustled up something like this - or do I need to look into Haskell parsing...? Cheers, Andrew > On 4 May 2017, at 16:30, Kevin Quick <quick(a)sparq.org> wrote: > > > You can use ghci's browse: > > $ ghci > Prelude> import Data.Maybe > Prelude Data.Maybe> :browse Data.Maybe > ... > Prelude Data.Maybe> :l MyFile.hs > MyFile Data.Maybe> :browse MyFile > ... > > Andrew Butterfield writes: > >> Dear Haskellers, >> any quick and easy way to extract all the type declarations from a Haskell source file? >> (for easy reference) >> >> Regards, >> >> Andrew Butterfield >> School of Computer Science & Statistics >> Trinity College >> Dublin 2, Ireland >> >> _______________________________________________ >> 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. > Andrew Butterfield School of Computer Science & Statistics Trinity College Dublin 2, Ireland

1 0

How should I view this file? It looks like literate Haskell but isn't that file type.
by Jeffrey Brown 04 May '17

04 May '17

I am looking at Text.Markdown. The Types.hs file[1] looks like it's got comments that are meant to be viewed as some form other than plain text -- for instance, , msAddHeadingId :: Bool -- ^ If @True@, an @id@ attribute is added to the heading tag with the value equal to -- the text with only valid CSS identifier characters. -- -- > ## Executive Summary -- -- > <h2 id="executive-summary">Executive Summary</h2> -- -- Default: @False@ -- -- Since 0.1.13 I thought it might be literate Haskell, but the file ends in .hs, not .lhs. How should I view it? Preferably in Emacs? [1] https://github.com/snoyberg/markdown/blob/master/Text/Markdown/Types.hs -- 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>

5 5

customize ghci error msg
by Johannes Waldmann 04 May '17

04 May '17

Dear Cafe. I have a "stack repl" which loads 841 modules in ghci. I have to do :set prompt "> " because the default prompt shows all modules loaded, and I never see a value or an error message without an enourmous amount of scrolling. But, even with this prompt - when I get some error on ":r", ghci says "... Failed, modules loaded: ..." and again I have to scroll back five miles. How could I change this message? - Thanks, J.W. https://downloads.haskell.org/~ghc/latest/docs/html/users_guide/ghci.html#g…

1 0

Re: [Haskell-cafe] [Biohaskell] hash map/associative structure
by Ketil Malde 04 May '17

04 May '17

> I know it may be a long shot, but did you consider using columnar data store like Apache Arrow? Arrow might be an option, but is there a Haskell interface? (Googling gives the obvious hits regarding arrows, and Google doesn't seem to care about me adding +apache to the search, it gives me result where "+apache" is overstruck.) > Without knowing more about your application it is a bit difficult to produce more hints. > What is your application? The short story is that I extract a number of 64-bit values from my data, and want to maintain frequency counts for each unique value. So there'll be on the order of 10^9 (plus/minus an order of magnitude) unique values, with counts ranging from one to a few million (and large values being rare). The long explanation is that I'm doing k-mer counts for molecular sequences, breaking DNA sequence data into overlapping words of fixed size (the parameter k), and counting their occurrences. I encode them as Word64, using two bits per nucleotide (the alphabet is A, C, G, and T). This is of course a fairly staple thing to do, and there is no lack of alternative programs that do it - but I'd like mine to work anyway, and it annoys me to have run into this particular bug. Whether it is my own fault, in the Judy FFI, the GHC runtime or libraries, the libjudy code, GHC compilation issues, or a hardware error. -k -- If I haven't seen further, it is by standing in the footprints of giants

1 0

Foldable for (,)
by Jonathon Delgado 04 May '17

04 May '17

I sent the following post to the Beginners list a couple of weeks ago (which failed to furnish an actual concrete example that answered the question). Upon request I'm reposting it to Café: I've seen many threads, including the one going on now, about why we need to have: length (2,3) = 1 product (2,3) = 3 sum (2,3) = 3 or (True,False) = False but the justifications all go over my head. Is there a beginner-friendly explanation for why such seemingly unintuitive operations should be allowed by default?

16 34

Typing Haskell in Haskell experience
by Christopher Done 03 May '17

03 May '17

I’ve been working through Typing Haskell in Haskell in detail ( https://gist.github.com/chrisdone/0075a16b32bfd4f62b7b) and I noticed that if I change e.g. SourcePrelude.hs from the Hackage package ( http://hackage.haskell.org/package/thih) to have a declaration like this: [("printZ", Just (Forall [] ([] :=> (tString))), [([], ap [econst showMfun, econst (("Z" :>: toScheme (TCon (Tycon "Nat" Star))))])])], In other words printChar = show (Z :: Nat) Where Z is neither defined nor an instance of Show, it type checks just fine. If I replace it with e.g. toScheme (TVar(Tyvar "k" Star)) i.e. “some thing of type k“, then it complains that the instance is ambiguous, which is true. So it seems that THIH will accept any type as an instance of any class without complaint as long as all the type variables have been filled in with the correct kind. This came as a surprise to me, as I’m using it in a project. There is apparently code in the type checker that pays attention to the class environment, and you provide instances to it, but it doesn’t seem to care what instances are provided or not. I believe I’ll have to do some extra work to check that the instances actually exist and are full resolved. I can’t tell whether this is a bug or intended behavior. I tried emailing the author of THIH but his email bounced back. Frankly the actual interesting bit of the type checker — the bit where we resolve class instances — is actually the hardest bit for me to read and the bit I’d like more exposition on. I’ve written a tokenizer, parser, renamer and thanks to THIH an inferer, and a stepper in a small dialect of Haskell I’m calling Duet. There’s an example here: http://chrisdone.com/toys/duet-gamma/ You can see the problem illustrated if you type e.g. the following in the top-left: data Nat = Z | S Natmain = show Z The type inferred is: main = ((show :: (Show Nat) => Nat -> String) (Z :: Nat) :: (Show Nat) => String) Which is at least enough information for me to do a lookup and insert an instance dictionary. But I sort of would have expected the type checker to say “no instance”. It does explicitly say that you have to do your own dependency analysis and renamer, but the instance part isn’t clear to me. Oh, and you also have to write your own kind inference for data type declarations. Who knew implementing a Haskell was so involved? So beware future travelers… THIH is awesome, but these are the things I’ve found missing. Ciao!

2 4

ANNOUNCE: graphviz 2999.19.0.0
by Ivan Lazar Miljenovic 03 May '17

03 May '17

I've just released a new version of my Haskell bindings to the Graphviz graph visualisation toolkit. Note that the major version bump is solely because I had to remove what I thought was a useful feature (trying to allow you to do things like `"a" --> ["b", "c", "d"]` in Monadic graphs by automagically converting the "a" into ["a"]) turned out not to work in practice (as people will typically use this with literal values, but when combined with OverloadedStrings results in GHC getting confused as to what the type is). So unless you actually managed to use this functionality, then the API remains the same as 2999.18.* and you should just be able to bump your upper versions in your .cabal files (which you all do, right)? -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com http://IvanMiljenovic.wordpress.com

1 0

Cabal and IPv6
by Serguey Zefirov 02 May '17

02 May '17

I have found that Cabal does not work on IPv6-only networks (which my machine happen to be part of). The problem is basically this: "ping hackage.haskell.org" does not resolve host while "ping6 hackage.haskell.org" does. Thus cabal cannot do anything useful on that machine. Do anyone have a solution for that? I was unable to find any on the internet. ;)

6 9

Final call for papers: Trends in Functional Programming, 19-21 june 2017, University of Kent, Canterbury
by Peter Achten 01 May '17

01 May '17

----------------------------- F I N A L C A L L F O R P A P E R S ----------------------------- ======== TFP 2017 =========== 18th Symposium on Trends in Functional Programming 19-21 June, 2017 University of Kent, Canterbury https://www.cs.kent.ac.uk/events/tfp17/index.html The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below). Authors of draft papers will be invited to submit revised papers based on the feedback receive at the symposium. A post-symposium refereeing process will then select a subset of these articles for formal publication. TFP 2017 will be the main event of a pair of functional programming events. TFP 2017 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on 22 June. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in * Edinburgh (Scotland) in 2003; * Munich (Germany) in 2004; * Tallinn (Estonia) in 2005; * Nottingham (UK) in 2006; * New York (USA) in 2007; * Nijmegen (The Netherlands) in 2008; * Komarno (Slovakia) in 2009; * Oklahoma (USA) in 2010; * Madrid (Spain) in 2011; * St. Andrews (UK) in 2012; * Provo (Utah, USA) in 2013; * Soesterberg (The Netherlands) in 2014; * Inria Sophia-Antipolis (France) in 2015; * and Maryland (USA) in 2016. For further general information about TFP please see the TFP homepage. (http://www.tifp.org/) == SCOPE == The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarizing work with respect to a trendy subject Articles must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include, but are not limited to: Functional programming and multicore/manycore computing Functional programming in the cloud High performance functional computing Extra-functional (behavioural) properties of functional programs Dependently typed functional programming Validation and verification of functional programs Debugging and profiling for functional languages Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. Interoperability with imperative programming languages Novel memory management techniques Program analysis and transformation techniques Empirical performance studies Abstract/virtual machines and compilers for functional languages (Embedded) domain specific languages New implementation strategies Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2017 program chairs, Scott Owens and Meng Wang. == BEST PAPER AWARDS == To reward excellent contributions, TFP awards a prize for the best paper accepted for the formal proceedings. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, that paper will then receive both prizes. == PAPER SUBMISSIONS == Acceptance of articles for presentation at the symposium is based on a lightweight peer review process of extended abstracts (4 to 10 pages in length) or full papers (20 pages). The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate which authors are research students, and whether the main author(s) are students. A draft paper for which ALL authors are students will receive additional feedback by one of the PC members shortly after the symposium has taken place. We use EasyChair for the refereeing process. Papers must be submitted at: https://easychair.org/conferences/?conf=tfp17 Papers must be written in English, and written using the LNCS style. For more information about formatting please consult the Springer LNCS web site: http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 == INVITED SPEAKERS == Conor McBride University of Strathclyde (UK) Cătălin Hriţcu INRIA Paris (FR) == IMPORTANT DATES == Submission of draft papers: 5 May, 2017 Notification: 12 May, 2017 Registration: 11 June, 2017 TFP Symposium: 19-21 June, 2017 Student papers feedback: 29 June, 2017 Submission for formal review: 2 August, 2017 Notification of acceptance: 3 November, 2017 Camera ready paper: 2 December, 2017 == PROGRAM COMMITTEE == Co-Chairs Meng Wang University of Kent (UK) Scott Owens University of Kent (UK) PC Jeremy Yallop University of Cambridge (UK) Nicolas Wu University of Bristol (UK) Laura Castro University of A Coruña (ES) Gabriel Scherer Northeastern University (US) Edwin Brady University of St Andrews (UK) Janis Voigtländer Radboud University Nijmegen (NL) Peter Achten Radboud University Nijmegen (NL) Tom Schrijvers KU Leuven (BE) Matthew Fluet Rochester Institute of Technology (US) Mauro Jaskelioff CIFASIS/Universidad Nacional de Rosario (AG) Patricia Johann Appalachian State University (US) Bruno Oliveira The University of Hong Kong (HK) Rita Loogen Philipps-Universität Marburg (GE) David Van Horn University of Marylan (US) Soichiro Hidaka Hosei University (JP) Michał Pałka Chalmers University of Technology (SE) Sandrine Blazy University of Rennes 1 - IRISA (FR)

1 0

hash map/associative structure
by Ketil Malde 30 Apr '17

30 Apr '17

Hi, I've been using Judy arrays as a fast and even more importatnly, compact associative structure. Infortunately, I'm getting occasional segfaults, and I'm unable to find anything wrong with my code. Others also report something similar. The Debian maintainer of libjudy made a version without some dubious optimizations, but that didn't help...at least not substantially. So the question is, what is a good replacement? I just need Word64 -> Integral, but again, I expect to fill all of main memory with data, so memory compactness is important. Anything using trees and boxed values (e.g. Data.IntMap and friends) out. I only need to be able to insert, modify (add one), and finally extract the key-value pairs (e.g. 'elems'). Any suggestions? -k -- If I haven't seen further, it is by standing in the footprints of giants

2 1