- Haskell - Haskell.org

The deadlines for paper submission have been extended (ICFEM 2011)
by Huibiao Zhu 04 Apr '11

04 Apr '11

************************************************************ ICFEM 2011: 13th International Conference on Formal Engineering Methods Last CALL FOR PAPERs 25-28 Oct 2011 Radisson BLU Hotel, Durham, UK URL: http://www.scm.tees.ac.uk/icfem2011 The deadlines for paper submission have been extended. Abstract Submission: 14 April, 2011 (New) Full-paper submission: 21 April, 2011 (New) ************************************************************ Since 1997, ICFEM has provided a forum for those interested in the application of formal engineering methods to computer systems. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, and to help advance the state of the art. We are interested in work that has been incorporated into real production systems, and in theoretical work thatpromises to bring practical, tangible benefit. ICFEM 2011 is organised by Teesside University and will be held in the historic Durham City in the North East of England (http://www.thisisdurham.com/) AREA AND TOPICS Submissions related to the following principal themes are encouraged, but any topics relevant to the field of formal methods and their support environments will also be considered: * Abstraction and refinement * Formal specification and modelling * Software verification * Program analysis * Software model checking * Formal approaches to software testing * Formal methods for object and component systems * Concurrency and software transaction memory * Formal methods for cloud computing * Software inspection * Formal methods for cyber-physical systems * Tool development and integration * Software safety, security and reliability * Experiments involving verified systems * Applications of formal methods * Formal model-based development and code generation SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. The proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English and not exceed 16 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Submission should be done through the ICFEM 2011 submission page (https://www.easychair.org/conferences/?conf=icfem2011) handled by the EasyChair conference system. All queries should be sent to the e-mail address icfem2011(a)scm.tees.ac.uk. IMPORTANT DATES 14 April, 2011: Extended Abstract submission deadline (Firm) 21 April, 2011: Extended Full-paper submission deadline (Firm) 8 June, 2011: Acceptance/rejection notification 6 July, 2011: Camera-ready version due ORGANIZATION COMMITTEE Honorary Chairs: Marc Cavazza, Teesside University Cliff Hardcastle, Teesside University General Chairs: Phil Brooke, Teesside University, UK Cliff Jones, Newcastle University, UK Program Chairs: Shengchao Qin, Teesside University, UK Zongyan Qiu, Peking University, UK Program Committee: Bernhard K. Aichernig (Graz University of Technology, Austria) Keijiro Araki (Kyushu University, Japan) Farhad Arbab (CWI and Leiden University, The Netherlands) Richard Banach (University of Manchester, UK) Nikolaj Bjorner (Microsoft Research Redmond, USA) Jonathan P. Bowen (University of Westminster, UK) Michael Butler (University of Southampton, UK) Andrew Butterfield (Trinity College Dublin, Ireland) Ana Cavalcanti (University of York, UK) Aziem Chawdhary (University of Edinburgh, UK) Wei-Ngan Chin (National University of Singapore, Singapore) Florin Craciun (Soter Sys, Romania) Thao Dang (French National Center for Scientific Research, France) Jim Davies (Oxford University, UK) Dino Distefano (Queen Mary College, University of London, UK) Jin-Song Dong (National University of Singapore, Singapore) Zhenhua Duan (Xidian University, China) Colin Fidge (Queensland University of Technology, Australia) J. S. Fitzgerald (Newcastle University, UK) Leo Freitas (Newcastle University, UK) Joaquim Gabarro (Universitat Politecnica de Catalunya, Spain) Stefania Gnesi (ISTI-CNR, Italy) Anthony Hall (Consultant) Ian J. Hayes (The University of Queensland, Australia) Mike Hinchey (Lero, Ireland) Zhenjiang Hu (National Institute of Informatics, Japan) Michael Jackson (Consultant) Thierry Jeron (INRIA , France) Gerwin Klein (NICTA, Australia) Laura Kovacs (Vienna University of Technology, Austria) Kim G. Larsen (Aalborg University, Denmark) Peter Gorm Larsen (Aarhus University, Denmark) Michael Leuschel (Heinrich-Heine Universitat Dusseldorf, Germany) Xuandong Li (Nanjing University, China) Shaoying Liu (Hosei University, Japan) Zhiming Liu (UNU/IIST, Macau) Tiziana Margaria (University of Potsdam, Germany) Dominique Mery (Nancy University and LORIA, France) Stephan Merz (INRIA Nancy & LORIA, France) Huaikou Miao (Shanghai University, China) Peter Muller (ETH Zurich, Switzerland) Jun Pang (University of Luxembourg, Luxembourg) Matthew Parkinson (Microsoft Research Cambridge, UK) Geguang Pu (East China Normal University, China) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) Augusto Sampaio (Universidade Federal de Pernambuco, Brazil) Thomas Santen (European Microsoft Innovation Center Aachen, Germany) Wuwei Shen (Western Michigan University, USA) Marjan Sirjani (Reykjavik University, Iceland) Bill Stoddart (Teesside University, UK) Jing Sun (University of Auckland, New Zealand) Jun Sun (Singapore University of Technology and Design, Singapore) Meng Sun (Peking University, China) Kenji Taguchi (AIST, Japan) Tetsuo Tamai (University of Tokyo, Japan) Yih-Kuen Tsay (National Taiwan University, Taiwan) T.H. Tse (University of Hong Kong, Hong Kong) Viktor Vafeiadis (MPI-SWS, Germany) Miroslav Velev (Aries Design Automation, USA) Laurent Voisin (Systerel, France) Hai H. Wang (Aston University, UK) Ji Wang (National University of Defense Technology, China) Linzhang Wang (Nanjing University, China) Heike Wehrheim (University of Paderborn, Germany) Jim Woodcock (University of York, UK) Wang Yi (Uppsala University, Sweden) Hongli Yang (Beijing University of Technology, China) Naijun Zhan (Chinese Academy of Sciences, China) Jian Zhang (Chinese Academy of Sciences, China) Hong Zhu (Oxford Brookes University, UK) Huibiao Zhu (East China Normal University, China) Steering Committee Keijiro Araki, Japan Jin Song Dong, Singapore Chris George, Canada Jifeng He, China Mike Hinchey, Ireland Shaoying Liu (Chair), Japan John McDermid, UK Tetsuo Tamai, Japan Jim Woodcock, UK

