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)D
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
- Factorial primes
- Factorions
- Factors of an integer
- FASTA format
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fermat pseudoprimes
- 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
- Gaussian primes
- Generate lower case ASCII alphabet
- Generate random numbers without repeating a value
- Generator/Exponential
- Generic swap
- Geohash
- Get system command output
- Getting the number of decimal places
- Globally replace text in several files
- Golden ratio/Convergence
- Gray code
- Greatest common divisor
- Greatest element of a list
- Greatest subsequential sum
- Greedy algorithm for Egyptian fractions
- 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
- Hilbert curve
- Hofstadter Figure-Figure sequences
- Hofstadter Q sequence
- Hofstadter-Conway $10,000 sequence
- Honaker primes
- Horizontal sundial calculations
- Horner's rule for polynomial evaluation
- Host introspection
- Hostname
- HTTP
- HTTPS
- Huffman coding
- Humble numbers
I
- I before E except after C
- 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