Concepts inProving termination of membership equational programs
Programming language
A programming language is an artificial language designed to communicate instructions to a machine, particularly a computer. Programming languages can be used to create programs that control the behavior of a machine and/or to express algorithms precisely. The earliest programming languages predate the invention of the computer, and were used to direct the behavior of machines such as Jacquard looms and player pianos.
more from Wikipedia
Subset
In mathematics, especially in set theory, a set A is a subset of a set B, or equivalently B is a superset of A, if A is "contained" inside B. A and B may coincide. The relationship of one set being a subset of another is called inclusion or sometimes containment.
more from Wikipedia
C (programming language)
C is a general-purpose computer programming language developed between 1969 and 1973 by Dennis Ritchie at the Bell Telephone Laboratories for use with the Unix operating system. Although C was designed for implementing system software, it is also widely used for developing portable application software. C is one of the most widely used programming languages of all time and there are very few computer architectures for which a C compiler does not exist.
more from Wikipedia
Evaluation strategy
In computer science, an evaluation strategy is a set of (usually deterministic) rules for evaluating expressions in a programming language. Emphasis is typically placed on functions or operators: an evaluation strategy defines when and in what order the arguments to a function are evaluated, when they are substituted into the function, and what form that substitution takes.
more from Wikipedia
ASF+SDF Meta Environment
The ASF+SDF Meta-Environment is an IDE and toolset for interactive program analysis and transformation. It combines SDF, ASF and other technologies.
more from Wikipedia
Sequence
In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements), and the number of ordered element (possibly infinite) is called the length of the sequence. Unlike a set, order matters, and exactly the same elements can appear multiple times at different positions in the sequence. A sequence is a discrete function. For example, (C, R, Y) is a sequence of letters that differs from (Y, C, R), as the ordering matters.
more from Wikipedia
Equational logic
First-order equational logic consists of quantifier-free terms of ordinary first-order logic, with equality as the only predicate symbol. The model theory of this logic was developed into Universal algebra by Birkhoff et al. [Birkhoff, Gratzer, Cohn]. It was later made into a branch of category theory by Lawvere ("algebraic theories"). The terms of equational logic are built up from variables and constants using function symbols (or operations). Identities (equalities) of the form
more from Wikipedia
Middle English
Middle English is the period in the history of the English language between the High and Late Middle Ages, or roughly during the four centuries between the late 11th and the late 15th century. Middle English developed out of Late Old English in Norman England (1066�) and was spoken throughout the Plantagenet era (1154�).
more from Wikipedia