- Haskell-Cafe - Haskell.org

Second CFP: Higher-order, Typed, Inferred, Strict: ML Family Workshop
by oleg＠okmij.org 07 Apr '14

07 Apr '14

Higher-order, Typed, Inferred, Strict: ACM SIGPLAN ML Family Workshop Thursday September 4, 2014, Gothenburg, Sweden (immediately following ICFP and preceding OCaml Users and Developers Workshop) Call For Papers http://okmij.org/ftp/ML/ML14.html News: Post-proceedings will be published in EPTCS ML is a very large family of programming languages that includes Standard ML, OCaml, F#, SML#, Manticore, MetaOCaml, JoCaml, Alice ML, Dependent ML, Flow Caml, and many others. All ML languages, beside the great deal of syntax, share several fundamental traits. They are all higher-order, strict, mostly pure, and typed, with algebraic and other data types. Their type systems inherit from Hindley-Milner. The development of these languages has inspired a significant amount of computer science research and influenced a number of programming languages, including Haskell, Scala and Clojure, as well as Rust, ATS and many others. ML workshops have been held in affiliation with ICFP continuously since 2005. This workshop specifically aims to recognize the entire extended ML family and to provide the forum to present and discuss common issues, both practical (compilation techniques, implementations of concurrency and parallelism, programming for the Web) and theoretical (fancy types, module systems, metaprogramming). The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of the members of the ML family. We also encourage presentations from related languages (such as Scala, Rust, Nemerle, ATS, etc.), to exchange experience of further developing ML ideas. The ML family workshop will be held in close coordination with the OCaml Users and Developers Workshop. Format Since 2010, the ML workshop has adopted an informal model. Presentations are selected from submitted abstracts. There are no published proceedings, so any contributions may be submitted for publication elsewhere. We hope that this format encourages the presentation of exciting (if unpolished) research and deliver a lively workshop atmosphere. Each presentation should take 20-25 minutes, except demos, which should take 10-15 minutes. The exact time will be decided based on the number of accepted submissions. The presentations will likely be recorded. Post-conference proceedings The post-proceedings of selected papers from the ML Family and the OCaml Users and Developers workshops will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). The Program Committee shall invite interested authors of selected presentations to expand their abstract for inclusion in the proceedings. The submissions are to be reviewed according to the EPTCS standards. Coordination with the OCaml Users and Developers Workshop The OCaml workshop is seen as more practical and is dedicated in significant part to the OCaml community building and the evolution of the OCaml system. In contrast, the ML family workshop is not focused on any language in particular, is more research oriented, and deals with general issues of the ML-style programming and type systems. Yet there is an overlap, which we are keen to explore in various ways. The authors who feel their submission fits both workshops are encouraged to mention it at submission time or contact the Program Chairs. Scope We acknowledge the whole breadth of the ML family and aim to include languages that are closely related (although not by blood), such as Rust, ATS, Scala, Typed Clojure. Those languages have implemented and investigated run-time and type system choices that may be worth considering for OCaml, F# and other ML languages. We also hope that the exposure to the state of the art ML might favorably influence those related languages. Specifically, we seek research presentations on topics including but not limited to * Design: concurrency, distribution and mobility, programming for the web and embedded systems, handling semi-structured data, facilitating interactive programming, higher forms of polymorphism, generic programming, objects * Implementation: compilation techniques, interpreters, type checkers, partial evaluators, runtime systems, garbage collectors, etc. * Type systems: fancy types, inference, effects, overloading, modules, contracts, specifications and assertions, dynamic typing, error reporting, etc. * Applications: case studies, experience reports, pearls, etc. * Environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * Education: ML and ML-like languages in college or high-school, in general or computer science curriculum. Four kinds of submissions will be accepted: Informed Positions, Research Presentations, Experience Reports and Demos. * Informed Positions: A justified argument for or against a language feature. The argument must be substantiated, either theoretically (e.g., by a demonstration of (un)soundness, an inference algorithm, a complexity analysis), empirically or by a substantial experience. Personal experience is accepted as justification so long as it is extensive and illustrated with concrete examples. * Research Presentations: Research presentations should describe new ideas, experimental results, or significant advances in ML-related projects. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. These presentations should be structured in a way which can be, at least in part, of interest to (advanced) users. * Experience Reports: Users are invited to submit Experience Reports about their use of ML and related languages. These presentations do not need to contain original research but they should tell an interesting story to researchers or other advanced users, such as an innovative or unexpected use of advanced features or a description of the challenges they are facing or attempting to solve. * Demos: Live demonstrations or short tutorials should show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or applications built on or related to ML. (You will need to provide all the hardware and software required for your demo; the workshop organizers are only able to provide a projector.) Important dates Monday May 19 (any time zone): Abstract submission Monday June 30: Author notification Thursday September 4, 2014: ML Family Workshop Submission Submissions should be at most two pages, in PDF format, and printable on US Letter or A4 sized paper. A submission should have a synopsis (2-3 lines) and a body between 1 and 2 pages, in one- or two-column layout. The synopsis should be suitable for inclusion in the workshop program. Submissions must be uploaded to the workshop submission website before the submission deadline (Monday May 19, 2014). For any question concerning the scope of the workshop or the submission process, please contact the program chair. Program Committee Kenichi Asai Ochanomizu University, Japan Matthew Fluet Rochester Institute of Technology, USA Jacques Garrigue Nagoya University, Japan Dave Herman Mozilla, USA Stefan Holdermans Vector Fabrics, Netherlands Oleg Kiselyov (Chair) Monterey, CA, USA Keiko Nakata Tallinn University of Technology, Estonia Didier Remy INRIA Paris-Rocquencourt, France Zhong Shao Yale University, USA Hongwei Xi Boston University, USA

