ML language family
E554871
The ML language family is a group of statically typed functional programming languages, including Standard ML, OCaml, and F#, known for strong type systems, type inference, and support for higher-order functions.
All labels observed (1)
| Label | Occurrences |
|---|---|
| ML language family canonical | 1 |
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
functional programming language family
ⓘ
programming language family ⓘ |
| designedFor | theorem proving ⓘ |
| feature |
algebraic data types
ⓘ
first-class functions ⓘ garbage collection ⓘ higher-order functions ⓘ modules and functors ⓘ parametric polymorphism ⓘ pattern matching ⓘ strong static type system ⓘ type inference ⓘ type safety ⓘ |
| hasMember |
Alice ML
NERFINISHED
ⓘ
Caml NERFINISHED ⓘ Camlp4 NERFINISHED ⓘ Elm (early versions, ML-inspired) NERFINISHED ⓘ F# NERFINISHED ⓘ MLton NERFINISHED ⓘ MetaOCaml NERFINISHED ⓘ OCaml NERFINISHED ⓘ SML/NJ NERFINISHED ⓘ Standard ML NERFINISHED ⓘ |
| influenced |
Elm
NERFINISHED
ⓘ
Haskell NERFINISHED ⓘ OCaml-based languages like Reason and ReScript ⓘ ReasonML NERFINISHED ⓘ Rust type system design ⓘ Scala NERFINISHED ⓘ |
| influencedBy |
Lisp
NERFINISHED
ⓘ
lambda calculus ⓘ |
| notableProperty |
combination of functional and imperative features
ⓘ
expressive type system with inference ⓘ |
| originatedFrom | Meta Language (ML) NERFINISHED ⓘ |
| paradigm |
functional programming
ⓘ
imperative programming (secondary) ⓘ |
| supports |
abstract data types
ⓘ
exceptions ⓘ immutable data structures ⓘ modules for large-scale programming ⓘ side effects (controlled) ⓘ |
| typeDiscipline | static typing ⓘ |
| typicalEvaluationStrategy | call-by-value (eager evaluation) ⓘ |
| useCase |
compilers and language tools
ⓘ
formal verification ⓘ symbolic computation ⓘ teaching functional programming ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.