![]() The Elm tangram | |
Paradigm | functional |
---|---|
Family | Haskell |
Designed by | Evan Czaplicki |
First appeared | March 30, 2012 [1] |
Stable release | 0.19.1 / October 21, 2019 [2] |
Typing discipline | static, strong, inferred |
Platform | x86-64 |
OS | macOS, Windows |
License | Permissive (Revised BSD) [3] |
Filename extensions | .elm |
Website | elm-lang |
Influenced by | |
Haskell, Standard ML, OCaml, F# | |
Influenced | |
Redux, [4] Rust, [5] Vue, [6] Roc, [7] Derw, [8] Gren [9] |
Elm is a domain-specific programming language for declaratively creating web browser-based graphical user interfaces. Elm is purely functional, and is developed with emphasis on usability, performance, and robustness. It advertises "no runtime exceptions in practice", [10] made possible by the Elm compiler's static type checking.
Elm was initially designed by Evan Czaplicki as his thesis in 2012. [11] The first release of Elm came with many examples and an online editor that made it easy to try out in a web browser. [12] Mr. Czaplicki joined Prezi in 2013 to work on Elm, [13] and in 2016 moved to NoRedInk as an Open Source Engineer, also starting the Elm Software Foundation. [14]
The initial implementation of the Elm compiler targets HyperText Markup Language (HTML), Cascading Style Sheets (CSS), and JavaScript. [15] The set of core tools has continued to expand, now including a read–eval–print loop (REPL), [16] package manager, [17] time-travelling debugger, [18] and installers for macOS and Windows. [19] Elm also has an ecosystem of community created libraries, [20] and Ellie, an advanced online editor that allows saved work and including community libraries. [21]
Elm has a small set of language constructs, including traditional if-expressions, let-expressions for storing local values, and case-expressions for pattern matching. [22] As a functional language, it supports anonymous functions, functions as arguments, and functions can return functions, the latter often by partial application of curried functions. Functions are called by value. Its semantics include immutable values, stateless functions, and static typing with type inference. Elm programs render HTML through a virtual DOM, and may interoperate with other code by using "JavaScript as a service".
All values in Elm are immutable, meaning that a value cannot be modified after it is created. Elm uses persistent data structures to implement its arrays, sets, and dictionaries in the standard library. [23]
Elm is statically typed. Type annotations are optional (due to type inference) but strongly encouraged. Annotations exist on the line above the definition (unlike C-family languages where types and names are interspersed). Elm uses a single colon to mean "has type".
Types include primitives like integers and strings, and basic data structures such as lists, tuples, and records. Functions have types written with arrows, for example round : Float -> Int
. Custom types allow the programmer to create custom types to represent data in a way that matches the problem domain. [24]
Types can refer to other types, for example a List Int
. Types are always capitalized; lowercase names are type variables. For example, a List a
is a list of values of unknown type. It is the type of the empty list and of the argument to List.length
, which is agnostic to the list's elements. There are a few special types that programmers create to interact with the Elm runtime. For example, Html Msg
represents a (virtual) DOM tree whose event handlers all produce messages of type Msg
.
Rather than allow any value to be implicitly nullable (such as JavaScript's undefined
or a null pointer), Elm's standard library defines a Maybe a
type. Code that produces or handles an optional value does so explicitly using this type, and all other code is guaranteed a value of the claimed type is actually present.
Elm provides a limited number of built-in type classes: number
which includes Int
and Float
to facilitate the use of numeric operators such as (+)
or (*)
, comparable
which includes numbers, characters, strings, lists of comparable things, and tuples of comparable things to facilitate the use of comparison operators, and appendable
which includes strings and lists to facilitate concatenation with (++)
. Elm does not provide a mechanism to include custom types into these type classes or create new type classes (see Limits).
Elm has a module system that allows users to break their code into smaller parts called modules. Modules can hide implementation details such as helper functions, and group related code together. Modules serve as a namespace for imported code, such as Bitwise.and
. Third party libraries (or packages) consist of one or more modules, and are available from the Elm Public Library. All libraries are versioned according to semver, which is enforced by the compiler and other tools. That is, removing a function or changing its type can only be done in a major release.
Elm uses an abstraction called ports to communicate with JavaScript. [25] It allows values to flow in and out of Elm programs, making it possible to communicate between Elm and JavaScript.
Elm has a library called elm/html that a programmer can use to write HTML and CSS within Elm. [26] It uses a virtual DOM approach to make updates efficient. [27]
Elm does not officially support server-side development. The core development team does not consider it as their primary goal and prefers to focus development on the enhancement of front-end development experience. Nevertheless, there are several independent projects, which attempt to explore possibilities to use Elm for the back-end. The projects are mainly stuck on Elm version 0.18.0 since newer ones do not support "native" code and some other utilized features. There are two attempts to use Elm with BEAM (Erlang virtual machine). One of the projects executes Elm directly on the environment [28] while another one compiles it to Elixir. [29] Also, there was an attempt to create a back-end framework for Elm powered by Node.js infrastructure. [30] None of the projects are production-ready.
The Elm Architecture is a software design pattern for building interactive web applications. Elm applications are naturally constructed in that way, but other projects may find the concept useful.
An Elm program is always split into three parts:
Those are the core of the Elm Architecture.
For example, imagine an application that displays a number and a button that increments the number when pressed. [31] In this case, all we need to store is one number, so our model can be as simple as type alias Model = Int
. The view
function would be defined with the Html
library and display the number and button. For the number to be updated, we need to be able to send a message to the update
function, which is done through a custom type such as type Msg = Increase
. The Increase
value is attached to the button defined in the view
function such that when the button is clicked by a user, Increase
is passed on to the update
function, which can update the model by increasing the number.
In the Elm Architecture, sending messages to update
is the only way to change the state. In more sophisticated applications, messages may come from various sources: user interaction, initialization of the model, internal calls from update
, subscriptions to external events (window resize, system clock, JavaScript interop...) and URL changes and requests.
Elm does not support higher-kinded polymorphism, [32] which related languages Haskell and PureScript offer, nor does Elm support the creation of type classes.
This means that, for example, Elm does not have a generic map
function which works across multiple data structures such as List
and Set
. In Elm, such functions are typically invoked qualified by their module name, for example calling List.map
and Set.map
. In Haskell or PureScript, there would be only one function map
. This is a known feature request that is on Mr. Czaplicki's rough roadmap since at least 2015. [33]
Another outcome is a large amount of boilerplate code in medium to large size projects as illustrated by the author of "Elm in Action" in their single page application example [34] with almost identical fragments being repeated in update, view, subscriptions, route parsing and building functions.
-- This is a single line comment.{-This is a multi-line comment.It is {- nestable. -}-}-- Here we define a value named `greeting`. The type is inferred as a `String`.greeting="Hello World!"-- It is best to add type annotations to top-level declarations.hello:Stringhello="Hi there."-- Functions are declared the same way, with arguments following the function name.addxy=x+y-- Again, it is best to add type annotations.hypotenuse:Float->Float->Floathypotenuseab=sqrt(a^2+b^2)-- We can create lambda functions with the `\[arg] -> [expression]` syntax.hello:String->Stringhello=\s->"Hi, "++s-- Function declarations may have the anonymous parameter names denoted by `_`, -- which are matched but not used in the body. const:a->b->aconstk_=k-- Functions are also curried; here we've curried the multiplication -- infix operator with a `2`multiplyBy2:number->numbermultiplyBy2=(*)2-- If-expressions are used to branch on `Bool` valuesabsoluteValue:number->numberabsoluteValuenumber=ifnumber<0thennegatenumberelsenumber-- Records are used to hold values with named fieldsbook:{title:String,author:String,pages:Int}book={title="Steppenwolf",author="Hesse",pages=237}-- Record access is done with `.`title:Stringtitle=book.title-- Record access `.` can also be used as a functionauthor:Stringauthor=.authorbook-- We can create tagged unions with the `type` keyword.-- The following value represents a binary tree.typeTreea=Empty|Nodea(Treea)(Treea)-- It is possible to inspect these types with case-expressions.depth:Treea->Intdepthtree=casetreeofEmpty->0Node_leftright->1+max(depthleft)(depthright)
OCaml is a general-purpose, high-level, multi-paradigm programming language which extends the Caml dialect of ML with object-oriented features. OCaml was created in 1996 by Xavier Leroy, Jérôme Vouillon, Damien Doligez, Didier Rémy, Ascánder Suárez, and others.
D, also known as dlang, is a multi-paradigm system programming language created by Walter Bright at Digital Mars and released in 2001. Andrei Alexandrescu joined the design and development effort in 2007. Though it originated as a re-engineering of C++, D is now a very different language drawing inspiration from other high-level programming languages, notably Java, Python, Ruby, C#, and Eiffel.
Apache Groovy is a Java-syntax-compatible object-oriented programming language for the Java platform. It is both a static and dynamic language with features similar to those of Python, Ruby, and Smalltalk. It can be used as both a programming language and a scripting language for the Java Platform, is compiled to Java virtual machine (JVM) bytecode, and interoperates seamlessly with other Java code and libraries. Groovy uses a curly-bracket syntax similar to Java's. Groovy supports closures, multiline strings, and expressions embedded in strings. Much of Groovy's power lies in its AST transformations, triggered through annotations.
In compiler construction, name mangling is a technique used to solve various problems caused by the need to resolve unique names for programming entities in many modern programming languages.
In computer programming, an entry point is the place in a program where the execution of a program begins, and where the program has access to command line arguments.
Scala is a strong statically typed high-level general-purpose programming language that supports both object-oriented programming and functional programming. Designed to be concise, many of Scala's design decisions are intended to address criticisms of Java.
Haxe is a high-level cross-platform programming language and compiler that can produce applications and source code for many different computing platforms from one code-base. It is free and open-source software, released under an MIT License. The compiler, written in OCaml, is released under the GNU General Public License (GPL) version 2.
In computer programming, an anonymous function is a function definition that is not bound to an identifier. Anonymous functions are often arguments being passed to higher-order functions or used for constructing the result of a higher-order function that needs to return a function. If the function is only used once, or a limited number of times, an anonymous function may be syntactically lighter than using a named function. Anonymous functions are ubiquitous in functional programming languages and other languages with first-class functions, where they fulfil the same role for the function type as literals do for other data types.
TypeScript is a free and open-source high-level programming language developed by Microsoft that adds static typing with optional type annotations to JavaScript. It is designed for the development of large applications and transpiles to JavaScript. Because TypeScript is a superset of JavaScript, all JavaScript programs are syntactically valid TypeScript, but they can fail to type-check for safety reasons.
Vala is an object-oriented programming language with a self-hosting compiler that generates C code and uses the GObject system.
Node.js is a cross-platform, open-source JavaScript runtime environment that can run on Windows, Linux, Unix, macOS, and more. Node.js runs on the V8 JavaScript engine, and executes JavaScript code outside a web browser.
Nemerle is a general-purpose, high-level, statically typed programming language designed for platforms using the Common Language Infrastructure (.NET/Mono). It offers functional, object-oriented, aspect-oriented, reflective and imperative features. It has a simple C#-like syntax and a powerful metaprogramming system.
In computer programming, string interpolation is the process of evaluating a string literal containing one or more placeholders, yielding a result in which the placeholders are replaced with their corresponding values. It is a form of simple template processing or, in formal terms, a form of quasi-quotation. The placeholder may be a variable name, or in some languages an arbitrary expression, in either case evaluated in the current context.
Jasmine is an open-source testing framework for JavaScript. It aims to run on any JavaScript-enabled platform, to not intrude on the application nor the IDE, and to have easy-to-read syntax. It is heavily influenced by other unit testing frameworks, such as ScrewUnit, JSSpec, JSpec, and RSpec.
Dart is a programming language designed by Lars Bak and Kasper Lund and developed by Google. It can be used to develop web and mobile apps as well as server and desktop applications.
Idris is a purely-functional programming language with dependent types, optional lazy evaluation, and features such as a totality checker. Idris may be used as a proof assistant, but is designed to be a general-purpose programming language similar to Haskell.
Swift is a high-level general-purpose, multi-paradigm, compiled programming language created by Chris Lattner in 2010 for Apple Inc. and maintained by the open-source community. Swift compiles to machine code, as it is an LLVM-based compiler. Swift was first released in June 2014, and the Swift toolchain has shipped in Xcode since version 6, released in 2014.
Nim is a general-purpose, multi-paradigm, statically typed, compiled high-level systems programming language, designed and developed by a team around Andreas Rumpf. Nim is designed to be "efficient, expressive, and elegant", supporting metaprogramming, functional, message passing, procedural, and object-oriented programming styles by providing several features such as compile time code generation, algebraic data types, a foreign function interface (FFI) with C, C++, Objective-C, and JavaScript, and supporting compiling to those same languages as intermediate representations.
PureScript is a strongly-typed, purely-functional programming language that transpiles to JavaScript, C++11, Erlang, and Go. It can be used to develop web applications, server side apps, and also desktop applications with use of Electron or via C++11 and Go compilers with suitable libraries. Its syntax is mostly comparable to that of Haskell. In addition, it introduces row polymorphism and extensible records. Also, contrary to Haskell, the PureScript language is defined as having a strict evaluation strategy, although there are non-conforming back ends which implement a lazy evaluation strategy.
Gleam is a general-purpose, concurrent, functional high-level programming language that compiles to Erlang or JavaScript source code.
Those of you familiar with the Elm style may recognize that the updated --explain messages draw heavy inspiration from the Elm approach.
Roc is a direct descendant of the Elm programming language. The two languages are similar, but not the same!