1 0

ANNOUNCE: FreeType 2 Bindings
by Jason Dagit 03 Apr '11

03 Apr '11

I'm excited to announce the immediate availability of FreeType 2 bindings on hackage. These bindings are based off the 2.4.4 release of FreeType 2 and use the BSD licensing option for FreeType 2. This package should be of interest to OpenGL users as it provides a way to get nice looking fonts into your OpenGL programs. This binding is still in its infancy, hence version 0.0.1, but enough of the API is exposed that I was able to convert the example1.c program in the FreeType tutorial to Haskell. Here are a few relevant links: * What is FreeType: http://www.freetype.org/freetype2/index.html * Example program and tutorial: * http://www.freetype.org/freetype2/docs/tutorial/step1.html * http://www.freetype.org/freetype2/docs/tutorial/example1.c * Haskell version of tutorial: * https://github.com/dagit/freetype2/blob/cabalization/Main.hs * Example program output (yes, their tutorial example really does draw the bitmap as a grid of text, scroll around to find the word "blah"), more interesting examples to come later: * http://hpaste.org/45239/aoeu The current API level is "raw" and makes no attempts to present a good Haskell-like interface to the library. My plan is to build a higher level interface on top once a sufficient portion of the API is available to Haskell. You can find the source on github in the cabalization branch: * https://github.com/dagit/freetype2 Patches welcome! Thanks, Jason

1 1

Call for contributions: Second edition of the Typeclassopedia
by Brent Yorgey 03 Apr '11

