F Sharp
This programming language may be used to instruct a computer to perform a task.
Listed below are all of the tasks on Rosetta Code which have been solved using F Sharp.
This programming language may be used to instruct a computer to perform a task.
Lang tag(s): | fsharp |
---|---|
See Also: |
|
Your Help Needed
If you know F Sharp, please write code for some of the tasks not implemented in F Sharp.
If you know F Sharp, please write code for some of the tasks not implemented in F Sharp.
F# is a multi-paradigm (functional and object-oriented), strongly typed language created by Don Syme at Microsoft Research for Microsoft's .NET platform. It is based on the Caml language, and resembles it in syntax.
F# is included as an 'official' .NET language in Visual Studio 2010.
External Links[edit]
Subcategories
This category has the following 3 subcategories, out of 3 total.
Pages in category "F Sharp"
The following 808 pages are in this category, out of 808 total.
A
- A+B
- Abbreviations, automatic
- ABC problem
- Abelian sandpile model
- Abelian sandpile model/Identity
- Abstract type
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Ackermann function
- Active Directory/Connect
- Active object
- Additive primes
- ADFGVX cipher
- Algebraic data types
- Align columns
- Almkvist-Giullera formula for pi
- Almost prime
- Alternade words
- Amb
- Amicable pairs
- Anadromes
- Anagrams
- Anagrams/Deranged anagrams
- Angle difference between two bearings
- Animate a pendulum
- Animation
- Anonymous recursion
- Anti-primes
- Append numbers at same position in strings
- Apply a callback to an array
- Arbitrary-precision integers (included)
- Arithmetic evaluation
- Arithmetic-geometric mean
- Arithmetic/Complex
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- Ascending primes
- Aspect oriented programming
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Associative array/Merging
- Atomic updates
- Attractive numbers
- Average loop length
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
B
- Babbage problem
- Balanced brackets
- Barnsley fern
- Base 16 numbers needing a to f
- Base64 decode data
- Base64 encode data
- Bell numbers
- Benford's law
- Bernoulli numbers
- Bilinear interpolation
- Binary digits
- Binary search
- Bitmap
- Bitmap/Bresenham's line algorithm
- Bitmap/Bézier curves/Cubic
- Bitwise operations
- Boolean values
- Box the compass
- Brace expansion using ranges
- Brazilian numbers
- Break OO privacy
- Bulls and cows
C
- Caesar cipher
- Calculating the value of e
- Calendar
- Calkin-Wilf sequence
- Call a function
- Carmichael 3 strong pseudoprimes
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Change e letters to i in words
- Changeable words
- Chaocipher
- Chaos game
- Character codes
- Check that file exists
- Chernick's Carmichael numbers
- Cheryl's birthday
- Chinese remainder theorem
- Chinese zodiac
- Cholesky decomposition
- Church numerals
- Cipolla's algorithm
- Circles of given radius through two points
- Circular primes
- Cistercian numerals
- Classes
- Closest-pair problem
- Closures/Value capture
- Collect and sort square numbers in ascending order from three lists
- Color of a screen pixel
- Combinations
- Comma quibbling
- Command-line arguments
- Comments
- Common list elements
- Common sorted list
- Compare a list of strings
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Compound data type
- Concurrent computing
- Conditional structures
- Conjugate a Latin verb
- Conjugate transpose
- Consecutive primes with ascending or descending differences
- Constrained genericity
- Constrained random points on a circle
- Continued fraction
- Continued fraction/Arithmetic/Construct from rational number
- Convert seconds to compound duration
- Convex hull
- Conway's Game of Life
- Coprime triplets
- Coprimes
- Copy a string
- Copy stdin to stdout
- Count how many vowels and consonants occur in a string
- Count in factors
- Count in octal
- Count occurrences of a substring
- Count the coins
- Cousin primes
- CRC-32
- Create a file
- Create a file on magnetic tape
- Create a two-dimensional array at runtime
- Create an HTML table
- CSV data manipulation
- CSV to HTML translation
- Cuban primes
- Cubic special primes
- Cullen and Woodall numbers
- Currency
- Currying
- CUSIP
- Cyclops numbers
D
- Damm algorithm
- Data Encryption Standard
- Date format
- Date manipulation
- Day of the week
- Day of the week of Christmas and New Year
- Days between dates
- Deal cards for FreeCell
- Deceptive numbers
- Delegates
- Delete a file
- Department numbers
- Descending primes
- Detect division by zero
- Determine if a string has all the same characters
- Determine if a string has all unique characters
- Determine if a string is collapsible
- Determine if a string is numeric
- Determine if a string is squeezable
- Determine if two triangles overlap
- Digital root
- Digital root/Multiplicative digital root
- Dijkstra's algorithm
- Dinesman's multiple-dwelling problem
- Dining philosophers
- Discordian date
- Display a linear combination
- Distinct power numbers
- Dominoes
- Dot product
- Doubly-linked list/Definition
- Doubly-linked list/Element definition
- Doubly-linked list/Traversal
- Dragon curve
- Draw a clock
- Draw a pixel
- Dutch national flag problem
E
- Earliest difference between prime gaps
- Echo server
- Egyptian division
- EKG sequence convergence
- Elementary cellular automaton
- Elementary cellular automaton/Random Number Generator
- Emirp primes
- Empty directory
- Empty program
- Empty string
- Enforced immutability
- Entropy
- Enumerations
- Environment variables
- Equal prime and composite sums
- Erdös-Selfridge categorization of primes
- Erdős-primes
- Esthetic numbers
- Ethiopian multiplication
- Euclid-Mullin sequence
- Euler method
- Euler's identity
- Euler's sum of powers conjecture
- Evaluate binomial coefficients
- Even or odd
- Events
- Evolutionary algorithm
- Exactly three adjacent 3 in lists
- Execute a Markov algorithm
- Execute a system command
- Execute Brain****
- Execute SNUSP
- Exponentiation operator
- Exponentiation with infix operators in (or operating on) the base
- Extend your language
- Extensible prime generator
- Extra primes
- Extreme floating point values
F
- Factorial
- Factorial base numbers indexing permutations of a collection
- Factorions
- Factors of an integer
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fibonacci n-step number sequences
- Fibonacci sequence
- Fibonacci word
- Fibonacci word/fractal
- File input/output
- File modification time
- File size
- Filter
- Find adjacent primes which differ by a square integer
- Find common directory path
- Find first missing positive
- Find largest left truncatable prime in a given base
- Find limit of recursion
- Find minimum number of coins that make a given value
- Find palindromic numbers in both binary and ternary bases
- Find prime n such that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find square difference
- Find squares n where n+1 is prime
- Find the intersection of a line with a plane
- Find the intersection of two lines
- Find the last Sunday of each month
- Find words which contain the most consonants
- Find words which contains all the vowels
- Find words which contains more than 3 e vowels
- Find words whose first and last three letters are equal
- Find words with alternating vowels and consonants
- First 9 prime Fibonacci number
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- First-class functions
- First-class functions/Use numbers analogously
- Five weekends
- Fivenum
- FizzBuzz
- Flatten a list
- Floyd's triangle
- Floyd-Warshall algorithm
- Forest fire
- Formatted numeric output
- Forward difference
- Four bit adder
- Four is magic
- Four sides of square
- Fractal tree
- French Republican calendar
- Function composition
- Function definition
- Function prototype
- Fusc sequence
G
- Gamma function
- Gaussian elimination
- Generate lower case ASCII alphabet
- Generate random numbers without repeating a value
- Generator/Exponential
- Generic swap
- Geohash
- Get system command output
- Globally replace text in several files
- Gray code
- Greatest common divisor
- Greatest element of a list
- Greatest subsequential sum
- Guess the number/With feedback
- GUI component interaction
H
- Hailstone sequence
- Halt and catch fire
- Hamming numbers
- Handle a signal
- Happy numbers
- Harshad or Niven series
- Hash from two arrays
- Hash join
- Haversine formula
- Hello world/Graphical
- Hello world/Newline omission
- Hello world/Standard error
- Hello world/Text
- Here document
- Higher-order functions
- Hofstadter Figure-Figure sequences
- Hofstadter Q sequence
- Hofstadter-Conway $10,000 sequence
- Horizontal sundial calculations
- Horner's rule for polynomial evaluation
- Host introspection
- Hostname
- HTTP
- HTTPS
- Huffman coding
- Humble numbers
I
- I'm a software engineer, get me out of here
- IBAN
- Identity matrix
- Idiomatically determine all the characters that can be used for symbols
- Idiomatically determine all the lowercase and uppercase letters
- Image noise
- Increment a numerical string
- Infinity
- Inheritance/Multiple
- Inheritance/Single
- Input loop
- Integer comparison
- Integer roots
- Integer sequence
- Interactive programming (repl)
- Intersecting number wheels
- Inverted index
- ISBN13 check digit
- Isqrt (integer square root) of X
- Iterators
J
K
L
- Langton's ant
- Largest difference between adjacent primes
- Largest five adjacent number
- Largest int from concatenated ints
- Largest palindrome product
- Largest prime factor
- Largest product in a grid
- Largest proper divisor of n
- Latin Squares in reduced form
- Latin Squares in reduced form/Randomizing using Jacobson and Matthews’ Technique
- Leap year
- Least common multiple
- Left factorials
- Leonardo numbers
- Letter frequency
- Levenshtein distance
- Linear congruential generator
- List comprehensions
- Literals/Integer
- Literals/String
- Logical operations
- Long multiplication
- Long primes
- Longest common subsequence
- Longest palindromic substrings
- Look-and-say sequence
- Loop over multiple arrays simultaneously
- Loops/Break
- Loops/Continue
- Loops/Do-while
- Loops/Downward for
- Loops/For
- Loops/For with a specified step
- Loops/Foreach
- Loops/Increment loop index within loop body
- Loops/Infinite
- Loops/N plus one half
- Loops/Nested
- Loops/While
- Loops/With multiple ranges
- Lucas-Lehmer test
- Lucky and even lucky numbers
- Luhn test of credit card numbers
M
- Magnanimous numbers
- Make directory path
- Man or boy test
- Mandelbrot set
- Map range
- Markov chain text generator
- Matrix multiplication
- Matrix transposition
- Matrix with two diagonals
- Maximum difference between adjacent elements of list
- Mayan numerals
- Maze generation
- McNuggets problem
- MD5
- MD5/Implementation
- Menu
- Merge and aggregate datasets
- Mersenne primes
- Mertens function
- Metallic ratios
- Metronome
- Mian-Chowla sequence
- Miller–Rabin primality test
- Mind boggling card trick
- Minimum multiple of m where digital sum equals m
- Minimum number of cells after, before, above and below NxN squares
- Minimum numbers of three lists
- Minimum positive multiple in base 10 using only 0 and 1
- Minimum primes
- Modular exponentiation
- Modular inverse
- Modulinos
- Monads/List monad
- Monads/Maybe monad
- Monte Carlo methods
- Monty Hall problem
- Morse code
- Mosaic matrix
- Motzkin numbers
- Mouse position
- Move-to-front algorithm
- Multi-base primes
- Multifactorial
- Multiline shebang
- Multiple distinct objects
- Multiplication tables
- Multisplit
- Munchausen numbers
- Mutual recursion
- Möbius function
N
- N'th
- N-queens minimum and knights and bishops
- N-queens problem
- Narcissistic decimal number
- Negative base numbers
- Neighbour primes
- Next special primes
- Nice primes
- Non-continuous subsequences
- Non-decimal radices/Input
- Non-decimal radices/Output
- Non-transitive dice
- Nonogram solver
- Nth root
- Null object
- Number names
- Number reversal game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers which binary and ternary digit sum are prime
- Numbers whose count of divisors is prime
- Numbers with equal rises and falls
- Numbers with prime digits whose sum is 13
- Numbers with same digit set in base 10 and base 16
- Numeric error propagation
- Numerical integration
O
P
- Padovan n-step number sequences
- Palindrome dates
- Palindrome detection
- Palindromic gapful numbers
- Palindromic primes in base 16
- Pancake numbers
- Pangram checker
- Parallel brute force
- Parallel calculations
- Parameterized SQL statement
- Parametric polymorphism
- Parse an IP Address
- Parsing/RPN calculator algorithm
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Partial function application
- Partition an integer x into n primes
- Partition function P
- Pascal's triangle
- Pascal's triangle/Puzzle
- Password generator
- Percentage difference between images
- Perfect numbers
- Perfect shuffle
- Permutations
- Permutations by swapping
- Permutations/Derangements
- Permuted multiples
- Pernicious numbers
- Pi
- Pick random element
- Pierpont primes
- Piprimes
- Plot coordinate pairs
- Poker hand analyser
- Polymorphic copy
- Polymorphism
- Polynomial long division
- Population count
- Positive decimal integers with the digit 1 occurring exactly twice
- Power set
- Price fraction
- Primality by trial division
- Primality by Wilson's theorem
- Prime conspiracy
- Prime decomposition
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Prime triangle
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Primorial numbers
- Priority queue
- Problem of Apollonius
- Program name
- Program termination
- Proper divisors
- Pseudo-random numbers/Middle-square method
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Splitmix64
- Pseudo-random numbers/Xorshift star
- Pythagoras tree
- Pythagorean triples
R
- Ramanujan primes
- Ramanujan primes/twins
- Random Latin squares
- Random numbers
- Range expansion
- Range extraction
- Rare numbers
- Read a file line by line
- Read a specific line from a file
- Read entire file
- Real constants and functions
- Red black tree sort
- Regular expressions
- Remove duplicate elements
- Remove lines from a file
- Remove vowels from a string
- Rename a file
- Rendezvous
- Rep-string
- Repeat
- Repeat a string
- Repunit primes
- Retrieve and search chat history
- Return multiple values
- Reverse a string
- Reverse words in a string
- Rock-paper-scissors
- Roman numerals/Decode
- Roman numerals/Encode
- Rosetta Code/Count examples
- Rosetta Code/Fix code tags
- Rosetta Code/Rank languages by popularity
- Rot-13
- RSA code
- Run-length encoding
- Runge-Kutta method
S
- S-expressions
- Safe primes and unsafe primes
- Sattolo cycle
- Search a list
- SEDOLs
- Self numbers
- Semiprime
- Semordnilap
- Separate the house number from the street name
- Sequence of non-squares
- Sequence of primes by trial division
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Set
- Set consolidation
- Set of real numbers
- Set puzzle
- Set right-adjacent bits
- Sexy primes
- SHA-1
- SHA-256
- Shell one-liner
- Shift list elements to left by 3
- Shoelace formula for polygonal area
- Short-circuit evaluation
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Show the epoch
- Sierpinski carpet
- Sierpinski triangle
- Sieve of Eratosthenes
- Simple windowed application
- Singly-linked list/Element removal
- Sleep
- Sleeping Beauty problem
- Smallest multiple
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Smarandache prime-digital sequence
- Smith numbers
- SOAP
- Sort an array of composite structures
- Sort an integer array
- Sort disjoint sublist
- Sort primes from list to a list
- Sort stability
- Sort the letters of string in alphabetical order
- Sort three variables
- Sort using a custom comparator
- Sorting algorithms/Bead sort
- Sorting algorithms/Bubble sort
- Sorting algorithms/Gnome sort
- Sorting algorithms/Heapsort
- Sorting algorithms/Insertion sort
- Sorting algorithms/Merge sort
- Sorting algorithms/Pancake sort
- Sorting algorithms/Quicksort
- Sorting algorithms/Selection sort
- Sorting algorithms/Sleep sort
- Soundex
- Sparkline in unicode
- Special neighbor primes
- Special pythagorean triplet
- Spiral matrix
- Split a character string based on change of character
- Square but not cube
- Square root by hand
- Stable marriage problem
- Stack
- Stack traces
- Steady squares
- Stem-and-leaf plot
- Stern-Brocot sequence
- Straddling checkerboard
- Strange numbers
- Strange plus numbers
- Strange unique prime triplets
- String append
- String case
- String comparison
- String concatenation
- String interpolation (included)
- String length
- String matching
- String prepend
- Strip a set of characters from a string
- Strip block comments
- Strip comments from a string
- Strip control codes and extended characters from a string
- Strip whitespace from a string/Top and tail
- Substring
- Substring/Top and tail
- Subtractive generator
- Successive prime differences
- Sudoku
- Sum and product of an array
- Sum digits of an integer
- Sum multiples of 3 and 5
- Sum of a series
- Sum of divisors
- Sum of elements below main diagonal of matrix
- Sum of first n cubes
- Sum of primes in odd positions is prime
- Sum of square and cube digits of an integer are primes
- Sum of squares
- Sum of the digits of n is substring of n
- Sum of two adjacent numbers are primes
- Sum to 100
- Summarize and say sequence
- Summarize primes
- Summation of primes
- Super-d numbers
- Sylvester's sequence
- Symmetric difference
- Synchronous concurrency
- System time
T
- Take notes on the command line
- Tau function
- Tau number
- Teacup rim text
- Temperature conversion
- Terminal control/Clear the screen
- Terminal control/Coloured text
- Terminal control/Cursor positioning
- Terminal control/Dimensions
- Terminal control/Ringing the terminal bell
- Test a function
- Text processing/2
- The Name Game
- The sieve of Sundaram
- The Twelve Days of Christmas
- Tic-tac-toe
- Time a function
- Tokenize a string
- Tokenize a string with escaping
- Top rank per group
- Towers of Hanoi
- Trabb Pardo–Knuth algorithm
- Tree traversal
- Trigonometric functions
- Triplet of three numbers
- Truncate a file
- Twin primes
- Two identical strings
- Two sum
- Type detection
U
V
W
- Walk a directory/Non-recursively
- Walk a directory/Recursively
- Water collected between towers
- Web scraping
- Weird numbers
- Wieferich primes
- Wilson primes of order n
- Window creation
- Word frequency
- Word ladder
- Word wheel
- Word wrap
- Words from neighbour ones
- Write entire file
- Write float arrays to a text file
- Write language name in 3D ASCII
- Write to Windows event log