Search results

Jump to navigation Jump to search

Page title matches

  • How to profile your code
    #redirect [[How to profile a Haskell program]] [[Category: Pages to be removed]]
    81 bytes (12 words) - 06:37, 8 June 2023
  • How to work on lists
    [[Category:How to]] == How do I…? ==
    6 KB (1,106 words) - 12:32, 15 November 2019
  • How to write a Haskell program
    A developers' guide to creating a new Haskell project or program, and working in the Haskell devel everyone by increasing productivity, and you're more likely to get
    22 KB (3,268 words) - 04:57, 30 January 2022
  • How to install a Cabal package
    #redirect [[Cabal/How to install a Cabal package]] [[Category: Pages to be removed]]
    85 bytes (13 words) - 06:36, 8 June 2023
  • How to profile a Haskell program
    This page shows you how to profile Haskell programs using [[GHC]]. :'''''Note:''' It would be a good idea to gather together the information contained in the case studies and present i
    7 KB (1,084 words) - 19:08, 3 February 2021
  • How to get rid of IO
    ...of type <code>IO a</code>, but I need something of type <code>a</code>, so how do I get rid of that annoying <code>IO</code> type?</i> Well, there are a few ways to do this...
    4 KB (726 words) - 05:08, 6 April 2022
  • How to unpack a tar file in windows
    #REDIRECT [[How to unpack a tar file in Windows]] [[Category: Pages to be removed]]
    84 bytes (14 words) - 06:37, 8 June 2023
  • How to unpack a tar file in Windows
    ...t>.tar.gz</tt> or <tt>.tar.bz2</tt> in these cases. There are several ways to unpack these files. ...have MinGW/MSYS or Cygwin installed, you can use the <tt>tar</tt> command to unpack such files:
    2 KB (426 words) - 15:37, 28 August 2019
  • How to Tie and Wear a Womans Scarf Many Fashionable Ways
    #redirect [[Euler problems/101 to 110]] [[Category: Pages to be removed]]
    74 bytes (9 words) - 06:36, 8 June 2023
  • Cabal/How to install a Cabal package remotely
    ...yle="color: red">[WARNING: This page is *extremely* out of date and likely to be obsolete]</span> Sometimes, it is difficult or inconvenient to set up the entire
    3 KB (480 words) - 04:39, 24 April 2021
  • Cabal/How to install a Cabal package
    [[Category:How to]] ...askell package on [http://hackage.haskell.org/ Hackage] you'd like to try. How do you install it on your system?
    1 KB (169 words) - 10:06, 10 March 2021

Page text matches

  • Results, after one mounth, 14 jan 2008
    ==. How quick can you write an ISI paper with Haskell ? == ==. How quick can you write an ISI paper without Haskell ? ==
    1 KB (178 words) - 04:02, 14 August 2021
  • Haddock/FAQ
    In fact it does, but you have to add spaces between parentheses and the infix symbols sometimes: <hask>( # ) === How do I get hyperlinks to definitions in e.g. Haskell98? ===
    830 bytes (123 words) - 00:11, 17 June 2021
  • Profiling walkthrough
    #redirect [[How to profile a Haskell program]] [[Category: Pages to be removed]]
    81 bytes (12 words) - 11:51, 8 June 2023
  • How to profile your code
    #redirect [[How to profile a Haskell program]] [[Category: Pages to be removed]]
    81 bytes (12 words) - 06:37, 8 June 2023
  • Blog articles/Libraries
    ...//parenz.wordpress.com/2013/07/29/ghc-packagedb/ Adding a package database to the GHC API session] * [http://jabberwocky.eu/2013/10/24/how-to-start-a-new-haskell-project/ How to Start a New Haskell Project]
    2 KB (179 words) - 09:01, 13 November 2013
  • How to unpack a tar file in windows
    #REDIRECT [[How to unpack a tar file in Windows]] [[Category: Pages to be removed]]
    84 bytes (14 words) - 06:37, 8 June 2023
  • Real World Applications
    ...o large scale "Real World/Enterprise" Haskell systems. In other words, how to create large-scale systems that support complex business processes, informa The following articles show how to attack this problem.
    978 bytes (130 words) - 14:09, 2 July 2014
  • Cabal/How to install a Cabal package
    [[Category:How to]] ...askell package on [http://hackage.haskell.org/ Hackage] you'd like to try. How do you install it on your system?
    1 KB (169 words) - 10:06, 10 March 2021
  • Url
    The URL library provides a module Network.URL that makes it easy to work with HTTP URLs. ...feel free to update this page with extra documentation and examples of how to use the package.
    829 bytes (129 words) - 15:18, 6 February 2021
  • How to install a Cabal package
    #redirect [[Cabal/How to install a Cabal package]] [[Category: Pages to be removed]]
    85 bytes (13 words) - 06:36, 8 June 2023
  • HaskellImplementorsWorkshop/2013/Eisenberg
    = GeneralizedNewtypeDeriving is now type-safe: How "Roles" save the day = The flaw with GeneralizedNewtypeDeriving and how it can cause Haskell programs
    1 KB (187 words) - 06:34, 16 September 2013
  • Reactive-banana/Examples
    : Mainly demonstrates how to set up an event network with your own event loop. Also demonstrates the FRP ...monstrates how to set up an event network with your own event loop and how to pause or resume it.
    4 KB (488 words) - 01:53, 30 March 2014
  • Lazy evaluation
    ...ations. In consequence, arguments are not evaluated before they are passed to a function, but only when their values are actually used. ...values (e.g. results of infinite loops) and in this way it also allows one to process formally infinite data.
    2 KB (291 words) - 15:20, 6 February 2021
  • HaskellImplementorsWorkshop/2013/Farmer
    ...tion. In this talk, we will provide an update on HERMIT's status, describe how HERMIT is being used in the wild, and discuss lessons learned about working ...ilities from the point of view of our principal use-case - someone seeking to rapidly prototype new optimization passes in GHC.
    1 KB (174 words) - 06:36, 16 September 2013
  • Setting an executable icon
    ...tables in their file manager windows. The following shows how to add icons to executables compiled from Haskell source. The examples use the [[Media:Favi A description how to do this in Ubuntu:
    893 bytes (134 words) - 01:31, 14 July 2021
  • Type signatures as good style
    but the purpose of <hask>asTypeOf</hask> is to unify the types of both operands. == How to add a bunch of signatures? ==
    2 KB (267 words) - 15:18, 6 February 2021
  • HaskellImplementorsWorkshop/2013/Yang
    to this dream is how to bound the time and space usage of such untrusted code. In this talk, we would like to describe a first implementation of a resource limits system for Haskell, wh
    1,004 bytes (152 words) - 06:35, 16 September 2013
  • Treeviz
    ...ow to apply a particular type of massively parallel computational resource to the computational problem. ...ree.gv'' and ''legend.gv'' need to be post-processed, as follows, in order to generate the graphics shown, below.)
    2 KB (223 words) - 13:32, 28 April 2014
  • Humor/irish joke
    ==How to keep an imperative programmer busy for hours ==
    167 bytes (29 words) - 15:19, 6 February 2021
  • Cookbook/FFI
    ...tp://therning.org/magnus/archives/315 a nice example] (link broken) on how to call a C function operating on a user defined type.
    225 bytes (35 words) - 01:29, 5 August 2021
  • Yhc/Snapshots
    Currently snapshots are only available for Windows users, this describes how to install and test Yhc on Windows. # Go to My Computer, right click Properties, Advanced, Environment Variables:
    600 bytes (95 words) - 00:25, 17 June 2021
  • Metaチュートリアル
    #* [[Hitchhikers guide to Haskell]] - チュートリアルの進み方がゆっくりだったり、 #* [[A brief introduction to Haskell]] - "A brief introduction to OCaml（日本語訳：OCaml概要）"という記事のHaskell版で、Has
    5 KB (398 words) - 11:37, 22 October 2022
  • GHC/Kinds
    ...a language extension adding a kind level and some kind polymorphic support to Haskell. ...me bigger. This extension provides a simple mechanism called ''promotion'' to populate the kind level.
    2 KB (289 words) - 16:02, 28 February 2014
  • HDBC-ODBC MS SQL under Linux
    [[Category:Libraries]] [[Category:How to]] [[Category:Pages to be removed]] ...escription of how to get HDBC-ODBC working under [[linux]], for connecting to MS SQL server.
    1 KB (210 words) - 11:52, 19 April 2021
  • 99 questions/Solutions/34
    ...defined as the number of positive integers r (1 <= r < m) that are coprime to m. ...elements are in the resulting list, and thus how many elements are coprime to n
    1 KB (224 words) - 19:44, 18 January 2014
  • Hie-bios
    ...ing [[Cabal]], [[Stack]] and other package managers. It is used to specify how [[Haskell Language Server]] and [[ghcide]] set up a [[GHC API]] session.
    497 bytes (72 words) - 23:38, 31 July 2023
  • The Monad.Reader/Discuss Issue11
    === How to Refold a Map === ...ue11/FingerTreeIMap|sketch]] of the implementation to serve as a follow-up to my article.
    653 bytes (92 words) - 15:18, 6 February 2021
  • Humor/Dialogs
    Strict Dad: How many money do you need [pulls out wad of bills] Greedy Son: Mind your own business! I don't tell you how to earn the money,
    3 KB (445 words) - 15:19, 6 February 2021
  • HaskellImplementorsWorkshop/2013/Kmett
    ...at affected base without nigh unanimous consent. This is due in large part to the lack of anyone who felt responsible for maintaining those packages outs ...nning over the next year or so. We'd also like to start a discussion about how we can better integrate our efforts with the those of existing GHC implemen
    835 bytes (143 words) - 06:33, 16 September 2013
  • Pronunciation
    ...http://www.haskell.org/pipermail/haskell-cafe/2008-January/038756.html how to pronounce Haskell]. Below are some notes for beginners on how to pronounce those strange Haskell operators and 'read' Haskell programs.
    3 KB (532 words) - 23:05, 24 July 2021
  • Haskell-language-server
    ...with VSCode/SublimeText/Vim/Neovim/Atom/Emacs. Note that you may also need to add some options in your project configuration. The README also covers that ...hem-all.html</ref> Over time, this project became the HLS, which allows it to be used with many IDEs and code editors.
    1 KB (157 words) - 00:07, 26 April 2024
  • Gtk2Hs/Tutorials
    :This tutorial gives an introducion to the basics of Gtk+ and Gtk2Hs. ...ed Events module and to run some examples with gtk 0.10.1, it is necessary to include "import Graphics.UI.Gtk.Gdk.Events" in the program.
    1,006 bytes (151 words) - 04:25, 26 April 2021
  • HDBC-ODBC under Windows
    [[Category:Libraries]] [[Category:How to]][[Category:Pages with broken file links]] ...cription of how to get HDBC-ODBC working under [[windows]], for connecting to things like MS SQL server.
    2 KB (286 words) - 08:45, 23 May 2021
  • HaskellImplementorsWorkshop/2013/Bazerman
    ...where we have been seeking to improve, and potential future plans. We want to recognize the hard work of the volunteers who have stepped in, and discuss
    848 bytes (128 words) - 06:32, 16 September 2013
  • Haskell in web browser
    ...browser) of Web applications by the means of conversion of Haskell source to Javascript. ...to ''use'' these interfaces in a Haskell program. For details please refer to the original sources at [http://www.w3.org the Web Consortium]. Also, [http
    3 KB (406 words) - 01:36, 17 June 2021
  • How to get rid of IO
    ...of type <code>IO a</code>, but I need something of type <code>a</code>, so how do I get rid of that annoying <code>IO</code> type?</i> Well, there are a few ways to do this...
    4 KB (726 words) - 05:08, 6 April 2022
  • No kind signatures
    I want to define So to speak, the second type argument of <hask>Const</hask>
    1 KB (192 words) - 23:01, 5 April 2021
  • Real World Haskell
    ...haskell.org/ freely available online], fast-moving tutorial introduces you to functional programming with Haskell. Learn how to use Haskell in a variety of practical ways, whether
    3 KB (371 words) - 04:17, 14 August 2021
  • AI/Genetic programming/Evolutionary chess
    ...ng around the idea of what it would look like to apply genetic programming to chess. Here's a non-technical overview I wrote a few months ago, sketching ...inking that Haskell would be a great platform on which to build this idea. To be a little more technical about it than I was in that overview, here's som
    5 KB (819 words) - 01:04, 9 April 2021
  • Opting for oracles
    ...the Fudgets thesis] refers to this implementation. It was fairly pleasant to work with and quite practical. ...ar values by the language defining the computation. The oracle, by seeming to contain the prediction, limits the effect on the semantics of the language
    6 KB (809 words) - 07:56, 12 June 2023
  • Example code
    To get a feel for what real world Haskell looks like, here are some To start learning the language, good places to start are
    6 KB (921 words) - 11:17, 22 October 2022
  • Stack
    ...ntire Haskell development cycle, from installing the compiler and packages to testing and benchmarking software. ...th-stack-reloaded.html Casual Hacking With stack, Reloaded] - Explains how to start up a new package with Stack and what each file is for.
    1 KB (179 words) - 13:57, 28 August 2019
  • Concurrency with oracles
    ...type of nondeterminism appears to be necessary if functional programs are to be used for real-time computing. ...w these programs to cope with such degradation gracefully while continuing to carry out the majority of their designated tasks, albeit at reduced capacit
    4 KB (565 words) - 06:24, 12 June 2023
  • Himerge
    This wiki site is supposed to be the place containing all the possible information and documentation for === How do I install Himerge? ===
    4 KB (611 words) - 06:00, 12 July 2021
  • Parallelism vs. Concurrency
    ...ses multiple processors to gain performance. For example, it may be faster to evaluate ''e''<sub>1</sub> + ''e''<sub>2</sub> by evaluating ''e''<sub>1</s A key problem of parallelism is to reduce data dependencies
    5 KB (668 words) - 12:02, 9 May 2024
  • GHC/Type system
    ...place to record user-oriented observations, notes, and suggestions on how to use them.
    1 KB (158 words) - 20:32, 23 July 2021
  • Applications and libraries
    ...the most commonly used functions. Make sure you know what they do and how to use them effectively. ...all Haskell implementations should support, including the Prelude. Changes to these libraries are handled by the [http://web.archive.org/web/201912290558
    8 KB (1,114 words) - 01:40, 1 March 2020
  • Cxx foreign function interface
    [To do: link here from other pages?] ...he usual difficulties of FFI, and then describes some (possible) solutions to the difficulties presented by C++.
    4 KB (618 words) - 22:55, 11 July 2021
  • Cont computations as question-answering boxes
    In Haskell syntax, we define a new datatype to wrap up this idea: ...<code>Cont</code> computation and a question, basically asks the question to get a response.
    7 KB (1,253 words) - 23:34, 25 June 2021
  • LLVM
    A strongly typed interface that is mainly intended to accelerate your Haskell programs with low-level code: ...rformance-update-ive-continued.html A performance update]" that describes, how LLVM can improve performance
    2 KB (204 words) - 11:22, 2 October 2020
  • How to work on lists
    [[Category:How to]] == How do I&hellip;? ==
    6 KB (1,106 words) - 12:32, 15 November 2019
  • Haskell/Lazy evaluation
    This question came up in #haskell, and it seemed instructive to take the discussion and sum it up into a simple tutorial on lazy evaluation ...,1,2,3,5,...]</code>, i.e. an infinite list. Now, the person asking wanted to evaluate the following:
    4 KB (708 words) - 23:10, 19 April 2021
  • GHC/Memory Management
    ...will be garbage collected immediately). So, you may be interested to learn how GHC does such a good job. Note that we have used accumulator with strict evaluation in order to suppress the default laziness of Haskell computations - this code really co
    3 KB (490 words) - 21:19, 21 November 2022
  • Diagrams/Dev/Migrate1.1
    ...es between diagrams 1.0 and 1.1, along with explanations of how to migrate to the new 1.1 API. Extracting a measurement with particular units, which used to look like
    1 KB (191 words) - 15:05, 17 May 2014
  • Gentoo
    ...builds there at your own risk. '''Do not report errors in overlay ebuilds to the Gentoo Bugzilla!''' ...are distributed via [http://hackage.haskell.org/ Hackage] as it allows us to use automated tools.
    4 KB (592 words) - 08:43, 1 September 2022
  • GHC/Type system/PolyKinds
    ...first time. This page contains notes (currently rather random) about how to use these features. where I'm writing the kind argument explicitly. To be fully clear, I'm writing <hask>List</hask> for the type constructor for
    2 KB (242 words) - 23:38, 24 July 2021
  • Applications and libraries/Generic programming/Template
    <li><p> How to use the library? </p></li> new types, and a base set of generic operations/support code to get
    3 KB (464 words) - 06:57, 24 December 2013
  • Partibles for composing monads
    ...teraction) to many monads (several independent forms of interactions). How to achieve this remains a challenge for the future. ...eerx.ist.psu.edu/viewdoc/download?doi=10.1.1.91.3579&rep=rep1&type=pdf How to Declare an Imperative], Philip Wadler.</small>
    4 KB (691 words) - 08:14, 12 June 2023
  • Iteratee I/O
    ...y work by making the I/O operations explicit, making their behavior easier to reason about. For example, a common beginner mistake is to close a file before one has finished reading it:
    4 KB (653 words) - 12:02, 19 April 2024
  • Haskell mode for Emacs/Color chords
    I have to remind myself now and then that there are lots and lots of creative thinker So I think a lot about how to get people of various backgrounds involved in the creative process of build
    2 KB (249 words) - 22:40, 29 June 2021
  • Fairbairn threshold
    Adding every variant on every operation to the Prelude is certainly The primary use of the Fairbairn threshold is as a litmus test to avoid
    2 KB (321 words) - 14:41, 4 May 2020
  • Recursion in a monad
    People sometimes wonder how to effectively do recursion when inside a The problem is to read 'n' lines from stdin, recursively:
    986 bytes (142 words) - 15:18, 6 February 2021
  • Calling Haskell from C
    It is not uncommon to want to call a Haskell function from C code. Here's how to do that.
    1 KB (215 words) - 17:08, 27 June 2019
  • Computer science
    ...computabilty theory: [[Exact real arithmetic]]. For me, it was surprising, how it connected problems in mathematical analysis, arithmetic and computabilit == To do ==
    3 KB (357 words) - 15:18, 6 February 2021
  • Introduction to IO
    ...doesn't describe everything there is to know, but should give some idea of how things work.)'' Ordinary Haskell evaluation doesn't cause this execution to occur. A
    5 KB (958 words) - 15:20, 3 August 2022
  • Diagrams/Dev/Migrate1.0
    ...es between diagrams 0.7 and 1.0, along with explanations of how to migrate to the new 1.0 API. === <code>&</code> operator renamed to <code>^&</code> ===
    2 KB (336 words) - 18:41, 18 February 2014
  • Gtk2Hs/Tutorials/TreeView
    {- an example how to select from a list - there should be a simpler way to render a simple list
    2 KB (280 words) - 00:46, 9 April 2021
  • GNU/Linux
    Haskell support on various Linux distributions. How to find Haskell applications and tools, contribute new packages, and get help ...string&email1=fedora-haskell-list%40redhat.com Closed package reviews CC'd to fedora-haskell-list]
    5 KB (691 words) - 08:44, 29 March 2022
  • The Monadic Way
    ...eful for, from the perspective of a ... lover. It could be an introduction to "The Monadic Way" tutorial. :In the second part of the tutorial we will see how to take complexity out of our monadic evaluator with the use of monadic transf
    9 KB (1,615 words) - 15:16, 6 February 2021
  • A new list type
    ...tatement, the above (which is obviously incomplete) is what I came up with to address this criticism. (You might argue that linked lists just plain aren' ....) The really interesting case is <hask>select</hask> (which is equivalent to <hask>Prelude.filter</hask>, but with a less brain-dead name).
    3 KB (587 words) - 15:19, 6 February 2021
  • Unsafe functions
    A colleague [...] asked me today whether I know how to use <code>unsafePerformIO</code> safely. And I realized I have no idea. [..
    1 KB (206 words) - 12:27, 8 June 2023
  • Programming performance
    ...The goal isn't to finish the problem as quickly as possible but to rather to get some realistic measurements on programming speed and approaches. ...tions on the same page as your initial submission but the primary goals is to measure your initial solution and the amount of time required. If you wish
    4 KB (638 words) - 23:08, 5 April 2021
  • Type classes are for reusability
    ...massive re-use of some short identifier like <hask>fmap</hask> or in order to access some [[syntactic sugar]] ...kell-cafe/2009-January/053043.html network port], just in order to be able to write <hask>80</hask> for a port number?
    2 KB (322 words) - 04:01, 6 April 2021
  • GHC under Wine
    [[Category:How to]] [[GHC]] runs flawlessly under Wine. Here's a guide on how to get it working.
    4 KB (574 words) - 07:28, 13 October 2014
  • IO入門編
    * さらにこちらも参照してみてください。 [[Avoiding IO|how to avoid IO]] Languages: [[Introduction to IO|en]]
    7 KB (299 words) - 11:39, 22 October 2022
  • Web/Deploy
    includes its own server. The fastest way to deploy your IHP app is by using [https://ihpcloud.com IHP Cloud]. ...of the Yesod book to see how to configure the various servers and FastCGI to host WAI applications.
    2 KB (291 words) - 05:02, 26 April 2021
  • Humor
    *[[Humor/Poem|An ode to Haskell]] *[[Humor/irish_joke|How to keep an imperative programmer busy for hours]]
    5 KB (667 words) - 22:52, 1 May 2024
  • Quotes
    > I am preparing a three-minute talk to tell incoming graduate students Oh like that's going to work. You'd be better off selling T-shirts that
    3 KB (561 words) - 02:55, 26 April 2021
  • Haskell and mathematics
    ...s the relatively low distance between thought expressed in my ordinary day-to-day mathematical discourse, and thought expressed in Haskell code."'' :''"How can Haskell not be the programming language that all mathematicians should
    2 KB (242 words) - 05:23, 12 July 2021
  • Questions and answers
    Feel free to ask your questions here. Please sign your question using four tildes (<nowi ;Q. What are the best places to ask beginner questions?
    6 KB (915 words) - 06:17, 23 July 2020
  • Diagrams/Dev/Migrate0.7
    ...es between diagrams 0.6 and 0.7, along with explanations of how to migrate to the new 0.7 API. ...You must now import <code>Diagrams.Coordinates</code> explicitly in order to make use of it.
    2 KB (297 words) - 06:13, 3 August 2013
  • Combinator
    ...h no free variables" is a [[Pure|pure]] lambda-expression that refers only to its arguments, like ...and some "combinators" which can combine values of type T in various ways to build up more complex values of type T.
    2 KB (256 words) - 22:11, 3 May 2024
  • Real World Applications/Event Driven Applications
    ...vents. Most non-trivial applications/architectures (from Operating Systems to Web Servers and Enterprise applications) are event driven. * A new Rostering Schedule is ready for distribution to all crew (Airline Management System).
    7 KB (1,076 words) - 08:53, 4 July 2014
  • Parallel/Reading
    ''Note: you may want to read [[Parallelism vs. Concurrency]], as the terms have historically been c ...ead/concurrent-and-multicore-programming.html chapter 24]: an introduction to the most common forms of concurrent and parallel programming in GHC.
    4 KB (456 words) - 12:02, 9 May 2024
  • Burton-style nondeterminism
    ...n an (theoretically) infinite structured value (which Burton simply refers to as ''pseudodata''). to convey the abstract values of type <code>Decision</code>.
    2 KB (341 words) - 09:18, 22 February 2022
  • Manatee
    The goal of the Manatee project is to provide a fast, safe and flexible integrated environment for haskell hackin You can consider it is new environment mix Gnome and Emacs. Like Gnome to provide friendly graphics interface and work
    12 KB (1,458 words) - 02:36, 26 April 2021
  • Applicative functor
    Monads allow you to run actions depending on the outcomes of earlier actions. then putStrLn "You refuse to enter something?"
    8 KB (1,326 words) - 08:20, 31 March 2022
  • Cabal/Developer-FAQ
    ...yle="color: red">[WARNING: This page is *extremely* out of date and likely to be obsolete]</span> == How do I handle Haskell language extensions? ==
    7 KB (998 words) - 12:32, 2 October 2020
  • Non-strict semantics
    ...her language has [[strict semantics]], in which if any subexpression fails to have a value, the whole expression fails with it. ...one of the most important features in Haskell: it is what allows programs to work with conceptually infinite data structures, and it is why people say t
    9 KB (1,503 words) - 13:55, 15 December 2019
  • Infinity and efficiency
    In this article we demonstrate how to check the efficiency of an implementation by checking for proper results fo In general, it is harder to reason about time and memory complexity of an implementation than about its
    3 KB (422 words) - 21:22, 29 June 2021
  • BayHac2013/Denotative Programming
    <li>Worked out how to mechanically evaluate lambda calculus.</li> <li>Led to the lambda-calculus-based languages, including Scheme, ML, and Haskell.</li
    2 KB (316 words) - 14:12, 14 October 2021
  • Cabal
    *[http://dev.stephendiehl.com/hask/#cabal An introduction to cabal-install] *[[How to write a Haskell program]]
    2 KB (244 words) - 12:34, 2 October 2020
  • High-level option handling with GetOpt
    I've used Haskell to create various command-line utilities for unix-like has a simple, easy to use interface, handles short and long options,
    8 KB (1,082 words) - 23:30, 3 December 2020
  • Encoding issues
    ...n between the two can be done in many ways. This page gives an overview of how these issues should be handled. ...geString/WhateverString. Such a type is either a list of bytes, equivalent to <hask>[Word8]</hask> or it is a string, a list of character, <hask>[Char]</
    2 KB (307 words) - 13:45, 23 May 2021
  • Diagrams/Dev/Migrate1.2
    ...es between diagrams 1.1 and 1.2, along with explanations of how to migrate to the new 1.2 API. ...ails. The most noticeable effects of this change in porting diagrams code to 1.2 will be type errors on uses of attribute functions like <code>lw</code>
    5 KB (807 words) - 19:36, 30 June 2014
  • Incompatibilities between MTL 1 and MTL 2
    incompatibilities relative to version 1, described below. See "[[Upgrading from MTL 1 to MTL 2]]" for instructions on how
    3 KB (378 words) - 15:19, 6 February 2021
  • Hac NYC/Talks
    ...ase also let us know if you won't be attending Saturday afternoon and want to present at another time. | style="width: 150px;" | An invitation to Homotopy Type Theory
    2 KB (335 words) - 15:02, 5 April 2014
  • Parallelism
    ''Note: you may want to read [[Parallelism vs. Concurrency]], as the terms have historically been c This page contains notes and information about how to write parallel programs in Haskell.
    3 KB (360 words) - 12:02, 9 May 2024
  • Monad laws
    ...isely why they're known as ''identity'' and ''associative'' laws, you have to change your notation slightly. It's now easy to see that monad composition is an associative operator with left and right i
    5 KB (788 words) - 10:40, 1 February 2024
  • GHC/Typed holes
    ...ki.portal.chalmers.se/agda/pmwiki.php Agda]. But what are typed holes, and how do they help us write code? ...the types. But it can be difficult sometimes when writing a program to see how the polymorphic types should exactly fit together, given the things in scop
    9 KB (1,711 words) - 20:19, 31 August 2014
  • Toolmaking libraries
    ...their own implementations that hopefully make the extensions less painful to deal with. ...e, haddock doesn't care about terms at all, whereas other tools might want to know about dependencies and yet others might perform abstract interpretatio
    5 KB (735 words) - 15:20, 6 February 2021
  • Unboxed type
    Since Haskell values may contain unevaluated thunks in addition to specific values, in general values must be represented by a pointer to a
    3 KB (470 words) - 09:25, 12 June 2023
  • 99 questions/Solutions/41
    ...mall. Very rarely, the primes are both bigger than say 50. Try to find out how many such cases there are in the range 2..3000.
    992 bytes (161 words) - 19:48, 18 January 2014
  • Constructor
    ...he data type is polymorphic (and <hask>a</hask> is a type variable that is to be substituted by a specific type). So when used, the values will have type ...nstructors, <hask>Tip</hask> and <hask>Node</hask>. Any value that belongs to the type <hask>Tree a</hask> (again, we leave the type parameter unspecifie
    6 KB (1,060 words) - 16:51, 18 June 2021
  • GHC.Generics
    ...two flags: <tt>DeriveGeneric</tt> and <tt>DefaultSignatures</tt>. We show how this all works in this page, starting with a detailed example. He will have to specify an <hask>instance Serialize (UserTree a) where ...</hask> himself.
    16 KB (2,615 words) - 20:24, 19 October 2020
  • IO then abstraction
    Even so, it is fair to object that the ‘monadified’ definition is ugly compared to its direct but not obviously terminating counterpart, with more intermediat
    6 KB (940 words) - 12:17, 19 April 2024
  • GADTs for dummies
    ...time, I didn't understand what [[Generalised algebraic datatype]]s were or how they could be used. It almost seemed a conspiracy of silence &mdash; people ...) So, I want to share my understanding of GADTs. Maybe the way I realized how GADTs work could help
    14 KB (2,322 words) - 13:55, 24 November 2023
  • Game Development
    In recent years this page has not been updated often enough to remain informative, so it probably has only a historical value at this poin ...021, the following forums seem the most active, so please ask there for up-to-date information:
    9 KB (1,258 words) - 05:36, 8 June 2023
  • Failure
    ...so refer to the "error" function, which in fact causes a runtime exception to be triggered. ...refers to an exception which is thrown in the IO monad. It can also refer to the actual typeclass "Exception" which was introduced along with extensible
    6 KB (961 words) - 12:45, 12 August 2019
  • List comprehension
    ...nerator <hask>c <- s</hask> feeds each character of <hask>s</hask> in turn to the left-hand expression <hask>toUpper c</hask>, building a new list. Note how each successive generator refines the results of the previous generator. Th
    5 KB (679 words) - 17:14, 4 February 2023
  • Performance/Monads
    ...it can often impose a performance hit of up to 300% (your code will run up to three times slower). If you care about this, the best option is to flatten you stack of transformers into a single, hand unrolled monad. An ex
    6 KB (995 words) - 23:51, 16 April 2021
  • Heterogenous collections
    To compare tuples vs lists: used to Java, with its loose typing of collections, not having this
    5 KB (863 words) - 11:44, 22 August 2021
  • The Monad.Reader/Issue3/Functional Programming vs Object Oriented Programming
    .../.Net, or even Pascal or C, and intends to give a mapping from OO concepts to Haskell concepts. ...object that aren't modified aren't copied; you just retain the references to the originals). Also, you avoid any aliasing problems, which is a potential
    10 KB (1,718 words) - 07:14, 10 August 2022
  • Partible laws
    ...s the set of <i>basic definitions</i> for <code>T</code>-values (analogous to the set of <i>primitive definitions</i> for a builtin type); * <code>g</code>'s parameter is meant to be used strictly and exclusively by a member of <i>S</i>(<code>T</code>):
    13 KB (2,108 words) - 12:52, 1 January 2024
  • Checking for correct invocation of a command line haskell program
    [[Category:How to]] ...second is an example of "ugly" argument checking that is slightly simpler to write, but gives a less user friendly error message
    2 KB (244 words) - 02:29, 9 April 2021
  • Darcs repositories
    Programmers love to read code. That's how we get a feel for what a language is. Here's a list of significant Haskell * [http://darcs.haskell.org/c2hs/ c2hs], a C to Haskell binding generator
    4 KB (536 words) - 00:28, 17 June 2021
  • Arrow
    "They can do everything monads can do, and more. They are roughly comparable to monads with a static component." However "Arrows do have some problems". ...ve a self-contained material (e.g. section [[#Automaton]] gives links only to the finite state concept itself.).
    11 KB (1,636 words) - 20:01, 13 May 2020
  • DeepArrow
    Besides this wiki page, here are more ways to learn about DeepArrow: ...t the composition chains directly spell out the paths to the value subpart to be edited.
    3 KB (540 words) - 21:40, 3 May 2024
  • Introduction to Haskell IO
    ...ng useful code as quickly as possible. The pace will be slow and detailed to avoid confusing programmers who are unfamiliar with haskell, may not have a # [[Introduction to Haskell IO/General introduction]]
    10 KB (1,520 words) - 07:20, 10 November 2020
  • Enumerator and iteratee
    ...thing that does one step in processing another piece of the big list. E.g. to sum up all elements of a list, we do of the collection and how to get to the next element; iteratee knows
    6 KB (927 words) - 12:02, 19 April 2024
  • Yampa
    ...hn/FoPAD2007/Talks/nhn-FoPAD2007.pdf Henrik Nilsson - A Brief Introduction to Functional Reactive Programming and Yampa] ** [https://www.youtube.com/watch?v=xtmo6Bmfahc Euterpea: From signals to symphonies]
    7 KB (1,022 words) - 13:19, 13 October 2021
  • Compatibility Modules
    ...es. In many cases, a library author can decide to require users to upgrade to a more recent version of dependencies. However, in the case of libraries bu ...d any migration headaches. However, such an approach would ultimately lead to quite convoluted APIs at the core of our ecosystem.
    7 KB (1,079 words) - 08:57, 23 May 2021
  • Creating Debian packages from Cabal package
    ...yle="color: red">[WARNING: This page is *extremely* out of date and likely to be obsolete]</span> This is a little bit outdated. For up-to-date information about packaging for Debian, with the Debian Haskell Group,
    6 KB (802 words) - 04:59, 12 July 2021
  • Guess a random number
    ...or with a known seed, so that results would be reproducible. The seed had to be either user-specified or itself randomly generated. Along the way, it b ...out other newbies. Comments, criticism, and rewrites are welcome. Thanks to #haskell for the advice they've given.
    5 KB (787 words) - 15:17, 6 February 2021
  • Monk upgrade
    ...n OS upgrade. It's currently running Debian ''sarge''; the upgrade will be to ''etch'', the current stable version of Debian. This page is meant to host discussion of
    3 KB (427 words) - 22:48, 23 April 2021
  • Diagrams/Dev/Freezing
    Some rough notes/explanations on freezing and how it relates to optimizing the backend API. Eventually these notes should go into the user ...y it would be surprising for them to be truly scale-invariant with regards to line width.
    10 KB (1,576 words) - 22:57, 30 November 2013
  • Gtk2Hs/Tutorials/ThreadedGUIs
    I realized today that there was little accurate info on how to do multithreaded GUI in gtk2hs. It's trivial. ...have to know, is that you MUST compile your program with -threaded for it to work properly. Otherwise you will get random hangs.
    4 KB (613 words) - 21:06, 7 October 2014
  • How to profile a Haskell program
    This page shows you how to profile Haskell programs using [[GHC]]. :'''''Note:''' It would be a good idea to gather together the information contained in the case studies and present i
    7 KB (1,084 words) - 19:08, 3 February 2021
  • IO tutorials timeline
    ...that stands on its own as an explanation of I/O, then please take a moment to paste the link somewhere on this page (register a throwaway account, if you * 1998-02 [https://www.haskell.org/tutorial/io.html A Gentle Introduction to Haskell, Version 98: Input/Output] (translations: [https://www.sampou.org/h
    8 KB (1,101 words) - 10:59, 2 May 2024
  • Monads as containers
    There are a few ways to choose the basic set of functions that one can perform on these containers to be able to define a monad. Haskell generally uses a
    18 KB (3,270 words) - 05:36, 9 March 2021
  • 99 questions/90 to 94
    ...the block so we know someone's working on it. Then, change n in your block to the appropriate problem number, and fill in the <tt><Problem description>,< This is a classical problem in computer science. The objective is to place eight queens on a chessboard so that no two queens are attacking each
    6 KB (802 words) - 06:27, 11 June 2023
  • PermissiveImportsProposal
    ...have "import Data.Text; import Data.Text.Lazy" in our imports and attempt to use isInfixOf we will get an ambiguous occurrence. However, there is one ca ...r the identifiers from specific modules there's no reason for the compiler to assume we might want them from the Prelude or Data.List.
    9 KB (1,515 words) - 23:39, 23 October 2014
  • 99 questions/Solutions/27
    a) In how many ways can a group of 9 people work in 3 disjoint subgroups of 2, 3 and ...one above. In each step of the recursion we have to decide whether we want to take the first element of the list <hask>(x:xs)</hask> in the combination (
    2 KB (410 words) - 19:40, 18 January 2014
  • MultiCase
    ...sed that Haskell allow multiple pattern matches in a case statement to map to a single right-hand-side expression. -- the cases of 0 and 1 would have to be handled separately.
    3 KB (470 words) - 23:09, 11 July 2021
  • Raspberry Pi
    ...ithub.com/blitzcode/hue-dashboard/blob/master/README.md#raspberry-pi Steps to get Haskell software running on Raspberry Pi] * [https://haskellembedded.github.io/posts/2015-12-15-arm.html Guide to Haskell ARM compilers, cross-compilers, and QEMU]
    5 KB (701 words) - 18:13, 14 November 2020
  • OpenGLTutorial1
    ...ssion. Parts of the tutorial have been modified and extended to keep it up to date.'' ...ctually brings a lot of good explanations, even though his syntax isn't up to speed with the latest HOpenGL at all points.
    10 KB (1,585 words) - 09:22, 20 September 2013
  • Concurrency
    ''Note: you may want to read [[Parallelism vs. Concurrency]], as the terms have historically been c This page contains notes and information about how to write concurrent programs in Haskell.
    4 KB (479 words) - 12:02, 9 May 2024
  • Web/Libraries/Formlets
    ...ilding HTML forms that are type-safe, handle errors, abstract and are easy to combine into bigger forms. Here's an example: ...input. To see some of them in action we can make some simple modifications to Main.hs.
    8 KB (985 words) - 06:56, 16 September 2013
  • Type
    In Haskell, '''types''' are how you describe the data your program will work with. ...ssociated with this, such as requiring parameters to the data constructors to be [[eager]], what [[Type class|class]]es are allowed in the [[deriving]],
    7 KB (1,016 words) - 15:20, 6 February 2021
  • From a newbie II
    Hello there. I am another Haskell beginner. I am writting this page to tell my experience with Haskell so far, inspired by the article [[From a ne ...nd improved his C++ style. Since he was a pretty good programmer I decided to take a look. Ugh, what the f*ck is this? So it never went past taking a gla
    2 KB (390 words) - 15:19, 6 February 2021
  • CabalFind
    ...alGet page, and I initially placed this at its end, and now has been moved to a separate page. There is a way to get a list of Cabal files known to search engines. This makes a zero-cost Cabal packages announce and discover
    4 KB (666 words) - 22:21, 23 April 2021
  • Diagrams/Dev/Arrows
    ...nvenient functions for creating arrows pointing from one part of a diagram to another. This page is for gathering ideas and plans for such a module. ...the user to choose from. In addition it ought to be possible for the user to specify any diagram they like for use as an arrowhead.
    8 KB (1,340 words) - 13:19, 29 March 2014
  • UrlDisp
    URLs are everywhere on the web. Most of them, however, are hard to remember, because they are meaningless for humans. This is wrong: URLs are ..., alternatives are tried in the order given (<code>(<|>)</code> associates to the left). The matching algorithm is backtracking.
    4 KB (592 words) - 21:17, 29 June 2021
  • Software transactional memory
    ...ith any other abstraction built using STM, without exposing the details of how your abstraction ensures safety. This is typically not the case with other ...STM, and also exposes STM to the Perl 6 programmer via a similar interface to STM Haskell.
    3 KB (386 words) - 11:56, 15 March 2024
  • Data.Foldable.foldr
    ...value of a <hask>Foldable</hask> structure from right to left, folding it to a single value. <hask>foldr</hask> is a method of the <hask>Foldable</hask> See also [[Data.Foldable.foldl]] for a left-to-right fold. <hask>Data.Foldable.foldr</hask> is a generic version of [[Data
    4 KB (594 words) - 22:51, 29 June 2021
  • Xmonad/Using xmonad in KDE
    Here's how to configure Xmonad to work with KDE. You've heard about the wonders of Xmonad, and you want to try it out.
    10 KB (1,540 words) - 03:32, 27 January 2024
  • Diagrams/Dev/Gradients
    ...the gradient in the tree. (One complication is that the literal reference to the gradient is actually ''above'' the g transform node in the tree, but it ...p in the tree. So when we commute transforms down past a gradient we need to apply only non-frozen transforms. The problem is that we don't know which
    9 KB (1,383 words) - 16:48, 18 November 2013
  • Scrap your boilerplate
    ...Java, which in the Java context means parameterized types which allow you to specify the type of list elements and such things - a feature Haskell has h ...f what you're searching for is lists (e.g. strings) and you ''don't'' want to pick up sublists (substrings, in the case of strings). This function does n
    3 KB (427 words) - 01:33, 28 December 2013
  • 99 questions/21 to 28
    In how many ways can a committee of 3 be chosen from a group of 12 people? We all ...fficients). For pure mathematicians, this result may be great. But we want to really generate all the possibilities in a list.
    6 KB (890 words) - 05:51, 10 June 2023
  • Introduction to Haskell IO/Actions
    When we're programming in Haskell and we want to do something that has a ..."hello world"</hask>, or the function <hask>map</hask>. They can be bound to variable names, passed into a function as an argument or be the result of a
    14 KB (2,254 words) - 20:41, 10 November 2020
  • GHC
    ...GHC. For documentation about GHC's internals and building GHC, head over to the [https://gitlab.haskell.org/ghc/ghc/wikis/index GHC Developer Wiki]. These documents relate to the ''latest released'' version of GHC.
    4 KB (626 words) - 14:08, 14 July 2020
  • Haskell a la carte
    New to Haskell? This menu will give you a first impression. Don't read all the exp ::The ''infinite'' list of fibonacci numbers. Just don't try to print all of it.
    6 KB (1,024 words) - 23:56, 25 June 2021
  • Monad Transformers Tutorial
    Think about code in IO that needs to be able to break out of a loop: So, how would you implement "break"?
    5 KB (801 words) - 19:04, 8 February 2014
  • Command line option parsers
    ...they are distributed across several Hackage categories. Here is an attempt to list them. ...by Google's gflags, provides parsed options in top-level variables, allow to set options via environment variables
    3 KB (401 words) - 09:41, 23 October 2021
  • IO at work
    ''How do I do I/O in Haskell?'' * it's a special file which seems to change anyway (e.g. terminal devices, named pipes);
    8 KB (1,215 words) - 07:10, 12 June 2023
  • Arrow tutorial
    A value of type <code>(Arrow a) => a b c</code> (commonly referred to as just an <i>arrow</i>) represents a process that takes as input a value o * <code>(>>>)</code> composes two arrow values to form a new one by "chaining" them them together, one after another:
    8 KB (1,316 words) - 00:00, 17 June 2021
  • Dutch HUG/Meetings
    ...oup.calendar.google.com&ctz=Europe/Amsterdam Google calendar] or subscribe to the [http://www.google.com/calendar/ical/sv7tbnq0qon2sb1k2abb80i66k%40group ...follow the [http://groups.google.com/group/dutch-hug mailing list] for up to date information.
    10 KB (1,483 words) - 02:59, 25 July 2021
  • HacBerlin2014
    * There is a list of [[/Topics|topics]] people plan to work on. Please extend, update and refine this list. ...ect that you want to share with your fellow Haskellers, please be prepared to give a ''short'' introduction.
    6 KB (915 words) - 10:16, 30 September 2014
  • Yi/FAQ
    *How do I install Yi? before attempting to install.
    9 KB (1,413 words) - 00:17, 24 November 2014
  • DDC/ClassSystem
    '''This is outdated information'''. The DDC project has moved to [http://discus-lang.org http://discus-lang.org] ...see the region annotations, but we can write them in signatures if we want to:
    5 KB (774 words) - 12:35, 8 June 2023
  • FFI complete examples
    ...no make files or helper tools such as c2hs, hsc2hs, or cabal are necessary to build and run these examples. ...ice with no experience in any of Haskell, C, C++, or Python should be able to get all of these examples working. All of the build commands are explicitly
    7 KB (1,181 words) - 21:12, 30 August 2014
  • GHC/Stand-alone deriving declarations
    ...nd-alone deriving mechanism. Please see the linked documentation for an up-to-date account of the present situation.'' ...the instance declaration would have a non-standard context. It would have to look like this:
    5 KB (755 words) - 22:49, 12 June 2021
  • TypeDirectedNameResolution
    This publicly editable page is a place to summarise comments on the Haskell Prime proposal for Type Directed Name Res It's hard to gauge how much people like proposals like this, so let's try the experiment of collec
    7 KB (1,198 words) - 05:55, 10 December 2020
  • Lazy vs. non-strict
    ...matters to the semantics because if you have an expression that evaluates to [[bottom]] (i.e. an <hask>error</hask> or endless loop) then any language t ...ning whatever values are needed to evaluate the expression, plus a pointer to the expression itself. When the result is actually needed the evaluation en
    4 KB (643 words) - 23:33, 5 April 2021
  • Why not Pointed?
    ...finds them more interesting and useful, and considers <code>Pointed</code> to be historical now (he still provides the pointed package only because “pe To be fair, that assessment is a bit of a simplification of my position. ;)
    4 KB (765 words) - 04:26, 4 September 2013
  • HaskellImplementorsWorkshop/2013
    ...entorsWorkshop/2013/Eisenberg|GeneralizedNewtypeDeriving is now type-safe: How "Roles" save the day]]''' (Richard A. Eisenberg) ...[[HaskellImplementorsWorkshop/2013/Jones|Inhabiting Habit: An Introduction to the Habit Compiler]]''' (Mark Jones)
    3 KB (337 words) - 14:28, 7 February 2014
  • GHC/Coercible
    But how do we get from <hask>[String]</hask> to <hask>[HTML]</hask>? We can write The solution available since GHC-7.8.1 is to use <hask>coerce</hask> from the module <hask>Data.Coerce</hask>:
    5 KB (887 words) - 06:53, 12 June 2023
  • Hmatrix on Mac OS X
    [[Category:How to]] First, you will want to install GHC using MacPorts, not the standalone installers. ''No sure why?''
    4 KB (674 words) - 05:29, 8 June 2023
  • Context alias
    ...allow class hierarchies to be restructured without breaking compatibility to a certain degree. Also, it would make fine-grained class hierarchies usable I would like to emphasize an important point from the original proposal that was not emphas
    9 KB (1,395 words) - 23:16, 24 July 2021
  • 99 questions/Solutions/26
    In how many ways can a committee of 3 be chosen from a group of 12 people? We all ...fficients). For pure mathematicians, this result may be great. But we want to really generate all the possibilities in a list.
    5 KB (659 words) - 19:40, 18 January 2014
  • Bluetile
    don't have to. I wanted a tiling window manager that I can just mention to a friend
    5 KB (770 words) - 23:20, 11 July 2021
  • Implement a chat server
    ...ocs/Network-Socket.html Network.Socket], which provides low-level bindings to the C-socket API. ...ckAddr)</hask> — this corresponds to a new socket object which can be used to send and receive data for a given connection. This socket object is then cl
    11 KB (1,739 words) - 04:19, 19 April 2024
  • Web/Frameworks/HSP
    * A (low-to-mid-level) programming model for writing dynamic web pages * Functions for using cgi to show HSP pages
    4 KB (597 words) - 10:39, 19 April 2021
  • Unicode-symbols
    ...use Unicode in your Haskell source then this extension can greatly improve how it looks. Simply put the following above a module to enable unicode syntax:
    9 KB (1,396 words) - 23:18, 24 July 2021
  • CommunityMigration
    * c.h.o migrated to new server, all services functioning as before for all users * A set of migration scripts that can be re-used in case we need to migrate again in the future
    5 KB (793 words) - 04:45, 24 April 2021
  • Parallel/Glossary
    ...nd thread. All foreign exported functions are run in a bound thread (bound to the OS thread that called the function). Also, the main action of every Has ...n performance, but rather because that is the simplest and most direct way to write the program. Since the threads perform I/O, the semantics of the prog
    4 KB (637 words) - 02:02, 6 May 2024
  • Euler problems/61 to 70
    How many n-digit positive integers exist which are also an nth power? How many continued fractions for N ≤ 10000 have an odd period?
    6 KB (979 words) - 10:20, 18 May 2022
  • Evaluation order and state tokens
    The answer is: it's undefined. If you want to understand why, keep reading. Let's get back to something simpler. What's the output of this program?
    21 KB (3,408 words) - 09:26, 9 September 2014
  • Merely monadic
    ...tly ''composable'' - smaller monadic expressions (''actions'') can be used to build larger ones. * the ''mode of computation'': what else it can do, in addition to emitting its ''single'' (hence the name) output value.
    6 KB (988 words) - 04:35, 16 March 2021
  • Dynamic programming example
    ...nching this formula with the help of an array (or any suitable collection) to save useful intermediates and avoid redundant work. Computationally, dynamic programming boils down to write once, share and read many times. This is exactly what lazy functional
    6 KB (929 words) - 06:42, 21 November 2020
  • UnicodeByteString
    ...just works even though different encodings use different numbers of bytes to represent a character. Functions to encode and decode Unicode strings to and from <hask>ByteString</hask>s are provided together with <hask>Data.Lis
    5 KB (717 words) - 15:20, 6 February 2021
  • Avoiding IO
    ...ture says more or less that almost everything must be expected. It is hard to test them, because they can in principle depend on every state of the real ...nsafely disguise the use of I/O, so here instead are some clean techniques to avoid I/O.
    10 KB (1,634 words) - 22:52, 6 April 2022
  • IO in action
    ...e world. The <code>IO</code> type is abstract: no constructors are visible to the user. [...] So another I/O action is needed in order to access that same internal subroutine from Haskell:
    4 KB (674 words) - 07:12, 12 June 2023
  • Phantom type
    .../doc/html/Data-Fixed.html Data.Fixed]</tt> they are used with type classes to encode the precision being used, with [[smart constructors]] * in GADTs they can encode information about how and where a value can be used,
    5 KB (868 words) - 06:40, 11 June 2021
  • Equational reasoning examples
    ...uational reasoning, enabled by [[referential transparency]] and being able to replace equals by equals in all contexts. That is all great, and this page ...xamples here, but your explanatory text should provide sufficient keywords to make this page findable by related searches.
    6 KB (833 words) - 00:02, 6 November 2021
  • Common Misunderstandings
    People going from zero to Haskell are likely to gain a misunderstanding or miss a point that isn't stressed enough. Here a ...en statements must always include an 'else' portion. It might be best not to think of if-then-else as flow control, as in most imperative languages, but
    11 KB (1,668 words) - 15:16, 4 August 2019
  • Functional dependencies
    Functional dependencies are used to constrain the parameters of type classes. They let you state that in a [[mu Suppose you want to implement some code to perform simple [[linear algebra]]:
    4 KB (706 words) - 22:41, 21 July 2021
  • XHB
    XHB is deemed to be used for all sorts of X11 application programming. Why not use tradition * Xlib bindings are incomplete, and seem to be hard to get right
    5 KB (883 words) - 14:29, 3 April 2014
  • Cloud Haskell
    ...ovides a message passing communication model, inspired by and very similar to that of Erlang. ...kage/distributed-process distributed-process]. You will probably also want to install a backend:
    12 KB (1,725 words) - 07:44, 10 August 2022
  • Fold
    ...'unfold'' functions which take a starting value and apply it to a function to generate a data structure. ...r instance, we might want to use a hypothetical function <code>fold</code> to write
    12 KB (1,923 words) - 18:51, 28 March 2019
  • AtomicMemoryOps
    ...b.com/rrnewton/haskell-lockfree lock-free data structures in Haskell], and to perform efficient concurrent operations on existing data structures like IO ...end-users, including CAS on <hask>IORef</hask>s, and in the future we hope to add more functionality for modifying popular data structures such as <hask>
    5 KB (865 words) - 18:26, 21 November 2013
  • CouchDB
    ...erface. I think it is an improvement over the original and most convenient to use! Examples how to use the Haskell CouchDB interface are not easy to find on the web. I found only one [http://www.maztravel.com/haskell/mySqlTo
    12 KB (1,556 words) - 15:19, 6 February 2021
  • Yhc/Javascript/Programmers guide/Echo demo source
    -- Import the UnsafeJS module to get access to the low-level Javascript, -- that is, ability to wrap arbitrary Javascript expressions into
    12 KB (2,023 words) - 22:51, 5 April 2021
  • Emacs
    ...ely. Lookup the specific help files to find out what each of them provide. To test if haskell-mode is actually installed type: M-x haskell-<tab>. You sho ...ellmode-emacs a low traffic mailing list], too. Generally it is responsive to new posts.
    5 KB (698 words) - 17:44, 17 December 2023
  • Applications and libraries/Interfacing other languages
    Haskell's built-in features for interfacing to other languages are formally defined in the ...tools and libraries either simplify interfacing to C or allow interfacing to other languages and environments (COM, JVM, Python, Tcl, Lua...).
    7 KB (1,100 words) - 06:49, 8 June 2023
  • Research papers/Top 10
    ;[http://homepages.inf.ed.ac.uk/wadler/papers/class/class.ps.gz How to make ad-hoc polymorphism less ad hoc]
    3 KB (361 words) - 06:58, 1 June 2022
  • Safely running untrusted Haskell code
    [[Category:How to]] ...[[IRC_channel|IRC channels]], in particular, the Haskell channel. In order to do this, a particular security policy is required. The policy, and its impl
    5 KB (830 words) - 12:41, 22 June 2021
  • Memoization
    Now, how to implement something like this? Of course, one needs a finite ...<code>Map a b</code> is the type of a finite map from keys <code>a</code> to values <code>b</code>.
    12 KB (1,702 words) - 16:05, 28 April 2014
  • If-then-else
    ...nerate documentation for it, a text editor can make suggestions for values to insert, Hoogle can retrieve that function. ...d be defined in terms of <hask>if'</hask>. Actually, they do not even need to be in Prelude because they can be constructed so easily.
    6 KB (937 words) - 05:34, 10 December 2020
  • Multiplate
    The easiest way to understand how to use Multiplate is to look at a simple example. We assume you have the transformers library inst The first thing we are going to define is a 'plate' for this language.
    7 KB (1,049 words) - 07:41, 3 March 2022
  • Simonpj/Talk:OutsideIn
    ...rsion 3 (camera ready copy for JFP) is very substantially revised compared to the May 2010 version. ...features, such as GADTs, type classes, and type families have have proven to be invaluable language extensions for ensuring data invariants and program
    9 KB (1,527 words) - 09:11, 10 August 2022
  • Haskell Lisp
    # Haskell implementations written in Lisp (there seems to be only one of these) Also, there is a [https://twitter.com/HaskellLisp twitter account] dedicated to all things Haskell+Lisp.
    5 KB (799 words) - 16:55, 23 March 2021
  • 99 questions/Solutions/39
    ...l primes in the range between a and b we simply take all numbers from a up to b and filter all the primes through. ...le\sqrt b</math>) a memoized primes list produced by sieve of Eratosthenes to which it refers internally. So it'll be slower, but immediate, testing the
    5 KB (696 words) - 19:46, 18 January 2014
  • Books and tutorials
    ...tp://web2.comlab.ox.ac.uk/oucl/publications/books/functional/ Introduction to Functional Programming using Haskell (Second Edition] .../www.cambridge.org/catalogue/catalogue.asp?ISBN=9780521277242 Introduction to Functional Programming Systems Using Haskell]
    6 KB (838 words) - 12:31, 11 October 2019
  • Referential transparency
    A key advantage to pure functional programming is the property of referential ...with the term first being introduced to the study of programming languages by Christopher Strachey[[#notes|[5]]]:
    5 KB (774 words) - 10:59, 15 August 2023
  • OpenGLTutorial2
    ...sion. Parts of the tutorial have been modified and extended to keep it up to date.'' ...considered the fact that some manipulations would not necessarily be good to do on the entire picture.
    20 KB (3,092 words) - 11:52, 20 September 2013
  • Installing xmonad log applet
    awick has created a gnome-panel applet to read and display xmonad logHook output, which frees gnome-panel users from the need to run an
    6 KB (1,036 words) - 10:20, 20 April 2021
  • SDL
    ...L2 hsSDL2] and [http://hackage.haskell.org/package/sdl2 sdl2] are bindings to the [http://www.libsdl.org/ C library libSDL] ...platforms' graphics, sound, and input devices. Software developers use it to write computer games or other multimedia applications that can run on many
    7 KB (1,003 words) - 23:19, 5 April 2021
  • WebApplicationInterface
    ...ently a WAI package on Hackage which is actively maintained and very close to the proposal described here. I recommend we remove this page. -- Michael Sn ...interface between web servers and Haskell web applications or frameworks, to promote web application portability across a variety of web servers.
    14 KB (2,193 words) - 05:45, 12 July 2021
  • Diagrams/Dev/Expression
    ...uctor to your data type but then you have to go through and add a new case to the implementation of every existing function). ...does not require changing existing backends, which will simply not be able to render it) but also new backends.
    8 KB (1,309 words) - 19:09, 18 May 2014
  • 99 questions/70B to 73
    In Prolog or Lisp, one writes a predicate to check this. ...l members of this type are multiway trees; there is no use for a predicate to test them.
    5 KB (876 words) - 05:50, 11 June 2023
  • Applications and libraries/Music and sound
    ...er frontend to mpg321 and mpg123. It is written in Haskell. It is designed to be simple, fast and robust. It's very stable, with one instance running for :Minstrel is a curses frontend to the GStreamer library written in Haskell.
    6 KB (831 words) - 20:07, 5 December 2021
  • Yhc/Javascript/Programmers guide/Up from the ground
    ...is a decimal or a Roman numeral that can be converted. A timer is provided to measure code performance. ...ort library. Just like programming in machine codes on "bare iron": that's how first programs were created.
    21 KB (3,466 words) - 15:19, 6 February 2021
  • Lightweight concurrency
    ...ns provided by the RTS. This will provide a Haskell programmer the ability to build custom schedulers and concurrency libraries. For an earlier attempt a -- set to Running, and current thread's status is set to SwitchStatus that was
    19 KB (2,840 words) - 16:41, 1 August 2021
  • Maintaining laziness
    This leads to unnecessary inefficiencies, [[memory leak]]s and, we suspect, unintended se ...constructs which break laziness without need, and finally we want to link to techniques that may yield the same effect without laziness.
    20 KB (3,325 words) - 12:02, 19 April 2024
  • HaTeX User's Guide
    If you are here because you want to learn more about HaTeX, or just feel ...ou are in the right place. First of all, note that this guide is addressed to that
    21 KB (3,518 words) - 09:52, 14 May 2014
  • Nitpicks
    This page is for people to record nitpicks about the Haskell language. ...hat is annoying or could be improved, but is probably not important enough to justify the added complexity of tacking it on as an extension or breaking e
    7 KB (1,033 words) - 01:16, 27 September 2021
  • Category theory/Natural transformation
    In the followings, this example will be used to illustrate the notion of natural transformation. If the examples are exagge * Let <math>\Phi, \Psi : \mathcal C \to \mathcal D</math> be functors.
    9 KB (1,305 words) - 03:17, 23 September 2014
  • GPipe/Tutorial
    Let's walk our way through an simple example as I explain how you work with these types. This example requires GPipe version 1.4.1 or lat at the prompt to see a spinning box. You’ll also need an image named &quot;<tt>myPicture.j
    11 KB (1,451 words) - 08:50, 19 April 2014
  • SceneGraph
    The aim of the Haskell Scene Graph project is to provide a solid basis component, it is not easy to extract a useful library. The project's aim is to provide such a library.
    6 KB (988 words) - 04:52, 26 April 2021
  • Yhc/RTS/Exceptions
    ...Yhc. Imprecise exceptions allow any kind of exception (including 'error') to be thrown from pure code and caught in the IO monad. This page attempts to describe how imprecise exceptions are implemented in the Runtime System.
    8 KB (1,141 words) - 01:44, 14 July 2021
  • 99 questions/80 to 89
    ...the block so we know someone's working on it. Then, change n in your block to the appropriate problem number, and fill in the <tt><Problem description>,< There are several ways to represent graphs in Prolog. One method is to represent each edge separately as one clause (fact). In this form, the grap
    11 KB (1,679 words) - 06:20, 11 June 2023
  • Dependent type
    ...aries and tools/Linguistics#Other functional or Haskell-related approaches to linguistics|his online course and other linguistical materials on the Lingu To see how Illative [[Combinatory logic]] deals with dependent types, see combinator '
    6 KB (884 words) - 16:00, 19 April 2021
  • FAQ
    ...d questions from [[IRC channel|<tt>#haskell</tt> IRC]]. The goal is simply to collect and edit some common answers. Beginner questions are still welcome ...iki, so please edit the text with any improvements you have. And feel free to add new questions, if they are frequently asked.
    36 KB (5,813 words) - 06:04, 13 April 2024
  • Debugging
    .../haskell/comments/2fwwx3/how_to_get_approx_stack_traces_with_profiled/ How to get (approx) stack traces with profiled builds]. *** Exception (reporting due to +RTS -xc): (THUNK_2_0), stack trace:
    9 KB (1,453 words) - 19:18, 3 February 2021
  • XMonadContribTour
    ...ful when you know what are you looking for, but when you're looking around to find if some feature is implemented already, the way that the documentation ...oks.DynamicLog] it provides some drop-in loggers and some helper functions to make your own logger.
    7 KB (1,099 words) - 15:18, 6 February 2021
  • Monad/ST
    * TuringTest: chessguy: You pass in normal Haskell values and then use ST to allocate mutable memory, then you initialize and play with it, then you put Now, the type of the function used to escape <code>ST</code> is:
    5 KB (802 words) - 05:38, 4 August 2021
  • Lifting
    Lifting is a concept which allows you to transform a function into a corresponding function within another (usually ...r functor first. Haskell doesn't allow a <hask>type Pair a = (a, a)</hask> to be a functor instance, so we define our own Pair [[type]] instead.
    7 KB (1,165 words) - 20:40, 31 October 2019
  • GHC/Using rules
    ...is a place for people who use rewrite rules to collect thoughts about how to use them. * Remember to use the flag <tt>-fglasgow-exts</tt> and the optimisation flag <tt>-O</tt>
    19 KB (3,096 words) - 17:21, 4 February 2023
  • Haskell in web browser/Calc example
    ...the browser's input facilities. Another (<code>dispmb</code>) will be used to update the calculator's display element. ...ver this list. Finally, the resulting list is folded with <code>+++</code> to sequence all buttons properly.
    6 KB (908 words) - 15:18, 6 February 2021
  • Continuation tutorials timeline
    ...s on its own as an explanation of continuations, then please take a moment to paste the link somewhere on this page (register a throwaway account, if you ...of code that we went executed next (i.e. the continuation) as an argument to a function."
    6 KB (866 words) - 02:16, 2 May 2024
  • Tying the Knot
    This creates the cyclic list consisting of 0 and 1. It is important to stress that this procedure allocates only two numbers - 0 and 1 - in memory = 0 : 1 : x -- Knot! Back to the beginning.
    24 KB (3,850 words) - 17:16, 28 June 2021
  • ZuriHac2013
    ...own power sockets]. We can't provide converters for everybody so make sure to bring one along. Do note that the [http://en.wikipedia.org/wiki/AC_power_pl This is a great opportunity to meet your fellow haskellers in real life,
    16 KB (2,339 words) - 12:15, 8 April 2014
  • HacBerlin2014/Topics
    * I'd like to get to know the GHC codebase / become involved in compiler/RTS development * Library maintenance. I'm going to try to make maintenance releases for a number of libraries and tools, including ge
    8 KB (1,326 words) - 20:19, 28 September 2014
  • The Monad.Reader/Issue4/Why Attribute Grammars Matter
    attribute grammars and their relation to functional programming The purpose of this article is twofold. On the one hand it illustrates how
    22 KB (3,703 words) - 21:20, 30 May 2021
  • How to write a Haskell program
    A developers' guide to creating a new Haskell project or program, and working in the Haskell devel everyone by increasing productivity, and you're more likely to get
    22 KB (3,268 words) - 04:57, 30 January 2022
  • GHC/As a library (up to 6.8)
    ''For instructions on the GHC API with GHC 7 and above please refer to [[GHC/As_a_library]]'' ...a Haskell library, which lets you write a Haskell program that has access to all of GHC.
    18 KB (2,724 words) - 11:05, 17 January 2014
  • GHC/GHCi
    ...e latest version of GHCi, beyond what the User's Guide covers. Please add to it! ...ind these files. In general, the snippets on this page can be added there to enable the desired features by default. This page will assume you are usin
    21 KB (3,021 words) - 12:03, 15 May 2020
  • Monoid
    ...instance declaration for a type ''m'' as precisely what you need in order to fold up a list of values of ''m''. Indeed, appending the empty list to either end of an existing list does nothing, and <hask>(x ++ y) ++ z</hask>
    7 KB (1,101 words) - 02:30, 27 December 2019
  • Mailing lists
    There are three mailing lists to discuss issues related to Haskell in * [http://haskell.org/mailman/listinfo/haskell Subscribe to haskell@haskell.org] (announces only, low traffic)
    11 KB (1,569 words) - 15:28, 7 July 2022
  • Research papers/Domain specific languages
    ;[http://www.haskell.org/wikiupload/c/c6/ICMI45-paper-en.pdf How to build a monadic interpreter in one day] (pdf) :By Dan Popa. A small tutorial on how to build a language in one day, using the Parser Monad in the front end and a
    9 KB (1,309 words) - 07:48, 18 September 2014
  • 99 questions/54A to 60
    Since a "leaf" node is a branch with two empty subtrees, it can be useful to define a shorthand function: In Prolog or Lisp, one writes a predicate to do this.
    9 KB (1,368 words) - 02:54, 11 June 2023
  • Error vs. Exception
    ...both terms are related and sometimes hard to distinguish, it is important to do it carefully. The first problem is that "exception" seems to me to be the historically younger term.
    16 KB (2,728 words) - 16:45, 23 July 2019
  • GHC/SuperClass
    * specifically using SuperClass Type Equality Constraints to simulate Functional Dependencies; * using repeated type variables in Instances to test for type equality; and
    14 KB (2,091 words) - 17:28, 4 February 2023
  • Tutorials/Programming Haskell/String IO
    can get up to speed by reading [[Tutorials/Programming Haskell/Introduction|yesterday's i One issue I forgot to mention was that there are slight differences
    19 KB (3,139 words) - 04:08, 22 October 2021
  • ZuriHac2014
    ...own power sockets]. We can't provide converters for everybody so make sure to bring one along. Do note that the [http://en.wikipedia.org/wiki/AC_power_pl This is a great opportunity to meet your fellow haskellers in real life,
    9 KB (1,284 words) - 18:50, 11 June 2019
  • OpenGL
    ** [http://hackage.haskell.org/package/GLURaw GLURaw] is similar to OpenGLRaw, just for the GLU part of OpenGL. ...me knowledge of OpenGL. Good for those who have written something but want to avoid common pitfalls.
    9 KB (1,237 words) - 02:14, 8 August 2022
  • Xmonad/Using xmonad in XFCE
    ...touted as the most "nimble" of the lot. In my own opinion, it is simpler to use than KDE but with more configuration options (and a saner environment) == Configuring XMonad to work with Xfce ==
    11 KB (1,742 words) - 10:28, 28 October 2013
  • Haskell program coverage
    Hpc is a tool-kit to record and display Haskell program coverage. Hpc includes tools that instrument Haskell programs to record program
    20 KB (2,607 words) - 17:13, 16 June 2022
  • Mac OS X
    There is also now the [[Mac OS X Strike Force]] that aims to improve using Haskell on OS X. ...nal programming, prototype Haskell code, interactively visualize data, and to create interactive animations.
    7 KB (1,042 words) - 15:32, 26 December 2022
  • Meet Bob The Monadic Lover
    Now, we would like to keep track of all his/her ... ehm, affairs... going to need:
    28 KB (4,668 words) - 15:16, 6 February 2021
  • 99 questions/31 to 41
    ...defined as the number of positive integers r (1 <= r < m) that are coprime to m. ...algorithms. Take the number of reductions as a measure for efficiency. Try to calculate phi(10090) as an example.
    6 KB (805 words) - 02:30, 11 June 2023
  • Output/Input
    ...[...] if the side effect can’t be in the functional program, it will have to be outside it. ....ac.uk/download/9835633.pdf <span></span>]. The effect of this proposal is to place the non-determinism <i>entirely</i> outside the software [...]
    8 KB (1,236 words) - 12:36, 1 January 2024
  • Haskell IO for Imperative Programmers
    ...ou how to do imperative programming in Haskell; I want to show you how not to. ...t stated that one must master category theory in order to so much as write to standard output. Nothing could be further from the truth. Witness
    20 KB (3,555 words) - 06:05, 24 April 2024
  • Dealing with binary data
    [[Category:How to]] ...ies like coverage of the Unicode space and laziness, however when it comes to dealing with bytewise data, <hask>String</hask> involves a space-inflation
    17 KB (2,795 words) - 04:06, 16 June 2020
  • Curry-Howard-Lambek correspondence
    ...ory]]. Interestingly, the isomorphism maps programs (functions in Haskell) to (constructive) proofs in logic (and ''vice versa''). A (non-trivial) Haskell function maps a value (of type <hask>a</hask>, say) to another value (of type <hask>b</hask>), therefore, ''given'' a value of typ
    8 KB (1,303 words) - 15:42, 18 November 2019
  • GHC/CloudAndHPCHaskell
    This page serves to discuss the architecture of Cloud and High Performance Computing (HPC) fram ...ry Parallel Haskell in Haskell], Patrick Maier and Phil Trinder, submitted to IFL 2011
    6 KB (959 words) - 08:48, 10 August 2022
  • Xmonad/Config archive/John Goerzen's Configuration
    ...imer|I use this exact configuration]] on everything from a 1024x600 Eee PC to a 1920x1200 24" workstation, and it works well on all of them. ...tall xmonad. You can find instructions for that on xmonad.org. I'm going to assume xmonad 0.8 here.
    20 KB (3,066 words) - 13:01, 24 May 2020
  • Applications and libraries/Compiler tools
    :[[Happy]] is a parser generator system for Haskell, similar to the tool `yacc' for C. Like `yacc', it takes a file containing an annotated ...r generator for Haskell using monadic parser combinators. It was developed to be compatible with Happy.
    13 KB (1,947 words) - 14:44, 21 July 2023
  • FFI imports packaging utility
    ...ell Foreign Functions Import Generator ('''hsffig''') [[#3|[3]]] is a tool to convert a '''C''' header file (.h) into Haskell code containing FFI [[#2|[2 ...nded that readers of this document be familiar with the documents referred to as [[#3|[3]]] and [[#4|[4]]].
    19 KB (2,929 words) - 23:51, 13 September 2013
  • Smart constructors
    This is an introduction to a programming idiom for placing extra Consider the following problem: we want to be able to specify a data
    9 KB (1,351 words) - 18:21, 6 June 2020
  • Web/Frameworks
    ...es several options. You can view the [[Web/Deploy]] page to get an idea of how you might deploy an application written in some of these frameworks. ...o: there are also many [[Web/Frameworks/Inactive|inactive web frameworks]] to draw inspiration from
    12 KB (1,789 words) - 17:49, 26 October 2020
  • ListT done right
    ...equational properties. So the key is to think about what you actually want to happen. ...composite of two monads (<hask>m</hask> and the list monad). This leads us to the study of distributive laws. There is a canonical distributive law when
    13 KB (2,036 words) - 13:54, 4 July 2023
  • GHC/Data Parallel Haskell
    ...for Parallel Haskell? DPH is a fantastic effort, but it's not the only way to do parallelism in Haskell. Try the [[Parallel|Parallel Haskell portal]] for ...structures (such as sparse matrices and tree structures). An introduction to nested data parallelism in Haskell, including some examples, can be found i
    21 KB (3,158 words) - 08:39, 10 August 2022
  • Exception
    In general you should be very careful not to [[Error vs. Exception|mix up]] exceptions with [[error]]s. The great thing about Haskell is that it is not necessary to hard-wire the exception handling into the language.
    10 KB (1,404 words) - 06:22, 22 January 2020
  • Regular expressions
    ...New users may feel overwhelmed with the various options that are available to them. The following table provides an overview of the various features sup * Bryan O'Sullivan's text-icu – bindings to the [http://site.icu-project.org/ ICU library], which includes Perl compati
    18 KB (2,819 words) - 19:20, 15 August 2019
  • Introduction to QuickCheck1
    ...and testing Haskell code. See [[Introduction_to_QuickCheck2| Introduction to QuickCheck2]] for the QC2 version -- I've written a function that looks similar to this one
    8 KB (1,186 words) - 20:49, 28 May 2021
  • Emacs/Inferior Haskell processes
    ...ll, the option is called <code>haskell-program-name</code>. You may set it to <code>"/some/where/ghci.exe"</code> or even <code>"cabal-dev ghci"</code>. ...to see whether the key shortcuts I'd chosen were free but I was surprised to find that ''every one'' of these functions is already provided by inf-haske
    8 KB (1,358 words) - 17:26, 9 August 2019
  • Blog articles/Comparisons
    Articles comparing Haskell to other languages, or describing the use of ...-execution-in-erlang.html PARE - PARallel Execution in Erlang - a response to Haskell]
    13 KB (1,443 words) - 23:42, 13 October 2019
  • Haskore
    To get an impression how intuitive music composition with Haskore is, see the following example code and separate packages for connecting to various back-ends and separated real-time stuff.
    8 KB (1,173 words) - 10:09, 14 July 2014
  • Xmonad/Guided tour of the xmonad source/StackSet.hs
    data structures used to store the state of xmonad. It is heavily ...parameters'' to <hask>StackSet</hask>---five types which must be provided to form a concrete instance of <hask>StackSet</hask>. It's not obvious just f
    16 KB (2,690 words) - 16:02, 26 December 2022
  • Xmonad/Config archive/Template xmonad.hs (0.8)
    -- and how to override the defaults in your own xmonad.hs conf file. -- modMask lets you specify which modkey you want to use. The default
    9 KB (1,218 words) - 15:17, 6 February 2021
  • Tutorials
    ==Introductions to Haskell== These are the recommended places to start learning, short of buying a [[Books#Textbooks|textbook]].
    31 KB (4,662 words) - 08:38, 20 April 2024
  • Why Haskell matters
    ...quences of actions. The programmer quite explicitly tells the computer how to perform a task, step-by-step. ...ges (imperative as well as functional) have implemented garbage collection to remove resource management from the problem, and lets the programmer focus
    33 KB (5,616 words) - 22:30, 3 May 2024
  • AngloHaskell/2008
    ...008/ Slides and audio from the talks] and fungrit are now available thanks to matthew-_''' ...)). Philippa Cowderoy is also prodding the organisers at regular intervals to do some organising...
    11 KB (1,801 words) - 09:22, 23 May 2022
  • WxHaskell/Quick start
    This document is written to get you started quickly with writing wxHaskell applications. Further docume ...undutb/Kurser/afp/2005/yahu.html yahu] getting started page – first of all to make my job easier by reusing [http://www.cs.chalmers.se/~koen Koen Claesse
    14 KB (2,248 words) - 15:18, 6 February 2021
  • HUnit 1.0 User's Guide
    ...for Haskell, inspired by the JUnit tool for Java. This guide describes how to use HUnit, assuming you are familiar with Haskell, though not necessarily w ...askell.org].). Unit testing frameworks for various languages are referred to as [https://en.wikipedia.org/wiki/XUnit xUnit].
    23 KB (3,542 words) - 03:11, 15 May 2020
  • Gtk2Hs/Tutorials/Intro
    Note: this page is under construction. Feel free to help out! *You believe using Glade to design your user interface is a good idea.
    9 KB (1,531 words) - 08:59, 23 May 2021
  • Programming guidelines
    Programming guidelines shall help to make the code of a project better It takes some programming experience to develop something like a
    17 KB (2,651 words) - 09:36, 10 August 2022
  • Xmonad/Config archive/Template xmonad.hs (0.6)
    ...ed'' to use this config file to replicate the default config. This is here to serve as an example. A minimal xmonad-0.6 config that uses the default conf -- and how to override the defaults in your own xmonad.hs conf file.
    10 KB (1,329 words) - 15:18, 6 February 2021
  • Xmonad/xmonad development tutorial
    So, you've got an idea for a great extension to xmonad, and you think As a running example, let's suppose you want to develop an extension
    16 KB (2,392 words) - 17:44, 2 August 2021
  • Zipper
    The Zipper is an idiom that uses the idea of “context” to the means of Sometimes you want to manipulate a ''location'' inside a data structure,
    10 KB (1,623 words) - 21:10, 26 June 2023
  • Introduction
    wrote a small relational DBMS in Haskell had this to say: Even if you are not in a position to use Haskell in your programming projects, learning Haskell can make you a b
    26 KB (4,102 words) - 23:54, 29 February 2020
  • The Monad.Reader/Issue2/Bzlib2Binding
    is part of the standard library. It enables Haskell functions to call procedures in other languages and other languages to call Haskell
    15 KB (2,511 words) - 06:03, 1 June 2022
  • Keywords
    This page lists all Haskell keywords, feel free to edit. [[Hoogle]] searches will return results from this page. Please respec For additional information you might want to look at [http://www.haskell.org/onlinereport/haskell2010/ the Haskell 2010
    22 KB (3,350 words) - 04:31, 8 June 2023
  • Library/Streams
    Goerzen. I especially want to thank John for his clever design and implementation. Really, I just renamed HVIO to Stream and presented
    21 KB (3,181 words) - 16:03, 14 March 2014
  • Generalised algebraic datatype
    ...by François Pottier and Yann Régis-Gianas. It contains also a lot of links to other papers on GADTs. ...ipt/simple-translate-gadts.ps Translating Generalized Algebraic Data Types to System F] written by [http://www.cs.mu.oz.au/~sulzmann/ Martin Sulzmann] an
    8 KB (1,374 words) - 14:33, 15 December 2022
  • Hackage wiki page per project discussion
    I'll post a link to this page to haskell-cafe so everyone should participate While packaging some packages for nix (using [[Hack-Nix]]) I had to write some patches.
    18 KB (3,049 words) - 10:29, 7 February 2021
  • 99 questions/61 to 69
    As defined [[99 questions/54A to 60|here]]. A leaf is a node with no successors. Write a predicate count_leaves/2 to count them.
    12 KB (1,696 words) - 05:35, 11 June 2023
  • Windows
    This page describes what you need to know to ''use'' Haskell on a Windows machine. .../Building/Preparation/Windows the GHC Trac Wiki] for what you need to know to ''build'' GHC on Windows.
    12 KB (1,886 words) - 19:30, 3 February 2021
  • Haskell programming tips/Discussion
    ...nt for discussions about ThingsToAvoid, as consensus seems to be difficult to reach, and it'd be nice if newbies wouldn't bump into all kinds of Holy War You may want to add your name to your comments to make it easier to refer to your words and ridicule you in public.
    24 KB (4,110 words) - 01:13, 7 November 2020
  • GetOpt
    programs and thought it might be useful to catalogue them. A lot of think the general idea might be useful, so please add to this if you
    10 KB (1,542 words) - 05:40, 8 June 2023
  • Monomorphism restriction
    ...e compiler throwing type errors at you in situations where you expected it to infer a perfectly sane type for a polymorphic expression. ...o specify <code>plus :: Integer -> Integer -> Integer</code>. When applied to <code>plus 3.5 2.7</code>, GHCi will then produce the somewhat-misleading-l
    16 KB (2,628 words) - 21:19, 16 December 2022
  • Monad tutorials timeline
    ...t stands on its own as an explanation of monads, then please take a moment to paste the link somewhere on this page (register a throwaway account, if you *: "This paper explores the use monads to structure functional programs. No prior knowledge of monads or category the
    35 KB (4,953 words) - 00:05, 9 May 2024
  • GHC/FAQ
    Please feel free to add stuff here. This page is rather long. We've started to add some sub-headings, but would welcome your help in making it better orga
    36 KB (5,898 words) - 06:04, 10 August 2022
  • Performance/GHC
    ...ny credible competition in the performance department these days it's hard to say what overly-slow means, so just use your judgement! Of course, if a GH Optimise, using <tt>-O</tt> or <tt>-O2</tt>: this is the most basic way to make your program go faster. Compilation time will be slower, especially w
    25 KB (3,873 words) - 11:08, 6 March 2023
  • HStringTemplate
    This page is work in progress, and aims to supplement the API docs with tutorial style documentation and template synt .... StringTemplates can be based around any 'Stringable' type, allowing you to use ByteString's or any other type if you write the Stringable instance. T
    12 KB (1,726 words) - 15:16, 6 February 2021
  • TerraHS
    *[[Why to use Haskell for GIS programming ? ]] Example of vector data that can be exported to a TerraLib database, and then it can be visualised with [http://www.dpi.inp
    10 KB (1,345 words) - 22:49, 29 June 2021
  • Foldable Traversable In Prelude
    ...ents of this proposal may still be under discussion, this page is intended to summarize the proposal as it now stands as of 28 January, 2015. It is a wor ...es Committee" was formed to manage and steward such large changes in a way to vet them thoroughly and ensure minimal breakage in carrying them out.
    14 KB (2,640 words) - 11:47, 26 November 2023
  • Foreign Function Interface
    The Foreign Function Interface (FFI) allows Haskell programs to cooperate with programs written with other languages. Haskell programs can ...tance, to call the exponential function ("exp") of the libc, you only have to translate its prototype:
    33 KB (5,008 words) - 16:46, 20 December 2023
  • HIDE
    ...ns]] [[Category:Proposals]] [[Category:Development tools]][[Category:Pages to be removed]] ...any problems are yet to be resolved (see, say, the Proxima thesis). It has to be noted, however, that no conceptual problem was encountered with the GHC
    24 KB (4,039 words) - 04:38, 24 April 2021
  • IO Semantics
    * These are only some of the various ways to describe the semantics of </i><code>IO a</code><i>; your actual implementat The idea is to define <code>IO</code> as
    11 KB (1,628 words) - 10:36, 5 April 2024
  • Implementations
    ...implementations. The [https://www.haskell.org/downloads/ recommended] way to install Haskell on your computer is through [https://www.haskell.org/ghcup/ The currently [https://www.haskell.org/downloads/ recommended] way to install GHC and some related tools is with [https://www.haskell.org/ghcup/
    9 KB (1,363 words) - 15:57, 9 March 2024
  • Continuation
    ...ent the future of a computation, as a function from an intermediate result to the final result ([http://www.haskell.org/haskellwiki/All_About_Monads#The_ * The idea behind CPS is to pass around as a function argument what to do next ([http://users.umiacs.umd.edu/~hal/docs/daume02yaht.pdf Yet Another
    10 KB (1,560 words) - 12:02, 15 April 2024
  • Haskell programming tips
    ...a matter of taste. We all know this, please don't add "this is disputable" to each item! ...ting library function, the reader of your code might spend a minute trying to figure out why you've done that. But if you use a standard function, the re
    29 KB (4,702 words) - 12:36, 4 May 2021
  • Future of Haskell
    ...e current definition of the Haskell language. Compilers will also continue to support the previous version of Haskell, [http://haskell.org/onlinereport/ ...t the new feature or convince the developers of one of the Haskell systems to do so.
    11 KB (1,692 words) - 16:37, 28 January 2023
  • Quasiquotation
    ...tufts.edu/comp/150FP/archive/geoff-mainland/quasiquoting.pdf Why It's Nice to be Quoted: Quasiquoting for Haskell]. ...Haskell's existing support for domain specific languages, you are now free to use new syntactic forms for your EDSLs.
    12 KB (1,695 words) - 15:27, 12 November 2019
  • Existential type
    ==Introduction to existential types== ...es can be ''used'' for several different purposes. But what they ''do'' is to 'hide' a type variable on the right-hand side.
    13 KB (2,093 words) - 10:57, 25 October 2023
  • X window programming in Haskell
    This tutorial will show you how to write a simple X application using ...to expand this page when the XCB Haskell binding is done. -->. The goal is to write a simple text-based clock displaying the system time, running on top
    61 KB (8,858 words) - 11:47, 5 November 2020
  • Xmonad/Using xmonad on Apple OSX
    xmonad runs well under X11 on Apple OSX machines, and needs little work to be ...orm/mac.html Haskell Platform installer] for your platform. I may be able to dig up a Haskell Platform for Leopard PPC (G4, ppc7450) if needed, although
    11 KB (1,893 words) - 17:07, 5 November 2014
  • Library/CC-delcont
    ...atively straight forward to port (whenever possible, I have endeavored not to use the operators on abstract prompt and sub-continuation [[type]]s from CC ...to implement (and understand) most common control flow directly than it is to implement continuations?
    25 KB (4,039 words) - 16:39, 12 March 2024
  • Euler problems/181 to 190
    Investigating in how many ways objects of two different colours can be grouped. this code, I tried to search for the solution by generating a
    15 KB (2,018 words) - 01:29, 26 April 2021
  • Haskell for multicores
    This site attempts to document all our available information on ...lowering absolute wall clock times. The machines we target are typical 2x to 32x desktop multicore machine, on which vanilla GHC will run.
    12 KB (1,738 words) - 06:06, 23 July 2020
  • GHC/Type families
    ...e used to define overloaded ''data'' in the same way that classes are used to define overloaded ''functions''. Type families are useful for generic prog ...hile associated types can more clearly express how a type is used and lead to better error messages.
    42 KB (6,828 words) - 17:15, 4 February 2023
  • IRC channel
    The Freenode IRC network used to host the very large #haskell channel, and we've had up to 1046
    11 KB (1,536 words) - 08:17, 29 March 2022
  • Regular expressions for XML Schema
    [[HXT| HXT: A gentle introduction to the Haskell XML Toolbox]] This is a technique to make the regular expressions operational in a direct way without the clumsy
    22 KB (3,425 words) - 22:34, 29 June 2021
  • Plainly partible
    ...e of trees - they have been reduced to an implementation detail, oblivious to the users of <tt>name_supply</tt> values. ...hange its value. Lennart Augustsson, Mikael Rittri and Dan Synek take this to an extreme in their functional pearl [https://www.cambridge.org/core/servic
    11 KB (1,656 words) - 22:33, 4 July 2022
  • Chaitin's construction
    This question leads us to [[exact real arithmetic]], and [[algorithmic information theory]], and foun ...wikipedia.org/wiki/Chaitin%27s_constant Chaitin's construction], referring to e.g.
    10 KB (1,527 words) - 09:31, 24 April 2024
  • Xmonad/General xmonad.hs config tips
    ...ult" and others. If you can't find what you're searching for, you may want to look at the [[Xmonad/Config_archive|Config archive]] or ask for help on #xm Also useful, for an overview of how to configure bindings and hooks, and (somewhat out of date) summary of xmonad-
    37 KB (5,217 words) - 02:13, 12 April 2019
  • Xmonad/Notable changes since 0.8
    (0.8.1 was a maintenance release, with no changes to user functionality. It simply included ghc-6.10.1 related updates and a ghc ...a user upgrading from 0.8 to 0.9 might like to know, so that they are sure to be included in the 0.9 release notes.
    21 KB (3,078 words) - 08:18, 23 May 2021
  • Foldr Foldl Foldl'
    To ''foldr'', ''foldl'' or ''foldl''', that is the question! We are going to define our own folds so we hide the ones from the Prelude:
    16 KB (2,235 words) - 10:26, 29 March 2019
  • Research papers/Monads and arrows
    :Philip Wadler and Peter Thiemann. Submitted to ACM Transactions on Computational Logic. (Cited by 62) ...homepages.inf.ed.ac.uk/wadler/papers/monadsdeclare/monadsdeclare.ps.gz How to declare an imperative]
    18 KB (2,331 words) - 09:02, 1 September 2022
  • Euler problems/31 to 40
    g 0 _ = [[]] -- exactly one way to get 0 sum, with no coins at all g n [] = [] -- no way to sum up no coins to a non-zero sum
    11 KB (1,557 words) - 09:03, 19 September 2014
  • A brief introduction to Haskell
    ...cle [http://www.cs.jhu.edu/~scott/pl/lectures/caml-intro.html Introduction to OCaml], and translated from the OCaml by Don Stewart. Has some novel features relative to Java (and C++).
    41 KB (6,592 words) - 22:27, 3 May 2024
  • Research papers/Functional pearls
    ...elegant, instructive examples of functional programming. They are supposed to be fun, and they teach important programming techniques and fundamental des * [http://icfp06.cs.uchicago.edu/bird-talk.pdf How to Write a Functional Pearl]
    20 KB (2,961 words) - 16:50, 6 February 2024
  • OOP vs type classes
    (this is just a sketch now. feel free to edit/comment it. I will include information you provided into the final ver I'd gone to implement general purpose libraries and tried to maintain
    30 KB (4,685 words) - 01:34, 14 July 2021
  • Glome tutorial
    ...ry old version of Glome. Some things have changed, including a transition to a type-class system for defining solids. Most of this content is still rel First, you need to install the software. The GlomeTrace library has few dependencies, but Glo
    40 KB (6,787 words) - 01:19, 8 April 2014
  • 10分で学ぶHaskell
    [[how to work on lists]]も参照してください。
    17 KB (1,020 words) - 07:22, 9 June 2023
  • Shootout/SumFile
    ...=sumcol&lang=clean&id=0], and anything Clean can do Haskell should be able to do as well! ...and then impose a limit on line length? What's the purpose of that if not to allow the use of C's getline() primitive (in both senses of the word)? And
    20 KB (3,239 words) - 02:07, 26 April 2021
  • A practical Template Haskell Tutorial
    ...the different Template Haskell features on simple toy programs. The aim is to give an overview of Template Haskell's functionality in an example-driven m ...de> instances for JSON serialization; and in the <code>lens</code> library to mechanically create a data type's lenses.
    45 KB (6,927 words) - 18:50, 16 November 2020
  • Haskell in education
    This is a collection of material of interest to those teaching or ...eb/20040825074939/www.cs.kun.nl/fple/ http://www.cs.kun.nl/fple/], devoted to all functional languages. The proceedings of the latest
    40 KB (6,259 words) - 05:49, 6 June 2020
  • Learn Haskell in 10 minutes
    ...but you don't have to declare them), lazy (nothing is done until it needs to be) language. Its closest popular relative is probably the ML family of la .../GHCi | ghci]]</tt>. The first compiles Haskell libraries or applications to binary code. The second is an interpreter that lets you write Haskell code
    13 KB (1,986 words) - 17:59, 9 August 2019
  • HaskellImplementorsWorkshop/2014
    generally for people involved in implementing Haskell technology, to the platform, proposals for new features to be implemented, and
    22 KB (3,305 words) - 01:20, 30 September 2014
  • Top level mutable state
    [[Category:Pages to be removed]] the meaning of the program is likely to change if any occurrence of myGlobalVar is replaced with the rhs of the
    29 KB (4,624 words) - 05:37, 1 January 2022
  • Ministg
    ...rder languages] by Simon Marlow and Simon Peyton Jones (hereafter referred to as the "fast curry" paper). Please consult the paper for a detailed descrip ...preter follows the rules properly, and it also makes is easy to understand how new rules can be added, and what effect they might have.
    15 KB (2,396 words) - 07:19, 10 August 2022
  • Haskell user locations
    ...keeps track of the members of the #haskell IRC channel community. It is up to date with # To find your latitude and longitude, the following are helpful:
    11 KB (1,031 words) - 06:16, 8 June 2023
  • Xmonad/Config archive
    ==Quick Introductions to Haskell== ...itespace]. For more in-depth treatments of Haskell syntax and learning how to program in Haskell, see the sidebar <code>Learning</code> links on [http://
    29 KB (4,125 words) - 12:46, 15 January 2021
  • Euler problems/41 to 50
    How many triangle words can you make using the list of common English words? ...nondeterminism + state to create a backtracking monad particularly suited to this problem:
    12 KB (1,626 words) - 05:45, 9 March 2021
  • Applications and libraries/GUI libraries
    ...Toolkit for Haskell and the X Windows system. Fudgets also makes it easy to create client-server applications that communicate via the Internet. It ru ...les'' or ''relations''. Keera Hails is back-end agnostic and not exclusive to GUIs; it has backends for Gtk+ but also hardware (wiimotes), files, sockets
    16 KB (2,346 words) - 05:33, 8 June 2023
  • Arrays
    makes it possible to use Arrays in pure functional code along with lists. (undefined) values. You can learn how to use these arrays at
    27 KB (4,333 words) - 06:09, 23 July 2020
  • Haskellへのヒッチハイカーガイド
    decide how to fit them on CD-Rs ''The execution of a Haskell program is an evaluation of the symbol "main" to
    73 KB (10,050 words) - 00:05, 19 April 2021
  • Hitchhikers guide to Haskell
    speedup" (think about how TCP/IP session starts up). They start slow begin skipping paragraphs, then chapters, then whole pages, only to
    69 KB (11,026 words) - 12:26, 9 January 2023
  • IO inside
    ...ew Haskellers - if that's you, a good place to start is the [[Introduction to IO]] which can help you learn the basics (e.g. the syntax of I/O expression ...t in a total mess. This is because Haskell I/O is really very different in how it actually works.
    82 KB (13,140 words) - 09:07, 3 May 2024
  • Template Haskell
    ...l.org/package/template-haskell Template Haskell]''' is a [[GHC]] extension to Haskell that adds compile-time metaprogramming facilities. The original de This page hopes to be a more central and organized repository of TH related things.
    30 KB (4,551 words) - 00:29, 15 June 2023
  • Books
    In addition to this wiki page, many English books related to Haskell are listed in a can be used to receive notifications when new books are added to the index.
    53 KB (7,703 words) - 13:28, 28 March 2024
  • New monads/MonadAdvSTM
    ...hanges in the runtime. The ''Helper Thread'' code is a very close attempt to simulate the correct semantics. The ''Single Thread'' code is flawed since To: "Tim Harris (RESEARCH)" <tharris@microsoft.com>,
    24 KB (3,463 words) - 05:20, 12 July 2021
  • Prime numbers miscellaneous
    For the context to this, please see [[Prime numbers#Implicit_Heap | Prime numbers]]. ...structures via lazyness] for more about how merging ordered lists amounts to creating an implicit heap and [http://thread.gmane.org/gmane.comp.lang.hask
    18 KB (2,583 words) - 20:08, 19 December 2020
  • Research papers/Testing and correctness
    ....liu.se/pub/labs/pelab/papers/licthesis-henni.ps.gz A declarative approach to debugging for lazy functional languages.] ;[http://cs-www.cs.yale.edu/homes/nilsson/Publications/jfp2001.pdf How to look busy while being as lazy as ever: the implementation of a lazy functio
    11 KB (1,480 words) - 16:36, 1 August 2021
  • The I/O problem
    <!-- Note: only add supporting content dated up to 2017 (i.e. before the online existence of this content, both here and elsew show where computing is not mathematics and help to illuminate both fields.
    61 KB (9,234 words) - 04:14, 5 April 2024
  • Modular Monadic Compilers for Programming Languages
    How to build a modular monadic extensible compiler How to build a modular monadic extensible compiler
    20 KB (2,558 words) - 22:39, 29 June 2021
  • Xmonad/Frequently asked questions
    ...ed at the same time) to bring up an xterm. Once the xterm appears, use it to read xmonad's man page or point a web browser at http://xmonad.org/tour.htm * [http://loupgaroublond.blogspot.com/2007/12/how-to-install-your-very-own-xmonad.html Fedora]
    71 KB (10,765 words) - 16:38, 22 August 2021
  • Arch Linux/Applications
    ...579 drift 2.2.3-1] 2 Program to derive type class instances ...Takes haskell source on stdin, parses it, then\nprettyprints it to stdout.
    27 KB (2,482 words) - 19:02, 6 May 2020
  • IDEs
    ...e are many choices. When choosing your IDE, there are the following things to consider. == Notable features of interest to consider ==
    19 KB (2,866 words) - 10:23, 29 March 2022
  • QuotesPage
    > I am preparing a three-minute talk to tell incoming graduate students Oh like that's going to work. You'd be better off selling T-shirts that
    55 KB (8,884 words) - 01:18, 10 November 2022
  • Haskell Tutorial for C Programmers
    ...students overcome the difficulty of moving from C/C++, Java, and the like to Haskell. I write this assuming that you have checked out the Gentle Introduction to Haskell, but still don't understand what's going on.
    111 KB (19,450 words) - 17:55, 23 October 2019
  • HXT/Conversion of Haskell data from/to XML
    == Serializing and deserializing Haskell data to/from XML == and straightforward to convert native Haskell values to XML and vice
    28 KB (3,540 words) - 18:19, 5 January 2015
  • Applications and libraries/Mathematics
    ...ckage developed at MIT to model electromagnetic systems. Meep used Haskell to generate C++ code, after Meep [http://ab-initio.mit.edu/wiki/index.php/Meep ...and the ST Monad. bed-and-breakfast does not need any additional software to be installed and can perform basic matrix operations like multiplication, f
    21 KB (2,880 words) - 09:43, 4 May 2024
  • GHC/Using the FFI
    ...ed when building a standalone library (in this case a Windows DLL) that is to be called from Haskell. The examples are also relevant for the simpler case where you just want to statically link against C that is compiled with GCC. However, there are ot
    29 KB (4,766 words) - 05:52, 1 June 2022
  • Ru/IO Inside
    # Is it possible to duplicate calls? In Haskell semantics - yes, but real compilers never dupli
    64 KB (6,046 words) - 11:23, 22 October 2022
  • All About Monads
    ...a category to itself), together with two natural transformations required to fulfill certain coherence conditions." (Wikipedia) Admit it: unless you're If you're anxious about where to start with Haskell monads, you're not alone. Nor are you completely lacking
    169 KB (26,630 words) - 00:15, 19 September 2021
  • Haskell in industry
    ...diverse range of use commercially, from aerospace and defense, to finance, to web startups, hardware design firms and a lawnmower manufacturer. This page ...72 would-be commercial Haskell users: what Haskell success stories we need to see] has several stories of commercial Haskell users.
    49 KB (6,836 words) - 08:57, 19 October 2020
  • Haskell logos/New logo ideas
    So, time to find a new logo. Something reflecting the modern emphasis of Congratulations to Darrin Thompson (idea) and Jeff Wheeler (graphical interpretation) for crea
    34 KB (5,126 words) - 19:19, 15 August 2019
  • Typeclassopedia
    ...sue 13] of [http://themonadreader.wordpress.com/ the Monad.Reader]. Ported to the Haskell wiki in November 2011 by [[User:Geheimdienst|Geheimdienst]].'' ...ocument is to serve as a starting point for the student of Haskell wishing to gain a firm grasp of its standard type classes. The essentials of each type
    179 KB (29,519 words) - 16:10, 30 December 2022
  • Numeric Haskell: A Repa Tutorial
    ''Note: a companion tutorial to this is provided as the [http://www.haskell.org/haskellwiki/Numeric_Haskell ...ersion), [http://ics.p.lodz.pl/~stolarek Jan Stolarek] (update from Repa 2 to Repa 3).''
    37 KB (5,672 words) - 07:28, 10 August 2022
  • Research papers/Type systems
    ...www.iai.uni-bonn.de/~jv/paper.pdf Automatically Generating Counterexamples to Naive Free Theorems] ;[http://www.iai.uni-bonn.de/~jv/acta.pdf Refined Typing to Localize the Impact of Forced Strictness on Free Theorems]
    26 KB (3,569 words) - 10:04, 1 September 2022
  • News/2006
    ...r trees; documentation fixes dealing with the licence; added a few methods to EnumSet for wrapping and unwrapping the underlying Word</p></li> ...r (e.g. in the form of a deriving(Binary)). With this project Stefan wants to show that the existing infrastructure is sufficient, and has some advantage
    93 KB (13,836 words) - 23:40, 14 August 2019
  • Sudoku
    place (i,j) a -- and try to put it there ...alid Sudoku grid, since the only way to update the state handles the check to ensure that the move is legal.
    67 KB (9,593 words) - 05:40, 9 March 2021
  • Prime numbers
    ...test each new candidate number for divisibility by that prime, giving rise to a kind of ''trial division'' algorithm; or '''b.''' we can directly generat ...get an [[#Tree merging with Wheel|efficient ''list''-based code]] we have to be smart about combining those streams of multiples of each prime - which g
    58 KB (8,594 words) - 20:34, 6 May 2023
Retrieved from "https://wiki.haskell.org/Special:Search"