03 Apr '11

Hi all, It's time for a second edition of the Typeclassopedia [1], and I'd love to have your suggestions and contributions. You can send me suggestions and darcs patches [2] by email. For more detailed information, see my blog post [3]. -Brent [1] http://www.haskell.org/wikiupload/8/85/TMR-Issue13.pdf [2] http://code.haskell.org/~byorgey/typeclassopedia/ [3] http://byorgey.wordpress.com/2011/04/03/call-for-contributions-second-editi…

1 0

ANNOUNCE: Database Supported Haskell (DSH) 0.5.5
by George Giorgidze 31 Mar '11

31 Mar '11

I'm pleased to announce the release of DSH-0.5.5 [1]. What's new in this release -------------------- * Support for sum types * Database execution of all functions from Data.Maybe and Data.Either Cheers, George [1] http://hackage.haskell.org/package/DSH

1 0

tfp2011: last CFP
by Henrik Nilsson 31 Mar '11

31 Mar '11

Sorry for any duplicate copies. /Henrik

1 0

Haskell Weekly News: Issue 175
by Daniel Santa Cruz 31 Mar '11

31 Mar '11

Welcome to issue 175 of the HWN, a newsletter covering developments in the [1]Haskell community. This release covers the week of March 20 - 26. You can find the HTML version at: http://bit.ly/gs9Rr8 Announcements Wren Ng Thornton [2]announced the release of unix-bytestring: Unix/Posix-specific functions for ByteStrengs. John Lato [3]announced an incremental update to the ListLike package. "This version adds newtype wrappers for strict and lazy ByteString, CharString, and CharStringLazy..." Mario Blazevic [4]announced the release of incremental-parser, which provides the usual set of Applicative and monad combinators with a few twists that make it unique. Duncan Coutts [5]announced the release of version 0.16.3 of c2hs, the FFI preprocessor tool. Jeff Wheeler [6]announced a new release of Yi, the text editor written in and extensible in Haskell. Christiaan Baaij [7]announced an incremental upgrade to 0.1.3.0 to CLaSH. Mario Blazevic [8]announced updates to monad-parallel, monad-coroutine, and SCC (Streaming Component Combinators). John Millikin [9]announced an update to enumerator to version 0.4.8. Quotes of the Week * Squarism: wo utilizing any tricks, i want 20 miljon rabbits to mate with each other once.. how many mate event will there be * mm_freak: using combinators instead of explicit recursion can be justified with about the same reasoning as using 'while' instead of explicit 'goto' in imperative programming * monochrom: <$> is pronounced Jacquelin von Brionée * geheimdienst: what does a pirate say when starting a sentence, then suddenly being hit in the nadgers? arr- ow! * monochrom: 1985 is way more than a decade ago * copumpkin: matlab is horrible as far as language design goes[.] it's fairly convenient for doing stuff in but I need to shower after every time I use it Top Reddit Stories * Debugging trick From (self.haskell), scored 60 with 11 comments. Read on [10]reddit. * Your friendly Haskell JSON library's encoding performance just got 4x faster From (serpentine.com) scored 45 with 2 comments. Read on [12]reddit. Read the [13]original post. * A monad for deterministic parallelism (ICFP'2011 submission) From (community.haskell.org) scored 41 with 8 comments. Read on [14]reddit. Read the [15]original post. * Haskell servers benchmarked against node/ruby/python/php/java. From (docs.yesodweb.com) scored 36 with 12 comments. Read on [16]reddit. Read the [17]original post. * The Yesod Framework and the Case of the Eight Level Monad Transformer Stack From (docs.yesodweb.com) scored 35 with 16 comments. Read on [18]reddit. Read the [19]original post. * Improving Persistent Performance (Yesod Blog) From (docs.yesodweb.com) scored 29 with 1 comments. Read on [20]reddit. Read the [21]original post. * Fast, clean Haskell bindings to Google's Snappy library From (hackage.haskell.org) scored 22 with 8 comments. Read on [22]reddit. Read the [23]original post. * Open Quark on Github (Haskell like Lang on the JVM) From (github.com) scored 15 with 3 comments. Read on [24]reddit. Read the [25]original post. * EclipseFP 2.0.4 released: supports GHC 7 From (jpmoresmau.blogspot.com) scored 15 with 7 comments. Read on [26]reddit. Read the [27]original post. * Demonstrating a Time Leak in Arrowized FRP From (blog.edwardamsden.com) scored 14 with 12 comments. Read on [28]reddit. Read the [29]original post. Top StackOverflow Answers * [30]Reading large file in haskell ? votes: 19 The construct "seq x x" is always useless. If y = seq x x and I force y then this forces x then returns x. This is equivalent to y=x and forcing y. Thus "seq forceEval forceEval" does nothing more than "forceEval". The error with your use of a fold is a common one. You are using a fold to perform a count of the bytes in the input. You should be using ... * [31]What to call a function that splits lists? votes: 12 I believe the function you're describing is breakBefore from the list-grouping package. Data.List.Grouping: http://hackage.haskell.org/packages/archive/list-grouping/0.1.1/doc/html/Da… st-Grouping.html ghci:: breakBefore even [3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3,2,3,8,4,6,2,6] [[3,1],[4,1,5,9],[2],[6,5,3,5],[8,9,7,9,3],[2,3],[8],[4],[6],[2],[6]] Top StackOverflow Questions * [32]Haskell record syntax votes: 16, answers: 1 * [33]Reading large file in haskell? votes: 12, answers: 1 * [34]Haskell laziness - how do I force the IO to happen sooner? votes: 9, answers: 3 * [35]case on monadic value votes: 7, answers: 2 * [36]Simplest way to find which data types are most garbage collected? votes: 7, answers: 2 About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. I'm in dire need of finding good "quotes of the week". If you happen to come across any, please don't hesitate to send it along. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.libraries/15484 3. http://article.gmane.org/gmane.comp.lang.haskell.general/18590 4. http://article.gmane.org/gmane.comp.lang.haskell.libraries/15492 5. http://article.gmane.org/gmane.comp.programming.c2hs/247 6. http://article.gmane.org/gmane.editors.yi.devel/5346 7. http://article.gmane.org/gmane.comp.lang.haskell.general/18592 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/87540 9. http://article.gmane.org/gmane.comp.lang.haskell.libraries/15506 10. http://www.reddit.com/r/haskell/comments/gbd7w/debugging_trick/ 12. http://www.reddit.com/r/haskell/comments/g8s0t/your_friendly_haskell_json_l… 13. http://www.serpentine.com/blog/2011/03/22/a-new-week-a-new-json-performance… 14. http://www.reddit.com/r/haskell/comments/gainp/a_monad_for_deterministic_pa… 15. http://community.haskell.org/~simonmar/papers/monad-par.pdf 16. http://www.reddit.com/r/haskell/comments/g7uia/haskell_servers_benchmarked_… 17. http://docs.yesodweb.com/blog/preliminary-warp-cross-language-benchmarks 18. http://www.reddit.com/r/haskell/comments/ga40w/the_yesod_framework_and_the_… 19. http://docs.yesodweb.com/blog/hamlet-lucius-widgets 20. http://www.reddit.com/r/haskell/comments/gbz43/improving_persistent_perform… 21. http://docs.yesodweb.com/blog/improving-persistent-performance 22. http://www.reddit.com/r/haskell/comments/ga080/fast_clean_haskell_bindings_… 23. http://hackage.haskell.org/package/snappy 24. http://www.reddit.com/r/haskell/comments/g7vcj/open_quark_on_github_haskell… 25. https://github.com/levans/Open-Quark 26. http://www.reddit.com/r/haskell/comments/g8du0/eclipsefp_204_released_suppo… 27. http://jpmoresmau.blogspot.com/2011/03/eclipsefp-204-released-supports-ghc-… 28. http://www.reddit.com/r/haskell/comments/g943x/demonstrating_a_time_leak_in… 29. http://blog.edwardamsden.com/2011/03/demonstrating-time-leak-in-arrowized.h… 30. http://stackoverflow.com/questions/5410777/reading-large-file-in-haskell/54… 31. http://stackoverflow.com/questions/5438558/what-to-call-a-function-that-spl… 32. http://stackoverflow.com/questions/5367167/haskell-record-syntax 33. http://stackoverflow.com/questions/5410777/reading-large-file-in-haskell 34. http://stackoverflow.com/questions/5373883/haskell-laziness-how-do-i-force-… 35. http://stackoverflow.com/questions/5395517/case-on-monadic-value 36. http://stackoverflow.com/questions/5410345/simplest-way-to-find-which-data-…