1 0

New Functional Programming Job Opportunities
by Functional Jobs 07 Apr '14

07 Apr '14

Here are some functional programming job opportunities that were posted recently: Server Game Developer at Quark Games http://functionaljobs.com/jobs/8701-server-game-developer-at-quark-games Infrastructure Engineer at Zeta Project Germany GmbH http://functionaljobs.com/jobs/8699-infrastructure-engineer-at-zeta-project… Cheers, Sean Murphy FunctionalJobs.com

1 0

ANN: Simon Marlow & Edward Kmett @ ZuriHac 2014
by Bas van Dijk 07 Apr '14

07 Apr '14

Dear Haskellers and ZuriHac 2014 attendees, On this lovely day (pun intended), I'm excited to announce that Simon Marlow and Edward Kmett will be giving talks at ZuriHac 2014. When: Friday 6 June 2014 - Sunday 8 June 2014 Where: Erudify offices, Zurich, Switzerland ZuriHac is an international Haskell hackathon: a grassroots, collaborative coding festival with a simple focus, to build and improve Haskell libraries, tools, and infrastructure. This is a great opportunity to meet your fellow Haskellers in real life, find new contributors for your project, improve existing libraries and tools, or even start new ones! 30 people already signed up for ZuriHac 2014 but there's still room for more. If you wish to attend, please register by filling in this form: http://bit.ly/ZuriHac2014 Full details can be found on the wiki page: http://www.haskell.org/haskellwiki/ZuriHac2014 We look forward to seeing you there! -- The organisers of ZuriHac 2014 ZuriHac 2014 is sponsored by Erudify & Google

3 4

GHC and platform versions
by Ian Zimmerman 06 Apr '14

06 Apr '14

On the Haskell Platform webpage, it tells me what GHC version I need for the latest/current version of the platform. Also, there are links to downloads for prior versions of the platform. But, how can I find out what GHC version I need for one of those older platform versions? That information doesn't seem to be on the page, and I see no README or similar file in the platform source tarball itself. -- Please *no* private copies of mailing list or newsgroup messages. gpg public key: 2048R/984A8AE4 fingerprint: 7953 ADA1 0E8E AB57 FB79 FFD2 360A 88B2 984A 8AE4 Funny pic: http://bit.ly/ZNE2MX

2 1

vim-hsimport: only consider modules of direct dependencies
by Daniel Trstenjak 05 Apr '14

05 Apr '14

