# 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.

### A

### B

### C

- Call an object method
- Canny edge detector
- Chernick's Carmichael numbers
- Cistercian numerals
- Color of a screen pixel
- Color wheel
- Colour pinstripe/Display
- Colour pinstripe/Printer
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Cyclotomic polynomial

### D

### F

### I

### L

### M

### N

### P

- P-value correction
- Partition function P
- Pathological floating point problems
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Percolation/Mean cluster density
- Perlin noise
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Polymorphic copy
- Pragmatic directives
- Primes - allocate descendants to their ancestors
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Xorshift star

### R

### S

- SHA-256 Merkle tree
- SOAP
- SQL-based authentication
- Safe addition
- Self numbers
- Send an unknown method call
- Shortest common supersequence
- Simulate input/Keyboard
- Simulate input/Mouse
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Sorting algorithms/Cocktail sort with shifting bounds
- Spelling of ordinal numbers
- Stack traces
- Suffixation of decimal numbers
- Sunflower fractal
- Superpermutation minimisation

### T

### U

### Draft tasks without implementation[edit]

These tasks are 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.

### A

### B

### C

- CLI-based maze-game
- Card shuffles
- Changeable words
- Chebyshev coefficients
- Checksumcolor
- Chemical calculator
- Chess player
- Cipolla's algorithm
- Code segment unload
- Combinations with repetitions/Square digit chain
- Compiler/Verifying syntax
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n)
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Count the coins/0-1
- Create an object/Native demonstration
- Curve that touches three points

### E

### F

### G

### I

### L

### M

### N

### P

- Pancake numbers
- Parse command-line arguments
- Particle swarm optimization
- Penrose tiling
- Pentomino tiling
- Perceptron
- Polynomial synthetic division
- Powerful numbers
- Price list behind API
- Prime words
- Print debugging statement
- Print itself
- Process SMIL directives in XML data
- Pseudo-random numbers/Splitmix64
- Pseudorandom number generator image

### R

- Railway circuit
- Ramsey's theorem
- Random Latin squares
- Range modifications
- Raster bars
- Readline interface
- Recursive descent parser generator
- 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 without examples
- Run as a daemon or service

### S

- Safe mode
- Selective file copy
- Self-hosting compiler
- Sierpinski arrowhead curve
- Sierpinski curve
- Sierpinski square curve
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Smallest enclosing circle problem
- Snake and Ladder
- Solve a Rubik's Cube
- Solve triangle solitare puzzle
- Solving coin problems
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Spoof game
- Square root by hand
- Starting a web browser
- Strassen's algorithm
- Suffix tree
- Sum data type

### T

- Table creation
- Tamagotchi emulator
- Tau function
- Tau number
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text completion
- Text to HTML
- Three word location
- Time-based one-time password algorithm
- Topological sort/Extracted top item
- Transportation problem
- Twin primes
- Two bullet roulette
- Type detection

### U

### W

## 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.