1 0

SLE 2011 - Deadline extension
by João Fernandes 30 Mar '11

30 Mar '11

============================================================ * DEADLINE EXTENSION * SLE 2011 4th International Conference on Software Language Engineering Braga, Portugal, 3-6 July 2011 http://planet-sl.org/sle2011/ ============================================================= PAPER SUBMISSION DEADLINE EXTENSION The paper submission deadline has been *extended* and is now set to April, 15th --------------------------------------------------------- INVITED SPEAKERS SLE 2011 is proud to announce the following invited speakers. Krzysztof Czarnecki is associate professor at the University of Waterloo and industrial research chair at Bank of Nova Scotia / NSERC. Before coming to Waterloo, he spent eight years at DaimlerChrysler Research working on the practical applications of generative programming. His current work focuses on realizing the synergies between generative and model-driven software development. Paul Klint is head of the software engineering department at Centrum Wiskunde en Informatica in Amsterdam, full professor in Computer Science at the University of Amsterdam and theme leader of Software Analysis and Transformation at CWI. His research interests include generic language technology, domain-specific languages, software renovation, and technology transfer. --------------------------------------------------------- CO-LOCATED EVENTS The following events will take place together with SLE 2011: Summer School on Generative and Transformational Techniques in Software Engineering (GTTSE) * http://gttse.wikidot.com/2011 Coupled Software Transformations Workshop (CSXW) * http://www.di.univaq.it/CSXW2011/ Industry Track of Software Language Engineering (ITSLE) * http://planet-sl.org/itsle2011/ Workshop on Transforming and Weaving Ontologies and MDE (TWOMDE) * http://planet-sl.org/twomde2011/ ------------------------------------------------------------ SLE 2011 COMITTEES GENERAL CHAIR João Saraiva Universidade do Minho, Portugal jas(a)di.uminho.pt PROGRAM CO-CHAIRS Uwe Aßmann Dresden University of Technology, Germany uwe.assmann(a)tu-dresden.de Anthony Sloane Macquarie University, Australia anthony.sloane(a)mq.edu.au DOCTORAL SYMPOSIUM CHAIRS Perdita Stevens University of Edinburgh, UK perdita.stevens(a)ed.ac.uk Eric Van Wyk University of Minnesota, USA evw(a)cs.umn.edu PROGRAM COMITTEE Adrian Johnstone, University of London, UK Aldo Gangemi, Semantic Technology Laboratory, Italy Alexander Serebrenik, Eindhoven University of Technology, Netherlands Ana Moreira, FCT/UNL, Portugal Anthony Cleve, University of Namur, Belgium Anya Helene Bagge, University of Bergen, Norway Bernhard Rumpe, Aachen University, Germany Bijan Parsia, University of Manchester, UK Brian Malloy, Clemson University, USA Bruno Oliveira, Seoul National University, Korea Chiara Ghidini, FBK-irst, Italy Daniel Oberle, SAP Research, Germany Eelco Visser, Delft University of Technology, Netherlands Eric Van Wyk, University of Minnesota, USA Fernando Pereira, Federal University of Minas Gerais, Brasil Fernando Silva Parreiras, University of Koblenz-Landau, Germany Friedrich Steimann, University of Hannover, Germany Görel Hedin, Lund University, USA Ivan Kurtev, University of Twente, Netherlands James Power, National University of Ireland, Ireland Jean-Marie Favre, OneTree Technologies, France Jeff Gray, University of Alabama, USA Jeff Z. Pan, University of Aberdeen, UK João Paulo Fernandes, Univ. of Minho& Univ. of Porto, Portugal John Boyland, University of Wisconsin-Milwaukee, USA John Grundy, Swinburne University of Technology, Australia Jordi Cabot, École des Mines de Nantes, France Jurgen Vinju, CWI, Netherlands Laurence Tratt, Middlesex University, UK Marjan Mernik, University of Maribor, Slovenia Mark van den Brand, Eindhoven University of Technology, Netherlands Michael Collard, University of Akron, USA Nicholas Kraft, University of Alabama, USA Paul Klint, CWI, Netherlands Paulo Borba, Federal University of Pernambuco, Brazil Peter Haase, University of Karlsruhe, Germany Peter Mosses, Swansea University, UK Ralf Möller, Hamburg University of Technology, Germany Silvana Castano, University of Milan, Italy Steffen Zschaler, Lancaster University, UK York Sure, University of Koblenz-Landau, Germany Zhenjiang Hu, National Institute of Informatics, Japan ORGANIZATION COMMITTEE José Creissac Campos (Finance Chair) Universidade do Minho, Portugal João Paulo Fernandes (Web and Publicity co-Chair) Universidade do Porto& Universidade do Minho, Portugal Jurgen Vinju (Workshop Selection Chair) CWI, The Netherlands Vadim Zaytsev (Publicity co-Chair) CWI, The Netherlands

