# 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
- 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
- Consecutive primes with ascending or descending differences
- Cyclotomic polynomial

### D

### F

- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Fibonacci word/fractal
- Find Chess960 starting position identifier
- Find if a point is within a triangle
- Fixed length records
- Fortunate numbers
- Four is magic
- Four is the number of letters in the ...
- French Republican calendar
- Function frequency

### I

### L

### M

- Machine code
- Magnanimous numbers
- Main step of GOST 28147-89
- Mastermind
- Matrix digital rain
- Mayan calendar
- Median filter
- Memory layout of a data structure
- Merge and aggregate datasets
- Metallic ratios
- Minimal steps down to 1
- Minkowski question-mark function
- Modified random distribution
- Motzkin numbers
- Mouse position
- Multi-dimensional array
- Musical scale
- Möbius function

### N

### P

- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Pancake numbers
- Partition function P
- Pathological floating point problems
- Peaceful chess queen armies
- Peano curve
- 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/Splitmix64
- Pseudo-random numbers/Xorshift star

### R

- Ramanujan's constant
- Ramanujan primes/twins
- Ramer-Douglas-Peucker line simplification
- Random sentence from book
- Rare numbers
- Record sound
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Rendezvous
- Respond to an unknown method call
- Retrieve and search chat history
- Rosetta Code/Fix code tags
- Rosetta Code/Rank languages by number of users

### S

- SHA-256 Merkle tree
- SOAP
- SQL-based authentication
- Safe addition
- Send an unknown method call
- Sierpinski arrowhead curve
- Sierpinski square curve
- Simulate input/Keyboard
- Simulate input/Mouse
- Sleeping Beauty problem
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Sorting algorithms/Cocktail sort with shifting bounds
- Spelling of ordinal numbers
- Square form factorization
- Stack traces
- Strassen's algorithm
- Suffixation of decimal numbers
- Superpermutation minimisation

### T

### V

### W

### 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/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Concatenate two primes is also prime
- Conjugate a Latin verb
- 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
- Create your own text control codes
- Cubic Special Primes
- Curve that touches three points

### D

### F

### G

### I

### L

### M

### N

- N-body problem
- NYSIIS
- Native shebang
- Neighbour primes
- Next special primes
- Nice primes
- Number triplets game
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers whose count of divisors is prime
- Numbers with same digit set in base 10 and base 16
- Numeric separator syntax
- Numerical integration/Adaptive Simpson's method

### O

### P

- Palindromic primes in base 16
- Pandigital prime
- Parse command-line arguments
- Particle fountain
- Particle swarm optimization
- Penrose tiling
- Pentomino tiling
- Perceptron
- Peripheral drift illusion
- Permuted multiples
- Piprimes
- Polynomial synthetic division
- Positive decimal integers with the digit 1 occurring exactly twice
- Powerful numbers
- Practical numbers
- Price list behind API
- Prime numbers p which sum of prime numbers less or equal to p is prime
- Prime numbers which contain 123
- Prime triplets
- Prime words
- Primes whose first and last number is 3
- Primes with digits in nondecreasing order
- Print debugging statement
- Print itself
- Process SMIL directives in XML data
- Pseudorandom number generator image

### R

- Railway circuit
- Ramanujan primes
- Ramsey's theorem
- 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
- Reverse the order of lines in a text file while preserving the contents of each line
- Robots
- Rodrigues’ rotation formula
- Rosetta Code/List authors of task descriptions
- 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 curve
- Simple turtle graphics
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Smallest enclosing circle problem
- Smallest numbers
- 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
- Special Divisors
- Special factorials
- Special neighbor primes
- Special pythagorean triplet
- Spoof game
- Square root by hand
- Starting a web browser
- Strange unique prime triplets
- Substring primes
- Suffix tree
- Sum data type
- Sum of primes in odd positions is prime
- Sunflower fractal

### T

- Table creation
- Tamagotchi emulator
- 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
- Triplet of three numbers
- Tropical algebra overloading
- 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.