# Reports:Tasks not implemented in Haskell

**Awareness**

If

**Haskell**is a language you like, or are interested in, please inform your fellow members of the Haskell community; this page can't be emptied without your and their participation.

## Contents

## Not implemented[edit]

These are currently not implemented in Haskell. Please implement some if you can. If any tasks are not possible or too complex in Haskell, they should not be on this list. To mark a task as such, add **{{omit from|Haskell}}**, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.

### B

### C

- Call an object method
- Canny edge detector
- Chowla numbers
- Color of a screen pixel
- Colour pinstripe/Display
- Colour pinstripe/Printer
- Commatizing numbers
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Cuban primes

### F

### I

### L

### M

### P

- Parallel Brute Force
- Pathological floating point problems
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Percolation/Mean cluster density
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Poker hand analyser
- Polymorphic copy
- Pragmatic directives
- Prime conspiracy
- Primes - allocate descendants to their ancestors

### R

### S

- SOAP
- SQL-based authentication
- Safe addition
- Safe primes and unsafe primes
- Send an unknown method call
- Sequence: nth number with exactly n divisors
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Sexy primes
- Shortest common supersequence
- Simulate input/Keyboard
- Simulate input/Mouse
- Smarandache prime-digital sequence
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Sort numbers lexicographically
- Spelling of ordinal numbers
- Stack traces
- Strong and weak primes
- Successive prime differences
- Suffixation of decimal numbers
- Sunflower fractal
- Superpermutation minimisation

### T

### Draft tasks without implementation[edit]

These tasks as drafts, meaning they largely need more work to turn them into full tasks. Perhaps you can help by trying to implement them in Haskell (after all, one of the key requirements for a task being non-draft is multiple implementations, preferably in widely different languages) but be aware that this may be difficult because of lack of definition of the task itself.

### 2

### A

- A* search algorithm
- ASCII art diagram converter
- Addition-chain exponentiation
- Addition chains
- Angles (geometric), normalization and conversion
- Arithmetic coding/As a generalized change of radix
- Aspect Oriented Programming
- Assertions in design by contract
- AudioAlarm
- Audio Overlap Loop
- Audio frequency generator

### B

### C

- Card shuffles
- Chebyshev coefficients
- Checksumcolor
- Chemical Calculator
- Chernick's Carmichael numbers
- Chess player
- Chess player/Move generation
- Chess player/Program options and user interface
- Chess player/Search and evaluation
- Cipolla's algorithm
- Code segment unload
- Color wheel
- Combinations with repetitions/Square Digit Chain
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)
- Copy stdin to stdout
- Create an object/Native demonstration
- Curve that touches three points

### D

### F

### G

### H

### I

### M

### P

### R

- Railway circuit
- Ramanujan's constant
- Ramsey's theorem
- Random Latin Squares
- Raster bars
- Read a file character by character/UTF8
- Readline interface
- Recursive descent parser generator
- Reflection/List methods
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Resistance Calculator
- Resistance Network Calculator
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Run examples
- Rosetta Code/Tasks sorted by average lines of code
- Rosetta Code/Tasks without examples
- Run as a daemon or service

### S

- Safe mode
- Selective File Copy
- Self-hosting compiler
- Separate the house number from the street name
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Snake And Ladder
- Solve a Rubik's Cube
- Solving coin problems
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Spoof game
- Starting a web browser
- Substitution Cipher
- Suffix tree
- Sum data type

### T

### U

## Requiring Attention[edit]

### Examples[edit]

These tasks have implementations in Haskell, but somebody, somewhere, decided that the example implementation was faulty or in some other way requiring attention. If you're familiar with the task and language, please consider reviewing/correcting the example and removing the notice.

### Other pages[edit]

These are other pages related to Haskell which require attention; with your knowledge and assistance, we can improve the quality of the site's content.

### No pages found.

## Not Considered[edit]

These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that Haskell was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.

## End of List[edit]

Again, feel free to try your hand at any of the tasks listed on this page.