1 0

ANNOUNCE: enumerator 0.4.8
by John Millikin 29 Mar '11

29 Mar '11

----------------------------------------------------------------------------------------------------------------------------------------------------- Enumerators are an efficient, predictable, and safe alternative to lazy I/O. Discovered by Oleg Kiselyov, they allow large datasets to be processed in near–constant space by pure code. Although somewhat more complex to write, using enumerators instead of lazy I/O produces more correct programs. http://hackage.haskell.org/package/enumerator http://john-millikin.com/software/enumerator/ ----------------------------------------------------------------------------------------------------------------------------------------------------- Hello -cafe, It's been a while since the last point release of enumerator. This one is sufficiently large that I think folks might want to know about it, and since I try not to spam too many announcements, I'll give a quick rundown on major changes in other 0.4.x versions as well. First, most of what I call "list analogues" -- enumerator-based versions of 'head', 'take', 'map', etc -- have been separated into three modules (Data.Enumerator.List, .Binary, and .Text) depending on what sorts of data they operate on. This separation has been an ongoing process throughout 0.4.x releases, and I think it's now complete. The old names in Data.Enumerator will continue to exist in 0.4.x versions, but will be removed in 0.5. Second, Gregory Collins and Ertugrul Soeylemez found a space leak in Iteratee's (>>=), which could cause eventual space exhaustion in some circumstances. If you use enumerators to process very large or infinite streams, you probably want to upgrade to version 0.4.7 or higher. Third, the source code PDF has seen some substantial improvement -- if you're interested in how the library is implemented, or have insomnia, read it at < http://john-millikin.com/software/enumerator/enumerator_0.4.8.pdf > Finally, there is a known issue in the current encoding of iteratees -- if an iteratee yields extra data but never consumed anything, that iteratee will violate the monad law of associativity. Oleg has updated his implementations to fix this problem, but since it would break a *lot* of dependent libraries, I'm holding off until the vague future of version 0.5. Since iteratees that yield extra data they didn't consume are invalid anyway, I hope this problem will not cause too much inconvenience. New features ----------------- * Range-limited binary file enumeration (requested + initial patch by Bardur Arantsson). * splitWhen , based on the "split" package < http://hackage.haskell.org/package/split > * 0.4.6: Typeable instances for most types (requested by Michael Snoyman) * 0.4.5: joinE , which simplifies enumerator/enumeratee composition (requested by Michael Snoyman)