Hi all, vim-hsimport[1] is a vim plugin that is able to automatically extend the import list of a haskell source file for the symbol under the cursor. It uses hdevtools[2] for finding the symbol in the modules of the installed packages and hsimport[3] for extending the import list. Until now vim-hsimport did consider all packages a project depends on, even if the package was only an indirect dependecy, not listed in the 'build-depends' field. So e.g. if a project directly and indirectly depends on the packages: base, containers, bytestring, binary, text and vector, and the modules for symbol 'foldl' have been requested, then the list of found modules might have been: Data.IntMap Data.IntMap.Lazy Data.IntMap.Strict Data.IntSet Data.Map Data.Map.Lazy Data.Map.Strict Data.Set Data.ByteString Data.ByteString.Char8 Data.ByteString.Lazy Data.ByteString.Lazy.Char8 Codec.Binary.UTF8.Generic Data.String.UTF8 Data.ByteString.UTF8 Data.ByteString.Lazy.UTF8 Data.Text Data.Text.Internal.Fusion.Common Data.Text.Lazy GHC.List Data.Foldable Data.List Prelude Data.Vector.Fusion.Stream.Monadic Data.Vector.Fusion.Stream Data.Vector.Generic Data.Vector.Primitive Data.Vector.Storable Data.Vector.Unboxed Data.Vector But if the project depends directly only on the packages: base and text, then only these modules are really relevant: Data.Text Data.Text.Internal.Fusion.Common Data.Text.Lazy GHC.List Data.Foldable Data.List Prelude This can be now achieved by using cabal-cargs[4] (>= 0.4) for the configuration of hdevtools. Please read the README[5] for detailed instructions. (One might argue, that even the modules Data.Text.Internal.Fusion.Common, GHC.List and Prelude might be left out, but that's another issue.) You might be also interested in a new feature of the 0.3 versions of hsimport and vim-hsimport. Before that version types have been always imported like: import SomeModule (Type) Now there's the option to choose between importing only the type or also importing all constructors/functions of the type: import SomeModule (Type(..)) If you're using hdevtools with the vim plugin syntastic[6] and have projects containing multiple sections (library/executable/testsuite ...) and each section has a separate 'hs-source-dirs', then you might get a more robust hdevtools behaviour by using this little change[7]. Happy Haskell hacking! :) Greetings, Daniel [1] https://github.com/dan-t/vim-hsimport [2] https://github.com/bitc/hdevtools [3] https://github.com/dan-t/hsimport [4] https://github.com/dan-t/cabal-cargs [5] https://github.com/dan-t/vim-hsimport/blob/master/README.md [6] https://github.com/scrooloose/syntastic [7] https://github.com/dan-t/syntastic/commit/7bd9b98342c93b7c7b06ddea199492331…

1 0

Ported a Python script for use with Go to Haskell
by Matt Joiner 05 Apr '14

05 Apr '14

It's been 3 years since my last attempt to use Haskell. I've ported a script from Python, I wonder if anyone might point out areas that I'm not doing things idiomatically for Haskell? I'm hoping to start using Haskell more in place of Go and Python. The Haskell script: http://pastebin.com/SxH3PXgG The original Python script if you're curious: http://pastebin.com/bqUVxB5d

4 6

Call for Contributions - Haskell Communities and Activities Report, May 2014 edition
by Mihai Maruseac 05 Apr '14

05 Apr '14

Dear all, I would like to collect contributions for the 24th edition of the ================================================================ Haskell Communities & Activities Report http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report Submission deadline: 1 May 2014 (please send your contributions to hcar at haskell.org, in plain text or LaTeX format) ================================================================ This is the short story: * If you are working on any project that is in some way related to Haskell, please write a short entry and submit it. Even if the project is very small or unfinished or you think it is not important enough --- please reconsider and submit an entry anyway! * If you are interested in an existing project related to Haskell that has not previously been mentioned in the HCAR, please tell me, so that I can contact the project leaders and ask them to submit an entry. * Feel free to pass on this call for contributions to others that might be interested. More detailed information: The Haskell Communities & Activities Report is a bi-annual overview of the state of Haskell as well as Haskell-related projects over the last, and possibly the upcoming six months. If you have only recently been exposed to Haskell, it might be a good idea to browse the previous edition --- you will find interesting projects described as well as several starting points and links that may provide answers to many questions. Contributions will be collected until the submission deadline. They will then be compiled into a coherent report that is published online as soon as it is ready. As always, this is a great opportunity to update your webpages, make new releases, announce or even start new projects, or to talk about developments you want every Haskeller to know about! Looking forward to your contributions, Mihai Maruseac and Alejandro Serrano Mena (current co-editors) FAQ: Q: What format should I write in? A: The required format is a LaTeX source file, adhering to the template that is available at: http://haskell.org/communities/05-2013/template.tex There is also a LaTeX style file at http://haskell.org/communities/05-2013/hcar.sty that you can use to preview your entry. If you do not know LaTeX, then use plain text. If you modify an old entry that you have written for an earlier edition of the report, you should already have received your old entry as a template (provided I have your valid email address). Please modify that template, rather than using your own version of the old entry as a template. Q: Can I include Haskell code? A: Yes. Please use lhs2tex syntax (http://people.cs.uu.nl/andres/lhs2tex/) The report is compiled in mode polycode.fmt. Q: Can I include images? A: Yes, you are even encouraged to do so. Please use .jpg format, then. Q: Should I send files in .zip archives or similar? A: No, plain file attachements are the way. Q: How much should I write? A: Authors are asked to limit entries to about one column of text. A general introduction is helpful. Apart from that, you should focus on recent or upcoming developments. Pointers to online content can be given for more comprehensive or "historic" overviews of a project. Images do not count towards the length limit, so you may want to use this opportunity to pep up entries. There is no minimum length of an entry! The report aims for being as complete as possible, so please consider writing an entry, even if it is only a few lines long. Q: Which topics are relevant? A: All topics which are related to Haskell in some way are relevant. We usually had reports from users of Haskell (private, academic, or commercial), from authors or contributors to projects related to Haskell, from people working on the Haskell language, libraries, on language extensions or variants. We also like reports about distributions of Haskell software, Haskell infrastructure, books and tutorials on Haskell. Reports on past and upcoming events related to Haskell are also relevant. Finally, there might be new topics we do not even think about. As a rule of thumb: if in doubt, then it probably is relevant and has a place in the HCAR. You can also ask the editor. Q: Is unfinished work relevant? Are ideas for projects relevant? A: Yes! You can use the HCAR to talk about projects you are currently working on. You can use it to look for other developers that might help you. Q: If I do not update my entry, but want to keep it in the report, what should I do? A: Tell the editor that there are no changes. The old entry will typically be reused in this case, but it might be dropped if it is older than a year, to give more room and more attention to projects that change a lot. Do not resend complete entries if you have not changed them. Q: Will I get confirmation if I send an entry? How do I know whether my email has even reached the editor, and not ended up in a spam folder? A: Prior to publication of the final report, the editor will send a draft to all contributors, for possible corrections. So if you do not hear from the editor within two weeks after the deadline, it is safer to send another mail and check whether your first one was received. -- Mihai Maruseac (MM) "If you don't know, the thing to do is not to get scared, but to learn." -- Atlas Shrugged.

1 0

scotty + aeson + ffi: optimising performance
by Miro Karpis 05 Apr '14

05 Apr '14

Hi, I have a C++ program that is doing some IO with one shared library (dll). I made a Haskell program that uses ffi for communicating with external dll. With scotty and aeson I made a web-service that communicates with the dll via REST-API (json). I was expecting that the performance would be a bit slower than the c++ internal dll calls, but I'm getting approx 3x slower performance in my haskell program. I tried to profile it but so far I can see that the bottleneck is Aeson (please correct me if I'm wrong). Is there a way how to optimise it? The data I'm sending via JSON are very small, so that can not be the problem. I have compiled the program with: ghc -O2 --make Service.hs -o eDS_FM -prof -auto-all -L. -lextlib Cheers, Miro profile: Fri Apr 04 23:57 2014 Time and Allocation Profiling Report (Final) eDS_FM.exe +RTS -p -RTS total time = 0.81 secs (810 ticks @ 1000 us, 1 processor) total alloc = 638,446,652 bytes (excludes profiling overheads) COST CENTRE MODULE %time %alloc MAIN MAIN 65.3 63.1 go/Number Data.Aeson.Encode 22.5 26.2 array_ Data.Aeson.Parser.Internal 7.0 6.6 tableArrayInDataToJSON.json FM.Json 1.5 0.9 go/Array Data.Aeson.Encode 1.4 1.1 individual inherited COST CENTRE MODULE no. entries %time %alloc %time %alloc MAIN MAIN 172 0 65.3 63.1 100.0 100.0 unstream/resize Data.Text.Fusion 419 7 0.0 0.0 0.0 0.0 main.arrayDouble Main 415 2158 0.0 0.2 0.0 0.2 main.retCodeInt Main 414 2158 0.0 0.0 0.0 0.0 main.dataOut Main 413 2158 0.0 0.0 0.0 0.0 getarray.paramLength FM.ModelIO 408 2158 0.0 0.0 0.0 0.0 getarray FM.ModelIO 407 2158 0.1 0.7 0.1 0.7 getarray.rowsReturnedInt FM.ModelIO 412 2158 0.0 0.0 0.0 0.0 getarray.arrayPtr FM.ModelIO 411 2158 0.0 0.0 0.0 0.0 main.resultInt Main 396 1 0.0 0.0 0.0 0.0 main.resultInt Main 395 1 0.0 0.0 0.0 0.0 setmodulestring FM.ModelIO 391 1 0.0 0.0 0.0 0.0 setmodulestring.setVarInArray FM.ModelIO 394 1 0.0 0.0 0.0 0.0 setmodulestring.cValueLength FM.ModelIO 393 1 0.0 0.0 0.0 0.0 setmodulestring.cParamLength FM.ModelIO 392 1 0.0 0.0 0.0 0.0 main.queryString Main 385 1 0.0 0.0 0.0 0.0 stringDataToJSON FM.Json 386 1 0.0 0.0 0.0 0.0 stringDataToJSON.json FM.Json 388 1 0.0 0.0 0.0 0.0 object_ Data.Aeson.Parser.Internal 389 0 0.0 0.0 0.0 0.0 jstring_ Data.Aeson.Parser.Internal 390 4 0.0 0.0 0.0 0.0 stringDataToJSON.retValue FM.Json 387 1 0.0 0.0 0.0 0.0 main.resultInt Main 382 290 0.0 0.0 0.0 0.0 go/Object Data.Aeson.Encode 379 2553 0.0 0.1 24.1 27.5 go/Array Data.Aeson.Encode 416 2158 1.2 0.8 21.7 26.2 go/Number Data.Aeson.Encode 418 63801 20.5 25.4 20.5 25.4 go/Number Data.Aeson.Encode 383 2656 0.1 0.1 0.1 0.1 string Data.Aeson.Encode 380 4814 0.1 0.1 2.2 1.1 go/Number Data.Aeson.Encode 384 0 1.9 0.8 2.0 1.0 go/Array Data.Aeson.Encode 417 0 0.1 0.2 0.1 0.2 break Data.Aeson.Encode 381 4814 0.1 0.0 0.1 0.0 setmoduletable FM.ModelIO 372 290 0.2 0.0 0.4 0.1 setmoduletable.cRows FM.ModelIO 376 290 0.0 0.0 0.0 0.0 setmoduletable.cColumns FM.ModelIO 375 290 0.0 0.0 0.0 0.0 setmoduletable.cParamLength FM.ModelIO 374 290 0.1 0.0 0.1 0.0 setmoduletable.cTable FM.ModelIO 373 290 0.0 0.0 0.0 0.0 main.queryString Main 363 290 0.0 0.0 9.6 7.7 tableArrayInDataToJSON FM.Json 364 290 0.0 0.0 9.6 7.7 tableArrayInDataToJSON.json FM.Json 366 290 1.5 0.9 9.6 7.7 object_ Data.Aeson.Parser.Internal 368 0 0.1 0.0 8.1 6.8 jstring_ Data.Aeson.Parser.Internal 369 1450 1.0 0.2 8.0 6.8 array_ Data.Aeson.Parser.Internal 371 0 7.0 6.6 7.0 6.6 tableArrayInDataToJSON.retValue FM.Json 365 290 0.0 0.0 0.0 0.0 main Main 345 0 0.2 0.7 0.2 0.7 run FM.ModelIO 398 0 0.0 0.0 0.0 0.0 run.result FM.ModelIO 405 103 0.0 0.0 0.0 0.0 run.timeTotal FM.ModelIO 404 103 0.0 0.0 0.0 0.0 run.retData FM.ModelIO 403 103 0.0 0.0 0.0 0.0 CAF GHC.Integer.Logarithms.Internals 343 0 0.0 0.0 0.0 0.0 CAF GHC.Float.ConversionUtils 340 0 0.0 0.0 0.0 0.0 CAF GHC.IO.Encoding.CodePage 327 0 0.0 0.0 0.0 0.0 CAF GHC.Conc.Windows 317 0 0.0 0.0 0.0 0.0 CAF GHC.TopHandler 315 0 0.0 0.0 0.0 0.0 CAF GHC.Float 312 0 0.0 0.0 0.0 0.0 CAF Data.Fixed 301 0 0.0 0.0 0.0 0.0 CAF GHC.IO.Handle.FD 299 0 0.0 0.0 0.0 0.0 CAF GHC.IO.Encoding 295 0 0.0 0.0 0.0 0.0 CAF GHC.IO.Exception 294 0 0.1 0.0 0.1 0.0 CAF Data.Text.Lazy.Builder.Int.Digits 282 0 0.0 0.0 0.0 0.0 CAF Data.Text.Lazy.Builder.Int 281 0 0.0 0.0 0.0 0.0 CAF Data.Text.Array 275 0 0.0 0.0 0.0 0.0 CAF Data.Text.Internal 274 0 0.0 0.0 0.0 0.0 CAF System.Locale 269 0 0.0 0.0 0.0 0.0 CAF Data.Scientific 268 0 0.0 0.0 0.0 0.0 CAF Data.Time.LocalTime.TimeOfDay 265 0 0.0 0.0 0.0 0.0 CAF Data.Time.Clock.POSIX 263 0 0.0 0.0 0.0 0.0 CAF Data.Aeson.Parser.Internal 256 0 0.0 0.0 0.0 0.0 array_ Data.Aeson.Parser.Internal 370 1 0.0 0.0 0.0 0.0 object_ Data.Aeson.Parser.Internal 367 1 0.0 0.0 0.0 0.0 CAF Blaze.ByteString.Builder.HTTP 249 0 0.0 0.0 0.0 0.0 CAF Network.HTTP.Types.Header 227 0 0.0 0.0 0.0 0.0 CAF Network.HTTP.Types.URI 226 0 0.0 0.0 0.0 0.0 CAF Network.HTTP.Types.Status 225 0 0.0 0.0 0.0 0.0 CAF Network.HTTP.Types.Method 224 0 0.0 0.0 0.0 0.0 CAF Network.Socket 220 0 0.0 0.0 0.0 0.0 CAF Network.Wai.Parse 211 0 0.0 0.0 0.0 0.0 CAF Network.Wai.Handler.Warp.RequestHeader 203 0 0.0 0.0 0.0 0.0 CAF Network.Wai.Handler.Warp.ResponseHeader 202 0 0.0 0.0 0.0 0.0 CAF Network.Wai.Handler.Warp.Date 199 0 0.0 0.0 0.0 0.0 CAF Network.Wai.Handler.Warp.Request 197 0 0.0 0.0 0.0 0.0 CAF Network.Wai.Handler.Warp.Response 196 0 0.0 0.0 0.0 0.0 CAF Network.Wai.Handler.Warp.Recv 194 0 0.0 0.0 0.0 0.0 CAF Network.Wai.Handler.Warp.Header 193 0 0.0 0.0 0.0 0.0 CAF Network.Wai.Handler.Warp.Types 191 0 0.0 0.0 0.0 0.0 CAF Network.Wai.Handler.Warp.Settings 189 0 0.0 0.0 0.0 0.0 CAF Web.Scotty.Trans 187 0 0.0 0.0 0.0 0.0 CAF Web.Scotty.Route 186 0 0.0 0.0 0.0 0.0 CAF Web.Scotty.Types 185 0 0.0 0.0 0.0 0.0 unstreamChunks/inner Data.Text.Lazy.Fusion 349 0 0.0 0.0 0.0 0.0 unstreamChunks/outer Data.Text.Lazy.Fusion 350 1 0.0 0.0 0.0 0.0 CAF Web.Scotty.Action 184 0 0.0 0.0 0.0 0.0 unstreamChunks/outer Data.Text.Lazy.Fusion 353 4 0.0 0.0 0.0 0.0 unstreamChunks/inner Data.Text.Lazy.Fusion 354 28 0.0 0.0 0.0 0.0 unstreamChunks/resize Data.Text.Lazy.Fusion 355 5 0.0 0.0 0.0 0.0 CAF Main 182 0 0.0 0.0 0.0 0.0 unstreamChunks/outer Data.Text.Lazy.Fusion 406 1 0.0 0.0 0.0 0.0 main.resultInt Main 360 1 0.0 0.0 0.0 0.0 main Main 344 1 0.0 0.0 0.0 0.0 go/Object Data.Aeson.Encode 357 1 0.0 0.0 0.0 0.0 go/Number Data.Aeson.Encode 361 1 0.0 0.0 0.0 0.0 string Data.Aeson.Encode 358 1 0.0 0.0 0.0 0.0 go/Number Data.Aeson.Encode 362 0 0.0 0.0 0.0 0.0 break Data.Aeson.Encode 359 1 0.0 0.0 0.0 0.0 unstreamChunks/outer Data.Text.Lazy.Fusion 346 10 0.0 0.0 0.0 0.0 unstreamChunks/inner Data.Text.Lazy.Fusion 347 104 0.0 0.0 0.0 0.0 unstreamChunks/resize Data.Text.Lazy.Fusion 348 20 0.0 0.0 0.0 0.0 CAF FM.Json 180 0 0.1 0.0 0.1 0.0 unstream/resize Data.Text.Fusion 356 14 0.0 0.0 0.0 0.0 CAF FM.ModelIO 179 0 0.0 0.0 0.0 0.0 getarray FM.ModelIO 409 0 0.0 0.0 0.0 0.0 getarray.rows FM.ModelIO 410 1 0.0 0.0 0.0 0.0 run.timeTot FM.ModelIO 399 1 0.0 0.0 0.0 0.0 run FM.ModelIO 397 1 0.0 0.0 0.0 0.0 run.runType FM.ModelIO 402 1 0.0 0.0 0.0 0.0 run.timeNow FM.ModelIO 401 1 0.0 0.0 0.0 0.0 run.timeTot FM.ModelIO 400 0 0.0 0.0 0.0 0.0 setmoduletable FM.ModelIO 377 0 0.0 0.0 0.0 0.0 setmoduletable.firstTimeStepAfterRestart FM.ModelIO 378 1 0.0 0.0 0.0 0.0 initfm FM.ModelIO 351 1 0.0 0.0 0.0 0.0

2 2

What's the status of regular patterns?
by ducis 05 Apr '14

05 Apr '14

The package description of haskell-src-exts says "Apart from these standard extensions, it also handles regular patterns as per the HaRP extension as well as HSX-style embedded XML syntax." So is this HaRP extension still alive in any way? The harp package seems to have nothing to do with syntax and long-abandoned.

1 0

Happybara
by Charles Strahan 04 Apr '14

04 Apr '14

Hey all, I've started a clone of the popular Ruby project "Capybara". Of course, it being written in Haskell, I just had to name it Happybara. It's in the early stages, but I think it's quickly coming together. Here's the mission plan: - Custom build hook to compile capybara-webkit's webkit_server (DONE) - High level interface to webkit_server (DONE) - Design Driver type-class, along with monadic DSL class - Queries/actions built atop the underlying Driver/DSL - Write instances/wrappers for hs-webdriver and others If you're interested, check out development here: https://github.com/cstrahan/happybara Oh, and a personal plug: who's hiring? :) -Charles

2 1