Search results

Jump to navigation Jump to search

Page title matches

  • #redirect [[How to profile a Haskell program]] [[Category: Pages to be removed]]
    81 bytes (12 words) - 06:37, 8 June 2023
  • [[Category:How to]] == How do I…? ==
    6 KB (1,106 words) - 12:32, 15 November 2019
  • 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
  • #redirect [[Cabal/How to install a Cabal package]] [[Category: Pages to be removed]]
    85 bytes (13 words) - 06:36, 8 June 2023
  • 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
  • ...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
  • #REDIRECT [[How to unpack a tar file in Windows]] [[Category: Pages to be removed]]
    84 bytes (14 words) - 06:37, 8 June 2023
  • ...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
  • #redirect [[Euler problems/101 to 110]] [[Category: Pages to be removed]]
    74 bytes (9 words) - 06:36, 8 June 2023
  • ...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
  • [[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

  • ==. 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
  • 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
  • #redirect [[How to profile a Haskell program]] [[Category: Pages to be removed]]
    81 bytes (12 words) - 11:51, 8 June 2023
  • #redirect [[How to profile a Haskell program]] [[Category: Pages to be removed]]
    81 bytes (12 words) - 06:37, 8 June 2023
  • ...//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
  • #REDIRECT [[How to unpack a tar file in Windows]] [[Category: Pages to be removed]]
    84 bytes (14 words) - 06:37, 8 June 2023
  • ...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
  • [[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
  • 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
  • #redirect [[Cabal/How to install a Cabal package]] [[Category: Pages to be removed]]
    85 bytes (13 words) - 06:36, 8 June 2023
  • = 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
  • : 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
  • ...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
  • ...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
  • ...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
  • 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
  • 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
  • ...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
  • ==How to keep an imperative programmer busy for hours ==
    167 bytes (29 words) - 15:19, 6 February 2021
  • ...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
  • 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
  • #* [[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
  • ...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
  • [[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
  • ...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
  • ...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
  • === 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
  • 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
  • ...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
  • ...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
  • ...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
  • :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
  • [[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
  • ...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
  • ...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
  • ...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
  • I want to define So to speak, the second type argument of <hask>Const</hask>
    1 KB (192 words) - 23:01, 5 April 2021
  • ...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
  • ...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
  • ...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
  • 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
  • ...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
  • ...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
  • 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
  • ...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
  • ...place to record user-oriented observations, notes, and suggestions on how to use them.
    1 KB (158 words) - 20:32, 23 July 2021
  • ...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
  • [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
  • 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
  • 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
  • [[Category:How to]] == How do I&hellip;? ==
    6 KB (1,106 words) - 12:32, 15 November 2019
  • 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
  • ...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
  • ...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
  • ...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
  • ...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
  • <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
  • ...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
  • ...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
  • 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
  • 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
  • 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
  • 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
  • ...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
  • ...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
  • ...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
  • {- 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
  • 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
  • ...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
  • ...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
  • 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
  • ...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
  • ...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
  • [[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
  • * さらにこちらも参照してみてください。 [[Avoiding IO|how to avoid IO]] Languages: [[Introduction to IO|en]]
    7 KB (299 words) - 11:39, 22 October 2022
  • 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/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
  • > 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
  • ...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
  • 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
  • ...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
  • ...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
  • ...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
  • ''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
  • ...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
  • 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
  • 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
  • ...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
  • ...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
  • 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
  • <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
  • *[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
  • 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
  • ...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
  • ...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 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
  • ...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
  • ''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
  • ...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
  • ...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

View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)