1 2

ANN: Yi 0.6.3
by Jeff Wheeler 29 Mar '11

29 Mar '11

Hi all, I'm very excited to announce the first release of Yi since last summer. It is relatively light on new features, but it finally should compile nicely on friendly machines. This means, for the most part, machines with the latest Haskell Platform installed. (Windows, unfortunately, has not been tested all that much. See details below, though, for install info.) ## What's new? * New vte UI. This is a terminal UI inside a GUI, much like gvim. It depends on Gtk2Hs for the GUI, and then launches the vty UI inside the terminal. * Compatibility with the latest Haskell Platform release * Start yi-contrib package. We intend to move more stuff here, to clean up the core yi package. * We're now on GitHub (and mirrored on Google Code)! See below for info. ## What's Yi? Yi is a text editor written in Haskell and extensible in Haskell. The long-term goal of the Yi project is to provide the editor of choice for Haskell programmers. Yi now works relatively well in the terminal, using the vty package, and also has Gtk frontends using vte (which interfaces with the terminal interface) and a Pango frontend. There is also a Cocoa frontend under (slow) development. ## Installation Using cabal install: $ cabal update $ cabal install yi The default UI depends on the vty package, which will only compile with the ncurses development headers available. On Ubuntu, you need to install the `libncurses5-dev` package. On Windows, you'll need to disable the default vty terminal UI, and use a Gtk UI instead (the vte UI requires vty, so you can't install that either): $ cabal install yi -f-vty -fpango (Windows support is not well-tested, though.) Optionally also install the contrib package: $ cabal install yi-contrib ## Features * A purely functional editor core * Key-bindings written as parsers of the input * Emacs, Vim and (partial) Cua emulations provided by default * Console front-end (Gtk2Hs and Cocoa front-ends in development) * Static configuration (XMonad style) for fast load * Haskell support: * Lexical highlighting and (unicode-based) beautification. * Layout-aware parenthesis-matching * Auto-indentation * cabal-build within the editor * Syntax highlighting for a number of other languages (latex, python, perl, ...) ## More Info Read the README [1] on GitHub for more information. The source code [2] is also hosted there. ## Credits This release is brought to you by: * Alexey Levan * Gwern Branwen * Issac Trotts * Jean-Philippe Bernardy * Jeff Wheeler * Jeremy Wall * Maciej Piechotka * Malte Sommerkorn and all the contributors to the previous versions. Also, Yi would not exist without all the work put into the Haskell platform. [1] https://github.com/yi-editor/yi/blob/master/README.md [2] https://github.com/yi-editor/yi -- Jeff Wheeler Undergraduate, Electrical Engineering University of Illinois at Urbana-Champaign

9 15

Fwd: ANN: Yi 0.6.3
by Robby Findler 29 Mar '11

29 Mar '11

On Mon, Mar 28, 2011 at 8:39 PM, Brandon S Allbery KF8NH <allbery.b(a)gmail.com> wrote: > Somehow the Haskell community is hellbent on repeating the mistakes every > other community learned about the hard way years ago, especially in the area > of dependencies (first refusing to acknowledge the need for upper dependency > limits, more recently trying to avoid adding an epoch — and I'm not counting > how packages included with the compiler but not recognized as such by Cabal > lead directly to Cabal introducing diamond dependency failures). Is this > *really* necessary, or should those of us who've seen it before just sit > back and watch you all ram your heads against the same brick walls? > > (Why no, it doesn't look like a brick wall now; that's the point. It > *will*. Learn *before* it happens.) Hi Brandon: are any of these lessons written up somewhere? (I'd love to be able to read about what the important ones are, their rationale, etc.) Thanks, Robby

1 0