Category:F Sharp: Difference between revisions
Content added Content deleted
m (hopl id=3716 -- Search for 'F Sharp' finds nothing. Also: spaces work as well as underscores in links.) |
(F# has static type checking with type inference.) |
||
| Line 3: | Line 3: | ||
|tags=fsharp |
|tags=fsharp |
||
|hopl id=3716 |
|hopl id=3716 |
||
|checking=static |
|||
}}[[runs on vm::common language runtime| ]] |
}}[[runs on vm::common language runtime| ]] |
||
'''F#''' is a multi-paradigm ([[functional programming|functional]] and [[object-oriented programming|object-oriented]]), strongly typed language created by Don Syme at Microsoft Research for Microsoft's [[.NET]] platform. |
'''F#''' is a multi-paradigm ([[functional programming|functional]] and [[object-oriented programming|object-oriented]]), strongly typed language created by Don Syme at Microsoft Research for Microsoft's [[.NET]] platform. |
||
Revision as of 18:38, 20 October 2022
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.
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 864 total.
(previous page) (next page)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
- AKS test for primes
- Algebraic data types
- Align columns
- Almkvist-Giullera formula for pi
- Almost prime
- Alternade words
- Amb
- Amicable pairs
- Anadromes
- Anagrams
- Anagrams/Deranged anagrams
- Anaprimes
- 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
- Apéry's constant
- 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
- Boustrophedon transform
- 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
- Centre and radius of a circle passing through 3 points in a plane
- 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
- Consistent overhead byte stuffing
- 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
- Curve that touches three points
- 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