Category:F Sharp
This programming language may be used to instruct a computer to perform a task.
| Type checking: | Static |
|---|---|
| Lang tag(s): | fsharp |
| See Also: |
|
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 and later.
External Links
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- F Sharp examples needing attention (empty)
- F Sharp Implementations (empty)
- F Sharp User (19 P)
Pages in category "F Sharp"
The following 200 pages are in this category, out of 874 total.
(previous page) (next page)L
- Lah numbers
- 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
- Legendre prime counting function
- 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
- Magic numbers
- 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
- Maximum triangle path sum
- 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
- Minkowski question-mark function
- Modular exponentiation
- Modular inverse
- Modulinos
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer 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-grams
- N-queens minimum and knights and bishops
- N-queens problem
- N-smooth numbers
- Named parameters
- 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 whose binary and ternary digit sums 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
- Penta-power prime seeds
- 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 derivative
- 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