Abstract State Machine Language
- Abstract State Machine Language
infobox programming language
name = AsmL
year =
designer = Microsoft Corporation
latest_release_version =
latest_release_date =
latest_test_version =
latest_test_date =
implementations = XASM
influenced_by =
typing =
dialects =
influenced =
paradigm = functional
Abstract State Machine Language (AsmL) is a programming language based on the Abstract State Machines formal method and developed by Microsoft. AsmL is a functional language (which are commonly used in academic research).
XASM is an open source implementation of the language.
External links
* [http://research.microsoft.com/fse/asml/ Microsoft: ASML]
* [http://www.xasm.org/ XASM]
Wikimedia Foundation.
2010.
Look at other dictionaries:
Abstract State Machine — Eine abstrakte Zustandsmaschine (englisch Abstract State Machine (ASM), ehemals auch Evolving Algebra (EVA) genannt), ist in der Informatik ein Modell zur formalen, operationellen Beschreibung von Algorithmen. Anders als bei endlichen Automaten,… … Deutsch Wikipedia
Abstract state machines — In computer science, an abstract state machine (ASM) is a state machine in which the number of states need not be finite and in which the states are not mere points in the state space. More precisely, an ASM state is a structure in the sense of… … Wikipedia
Abstract State Machines — Eine abstrakte Zustandsmaschine (englisch Abstract State Machine (ASM), ehemals auch Evolving Algebra (EVA) genannt), ist in der Informatik ein Modell zur formalen, operationalen Beschreibung von Algorithmen. Anders als bei endlichen Automaten,… … Deutsch Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
language — /lang gwij/, n. 1. a body of words and the systems for their use common to a people who are of the same community or nation, the same geographical area, or the same cultural tradition: the two languages of Belgium; a Bantu language; the French… … Universalium
Abstract machine — An abstract machine, also called an abstract computer, is a theoretical model of a computer hardware or software system used in Automata theory. Abstraction of computing processes is used in both the computer science and computer engineering… … Wikipedia
State pattern — [ LePUS3 ( [http://lepus.org.uk/ref/legend/legend.xml legend] ) ] The state pattern is a behavioral software design pattern, also known as the objects for states pattern. This pattern is used in computer programming to represent the state of an… … Wikipedia
State transition system — In theoretical computer science, a state transition system is an abstract machine used in the study of computation. The machine consists of a set of states and transitions between states. State transition systems differ from finite state automata … Wikipedia
