Jump to content

Expression (mathematics)

From Wikipedia, the free encyclopedia

In the equation 7x − 5 = 2, the sides of the equation are expressions.

In mathematics, an expression is a written arrangement of symbols following the context-dependent, syntactic conventions of mathematical notation. Symbols can denote numbers (constants), variables, operations, and functions.[1] Other symbols include punctuation marks and brackets, used for grouping where there is not a well-defined order of operations.

Expressions are commonly distinguished from formulas: expressions are a kind of mathematical object, whereas formulas are statements about mathematical objects.[2] This is analogous to natural language, where a noun phrase refers to an object, and a whole sentence refers to a fact. For example, is an expression, while the inequality is a formula.

Expressions can be evaluated or partially evaluated by replacing operations that appear in them with their result. For example, the expression evaluates partially to and totally to

An expression is often used to define a function, by taking the variables to be arguments, or inputs, of the function, and assigning the output to be the total evaluation of the resulting expression.[3] For example, and define the function that associates to each number its square plus one. An expression with no variables would define a constant function. Usually, two expressions are considered equal or equivalent if they define the same function. Such an equality is called a "semantic equality", that is, both expressions "mean the same thing."

A formal expression is a kind of string of symbols, created by the same production rules as standard expressions, however, they are used without regard to the meaning of the expression. In this way, two formal expressions are considered equal only if they are syntactically equal, that is, if they are the exact same expression.[4][5] For instance, the formal expressions "2" and "1+1" are not equal.

History

[edit]

Beginning of notation

[edit]

Written mathematics began with numbers expressed as tally marks, with each tally representing a single unit. The numerical symbols consisted probably of strokes or notches cut in wood or stone, and intelligible alike to all nations. For example, one notch in a bone represented one animal, or person, or anything else. The peoples with whom the Greeks of Asia Minor (amongst whom notation in western history begins) were likely to have come into frequent contact were those inhabiting the eastern littoral of the Mediterranean: and Greek tradition uniformly assigned the special development of geometry to the Egyptians, and that of the science of numbers either to the Egyptians or to the Phoenicians.

The Ancient Egyptians had a symbolic notation which was the numeration by Hieroglyphics.[6][7] The Egyptian mathematics had a symbol for one, ten, one hundred, one thousand, ten thousand, one hundred thousand, and one million. Later, the Egyptians used hieratic instead of hieroglyphic script to show numbers. For example, the four vertical lines used to represent four were replaced by a single horizontal line. This is found in the Rhind Mathematical Papyrus (c. 2000–1800 BC) and the Moscow Mathematical Papyrus (c. 1890 BC). The system the Egyptians used was discovered and modified by many other civilizations in the Mediterranean. The Egyptians also had symbols for basic operations: legs going forward represented addition, and legs walking backward to represent subtraction.

Babylonian tablet (c. 1800–1600 BCE), showing an approximation to the square root of 2 (1 24 51 10 w: sexagesimal) in the context of Pythagoras' Theorem for an isosceles triangle.

The Mesopotamians had symbols for each power of ten.[8] Later, they wrote their numbers in almost exactly the same way done in modern times. Instead of having symbols for each power of ten, they would just put the coefficient of that number. Each digit was separated by only a space, but by the time of Alexander the Great, they had created a symbol that represented zero and was a placeholder. The Mesopotamians also used a sexagesimal system, that is base sixty. It is this system that is used in modern times when measuring time and angles. Babylonian mathematics is derived from more than 400 clay tablets unearthed since the 1850s.[9] Written in Cuneiform script, tablets were inscribed whilst the clay was moist, and baked hard in an oven or by the heat of the sun. Some of these appear to be graded homework. The earliest evidence of written mathematics dates back to the ancient Sumerians and the system of metrology from 3000 BC. From around 2500 BC onwards, the Sumerians wrote multiplication tables on clay tablets and dealt with geometrical exercises and division problems. The earliest traces of the Babylonian numerals also date back to this period.

Syncopated stage

[edit]

Greek mathematics, which originated with the study of geometry, tended to be deductive and scientific from its commencement. Since the fourth century AD, Pythagoras has commonly been given credit for discovering the Pythagorean theorem, a theorem in geometry that states that in a right-angled triangle the area of the square on the hypotenuse (the side opposite the right angle) is equal to the sum of the areas of the squares of the other two sides.

The Greeks employed Attic numeration,[10] which was based on the system of the Egyptians and was later adapted and used by the Romans. Greek numerals one through four were vertical lines, as in the hieroglyphics. The symbol for five was the Greek letter Π (pi), which is the letter of the Greek word for five, pente. Numbers six through nine were pente with vertical lines next to it. Ten was represented by the letter (Δ) of the word for ten, deka, one hundred by the letter from the word for hundred, etc.

Greek mathematical reasoning was almost entirely geometric (albeit often used to reason about non-geometric subjects such as number theory), and hence the Greeks had no interest in algebraic symbols. The great exception was Diophantus of Alexandria, the great algebraist.[11] His Arithmetica was one of the texts to use symbols in equations. It was not completely symbolic, but was much more so than previous books. An unknown number was called s.[12] The square of s was ; the cube was ; the fourth power was ; and the fifth power was .[13] So for example, the expression:

would be written as:[citation needed]

SS2 C3 x5 M S4 u6

The next phase of notation for algebra was syncopated algebra, in which some symbolism is used, but which does not contain all of the characteristics of symbolic algebra. For instance, there may be a restriction that subtraction may be used only once within one side of an equation, which is not the case with symbolic algebra. Syncopated algebraic expression first appeared in a serious of books called Arithmetica, by Diophantus of Alexandria (3rd century AD, many lost), followed by Brahmagupta's Brahma Sphuta Siddhanta (7th century).

Symbolic stage and early arithmetic

[edit]

The transition to symbolic algebra, where only symbols are used, can first be seen in the work of Ibn al-Banna' al-Marrakushi (1256–1321) and Abū al-Ḥasan ibn ʿAlī al-Qalaṣādī (1412–1482).[14][15] Al-Qalasādī was the last major medieval Arab algebraist, who improved on the algebraic notation earlier used in the Maghreb by Ibn al-Banna.[16] In contrast to the syncopated notations of their predecessors, Diophantus and Brahmagupta, which lacked symbols for mathematical operations,[17] al-Qalasadi's algebraic notation was the first to have symbols for these functions and was thus "the first steps toward the introduction of algebraic symbolism." He represented mathematical symbols using characters from the Arabic alphabet.[16]

The 1489 use of the plus and minus signs in print.

The 14th century saw the development of new mathematical concepts to investigate a wide range of problems.[18] The two widely used arithmetic symbols are addition and subtraction, + and −. The plus sign was used starting around 1351 by Nicole Oresme[19] and publicized in his 1360 in his work Algorismus proportionum.[20] It is thought an abbreviation for "et", meaning "and" in Latin, in much the same way the ampersand sign also began as "et". Oresme at the University of Paris and the Italian Giovanni di Casali independently provided graphical demonstrations of the distance covered by a body undergoing uniformly accelerated motion, asserting that the area under the line depicting the constant acceleration and represented the total distance traveled.[21] The minus sign was used in 1489 by Johannes Widmann in Mercantile Arithmetic or Behende und hüpsche Rechenung auff allen Kauffmanschafft,.[22] Widmann used the minus symbol with the plus symbol, to indicate deficit and surplus, respectively.[23] In Summa de arithmetica, geometria, proportioni e proportionalità,[24] Luca Pacioli used symbols for plus and minus symbols and contained algebra, though much of the work originated from Piero della Francesca whom he appropriated and purloined.[citation needed]

The radical symbol (√), for square root was introduced by Christoph Rudolff in the early 1500s.Michael Stifel's important work Arithmetica integra[25] contained important innovations in mathematical notation. In 1556, Niccolò Tartaglia used parentheses for precedence grouping. In 1557 Robert Recorde published The Whetstone of Witte which introduced the equal sign (=), as well as plus and minus signs for the English reader. In 1564, Gerolamo Cardano analyzed games of chance beginning the early stages of probability theory. In 1572 Rafael Bombelli published his L'Algebra in which he showed how to deal with the imaginary quantities that could appear in Cardano's formula for solving cubic equations. Simon Stevin's book De Thiende ('the art of tenths'), published in Dutch in 1585, contained a systematic treatment of decimal notation, which influenced all later work on the real number system. The new algebra (1591) of François Viète introduced the modern notational manipulation of algebraic expressions.

John Napier is best known as the inventor of logarithms (published in Description of the Marvelous Canon of Logarithms)[26] and made common the use of the decimal point in arithmetic and mathematics.[27][28] After Napier, Edmund Gunter created the logarithmic scales (lines, or rules) upon which slide rules are based, it was William Oughtred who used two such scales sliding by one another to perform direct multiplication and division; and he is credited as the inventor of the slide rule in 1622. In 1631 Oughtred introduced the multiplication sign (×), his proportionality sign (∷) and abbreviations sin and cos for the sine and cosine functions.[29] Albert Girard also used the abbreviations 'sin', 'cos' and 'tan' for the trigonometric functions in his treatise.

René Descartes is credited as the father of analytical geometry, the bridge between algebra and geometry, crucial to the discovery of infinitesimal calculus and analysis. In the 17th century, Descartes introduced Cartesian co-ordinates which allowed the development of analytic geometry, bring the notation of equations to geometry. Blaise Pascal influenced mathematics throughout his life. His Traité du triangle arithmétique ("Treatise on the Arithmetical Triangle") of 1653 described a convenient tabular presentation for binomial coefficients, now called Pascal's triangle. John Wallis introduced the infinity symbol (∞) and also used this notation for infinitesimals, for example, 1/.

Johann Rahn introduced the division sign (÷, an obelus variant repurposed) and the therefore sign in 1659. William Jones used π in Synopsis palmariorum mathesios[30] in 1706 because it is the initial letter of the Greek word Perimetron (περιμετρον), which means perimeter in Greek. This usage was popularized in 1737 by Euler. In 1734, Pierre Bouguer used double horizontal bar below the inequality sign.

Variables and evaluation

[edit]

Many expressions include variables. Any variable can be classified as being either a free variable or a bound variable.

For a given combination of values for the free variables, an expression may be evaluated, although for some combinations of values of the free variables, the value of the expression may be undefined. Thus an expression represents an operation over constants and free variables and whose output is the resulting value of the expression.[31]

For example, if the expression is evaluated with x = 10, y = 5, it evaluates to 2; this is denoted

The evaluation is undefined for y = 0

Two expressions are said to be equivalent if, for each combination of values for the free variables, they have the same output, i.e., they represent the same function. [32][33] The equivalence between two expressions is called an identity and is often denoted with

For example, in the expression the variable n is bound, and the variable x is free. This expression is equivalent to the simpler expression 12 x; that is The value for x = 3 is 36, which can be denoted

Well-defined expressions

[edit]

The language of mathematics exhibits a kind of grammar (called formal grammar) about how expressions may be written. There are two considerations for well-definedness of mathematical expressions, syntax and semantics. Syntax is concerned with the rules used for constructing, or transforming the symbols of an expression without regard to any interpretation or meaning given to them. Expressions that are syntactically correct are called well-formed. Semantics is concerned with the meaning of these well-formed expressions. Expressions that are semantically correct are called well-defined.

Well-formed

[edit]

The syntax of mathematical expressions can be described somewhat informally as follows: the allowed operators must have the correct number of inputs in the correct places (usually written with infix notation), the sub-expressions that make up these inputs must be well-formed themselves, have a clear order of operations, etc. Strings of symbols that conform to the rules of syntax are called well-formed, and those that are not well-formed are called, ill-formed, and are do not constitute mathematical expressions.[34]

For example, in arithmetic, the expression 1 + 2 × 3 is well-formed, but

.

is not.

However, being well-formed is not enough to be considered well-defined. For example in arithmetic, the expression is well-formed, but it is not well-defined. (See Division by zero). Such expressions are called undefined.

Well-defined

[edit]

Semantics is the study of meaning. Formal semantics is about attaching meaning to expressions. An expression that defines a unique value or meaning is said to be well-defined. Otherwise, the expression is said to be ill defined or ambiguous.[35] In general the meaning of expressions is not limited to designating values; for instance, an expression might designate a condition, or an equation that is to be solved, or it can be viewed as an object in its own right that can be manipulated according to certain rules. Certain expressions that designate a value simultaneously express a condition that is assumed to hold, for instance those involving the operator to designate an internal direct sum.

In algebra, an expression may be used to designate a value, which might depend on values assigned to variables occurring in the expression. The determination of this value depends on the semantics attached to the symbols of the expression. The choice of semantics depends on the context of the expression. The same syntactic expression 1 + 2 × 3 can have different values (mathematically 7, but also 9), depending on the order of operations implied by the context (See also Operations § Calculators).

For real numbers, the product is unambiguous because ; hence the notation is said to be well defined.[36] This property, also known as associativity of multiplication, guarantees the result does not depend on the sequence of multiplications; therefore, a specification of the sequence can be omitted. The subtraction operation is non-associative; despite that, there is a convention that is shorthand for , thus it is considered "well-defined". On the other hand, Division is non-associative, and in the case of , parenthesization conventions are not well established; therefore, this expression is often considered ill-defined.

Unlike with functions, notational ambiguities can be overcome by means of additional definitions (e.g., rules of precedence, associativity of the operator). For example, in the programming language C, the operator - for subtraction is left-to-right-associative, which means that a-b-c is defined as (a-b)-c, and the operator = for assignment is right-to-left-associative, which means that a=b=c is defined as a=(b=c).[37] In the programming language APL there is only one rule: from right to left – but parentheses first.

Formal definition

[edit]

The term 'expression' is part of the language of mathematics, that is to say, it is not defined within mathematics, but taken as a primitive part of the language. To attempt to define the term would not be doing mathematics, but rather, one would be engaging in a kind metamatematics (the metalanguage of mathematics), usually mathematical logic. Within mathematical logic, mathematics is usually described as a kind of formal language, and a well-formed expression can be defined recursively as follows:[38]

The alphabet consists of:

  • A set of individual variables: A countably infinite amount of symbols representing variables used for representing an unspecified object in the domain. (Usually letters like x, or y)
  • A set of operations: Function symbols representing operations that can be performed on elements over the domain, like addition (+), multiplication (×), or set operations like union (∪), or intersection (∩). (Functions can be understood as unary operations)
  • Brackets ( )

With this alphabet, the recursive rules for forming well-formed expression (WFE) are as follows:

  • Any constant or variable as defined are the atomic expressions (the simplest WFE's). For instance, the expressions "" or "" are syntactically correct expressions.
  • Let be a metavariable for any n-ary operation over the domain, and let be metavariables for any WFE's.
Then is also a WFE.
For instance, if the domain of discorse is the real numbers, can denote the binary operation +, then is a WFE. Or can be the unary operation , then is as well.
Brackets are initially around each non-atomic expression, but they can be deleted in cases where there is a defined order of operations, or where order doesn't matter (i.e. where operations are associative)

A well-formed expression can be thought as a syntax tree.[39] The leaf nodes are always atomic expressions. Operations and have exactly two child nodes, while operations , and have exactly one. There are countably infinitely many WFE's, however, each WFE has a finite number of nodes.

Lambda calculus

[edit]

Formal languages allow formalizing the concept of well-formed expressions.

In the 1930s, a new type of expressions, called lambda expressions, were introduced by Alonzo Church and Stephen Kleene for formalizing functions and their evaluation. [40][a] They form the basis for lambda calculus, a formal system used in mathematical logic and the theory of programming languages.

The equivalence of two lambda expressions is undecidable. This is also the case for the expressions representing real numbers, which are built from the integers by using the arithmetical operations, the logarithm and the exponential (Richardson's theorem)

Types of expressions

[edit]

Algebraic expression

[edit]

An algebraic expression is an expression built up from algebraic constants, variables, and the algebraic operations (addition, subtraction, multiplication, division and exponentiation by a rational number).[41] For example, 3x2 − 2xy + c is an algebraic expression. Since taking the square root is the same as raising to the power 1/2, the following is also an algebraic expression:

See also: Algebraic equation and Algebraic closure

Polynomial expression

[edit]

A polynomial expression is an expression built with scalars (numbers of elements of some field), indeterminates, and the operators of addition, multiplication, and exponentiation to nonnegative integer powers; for example

Using associativity, commutativity and distributivity, every polynomial expression is equivalent to a polynomial, that is an expression that is a linear combination of products of integer powers of the indeterminates. For example the above polynomial expression is equivalent (denote the same polynomial as

Many author do not distinguish polynomials and polynomial expressions. In this case the expression of a polynomial expression as a linear combination is called the canonical form, normal form, or expanded form of the polynomial.

Computational expression

[edit]

In computer science, an expression is a syntactic entity in a programming language that may be evaluated to determine its value[42] or fail to terminate, in which case the expression is undefined.[43] It is a combination of one or more constants, variables, functions, and operators that the programming language interprets (according to its particular rules of precedence and of association) and computes to produce ("to return", in a stateful environment) another value. This process, for mathematical expressions, is called evaluation. In simple settings, the resulting value is usually one of various primitive types, such as string, Boolean, or numerical (such as integer, floating-point, or complex).

In computer algebra, formulas are viewed as expressions that can be evaluated as a Boolean, depending on the values that are given to the variables occurring in the expressions. For example takes the value false if x is given a value less than 1, and the value true otherwise.

Expressions are often contrasted with statements—syntactic entities that have no value (an instruction).

Representation of the expression (8 − 6) × (3 + 1) as a Lisp tree, from a 1985 Master's Thesis[44]

Except for numbers and variables, every mathematical expression may be viewed as the symbol of an operator followed by a sequence of operands. In computer algebra software, the expressions are usually represented in this way. This representation is very flexible, and many things that seem not to be mathematical expressions at first glance, may be represented and manipulated as such. For example, an equation is an expression with "=" as an operator, a matrix may be represented as an expression with "matrix" as an operator and its rows as operands.

See: Computer algebra expression

Logical expression

[edit]

In mathematical logic, a "logical expression" can refer to either terms or formulas. A term denotes a mathematical object while a formula denotes a mathematical fact. In particular, terms appear as components of a formula.

A first-order term is recursively constructed from constant symbols, variables, and function symbols. An expression formed by applying a predicate symbol to an appropriate number of terms is called an atomic formula, which evaluates to true or false in bivalent logics, given an interpretation. For example, is a term built from the constant 1, the variable x, and the binary function symbols and ; it is part of the atomic formula which evaluates to true for each real-numbered value of x.

See also

[edit]

Notes

[edit]
  1. ^ “expression (n.), sense II.7,”. Oxford English Dictionary.
  2. ^ Stoll, Robert R. Set Theory and Logic. San Francisco, CA: Dover Publications. ISBN 978-0-486-63829-4.
  3. ^ Codd, Edgar Frank (June 1970). "A Relational Model of Data for Large Shared Data Banks" (PDF). Communications of the ACM. 13 (6): 377–387. doi:10.1145/362384.362685. S2CID 207549016. Archived (PDF) from the original on 2004-09-08. Retrieved 2020-04-29.
  4. ^ McCoy, Neal H. (1960). Introduction To Modern Algebra. Boston: Allyn & Bacon. p. 127. LCCN 68015225.
  5. ^ Fraleigh, John B. (2003). A first course in abstract algebra. Boston : Addison-Wesley. ISBN 978-0-201-76390-4.
  6. ^ Encyclopædia Americana. By Thomas Gamaliel Bradford. Pg 314
  7. ^ Mathematical Excursion, Enhanced Edition: Enhanced Webassign Edition By Richard N. Aufmann, Joanne Lockwood, Richard D. Nation, Daniel K. Cleg. Pg 186
  8. ^ "Mathematics in Egypt and Mesopotamia" (PDF). Archived from the original (PDF) on 2022-12-28. Retrieved 2013-07-25.
  9. ^ Boyer, C. B. A History of Mathematics, 2nd ed. rev. by Uta C. Merzbach. New York: Wiley, 1989 ISBN 0-471-09763-2 (1991 pbk ed. ISBN 0-471-54397-7). "Mesopotamia" p. 25.
  10. ^ Mathematics and Measurement By Oswald Ashton Wentworth Dilk. Pg 14
  11. ^ Diophantine Equations. Submitted by: Aaron Zerhusen, Chris Rakes, & Shasta Meece. MA 330-002. Dr. Carl Eberhart. 16 February 1999.
  12. ^ A History of Greek Mathematics: From Aristarchus to Diophantus. By Sir Thomas Little Heath. Pg 456
  13. ^ A History of Greek Mathematics: From Aristarchus to Diophantus. By Sir Thomas Little Heath. Pg 458
  14. ^ O'Connor, John J.; Robertson, Edmund F., "al-Marrakushi ibn Al-Banna", MacTutor History of Mathematics Archive, University of St Andrews
  15. ^ Gullberg, Jan (1997). Mathematics: From the Birth of Numbers. W. W. Norton. p. 298. ISBN 0-393-04002-X.
  16. ^ a b O'Connor, John J.; Robertson, Edmund F., "Abu'l Hasan ibn Ali al Qalasadi", MacTutor History of Mathematics Archive, University of St Andrews
  17. ^ Boyer, C. B. A History of Mathematics, 2nd ed. rev. by Uta C. Merzbach. New York: Wiley, 1989 ISBN 0-471-09763-2 (1991 pbk ed. ISBN 0-471-54397-7). "Revival and Decline of Greek Mathematics" p. 178 (cf., "The chief difference between Diophantine syncopation and the modern algebraic notation is the lack of special symbols for operations and relations, as well as of the exponential notation.")
  18. ^ Grant, Edward and John E. Murdoch (1987), eds., Mathematics and Its Applications to Science and Natural Philosophy in the Middle Ages, (Cambridge: Cambridge University Press) ISBN 0-521-32260-X.
  19. ^ Mathematical Magazine, Volume 1. Artemas Martin, 1887. Pg 124
  20. ^ Der Algorismus proportionum des Nicolaus Oresme: Zum ersten Male nach der Lesart der Handschrift R.40.2. der Königlichen Gymnasial-bibliothek zu Thorn. Nicole Oresme. S. Calvary & Company, 1868.
  21. ^ Clagett, Marshall (1961) The Science of Mechanics in the Middle Ages, (Madison: University of Wisconsin Press), pp. 332–45, 382–91.
  22. ^ Later early modern version: A New System of Mercantile Arithmetic: Adapted to the Commerce of the United States, in Its Domestic and Foreign Relations with Forms of Accounts and Other Writings Usually Occurring in Trade. By Michael Walsh. Edmund M. Blunt (proprietor.), 1801.
  23. ^ Miller, Jeff (2006-06-04). "Earliest Uses of Symbols of Operation". Gulf High School. Retrieved 2006-09-24.
  24. ^ Arithmetical Books from the Invention of Printing to the Present Time. By Augustus De Morgan. p 2.
  25. ^ Arithmetica integra. By Michael Stifel, Philipp Melanchton. Norimbergæ: Apud Iohan Petreium, 1544.
  26. ^ The History of Mathematics By Anne Roone. Pg 40
  27. ^ Memoirs of John Napier of Merchiston. By Mark Napier
  28. ^ An Account of the Life, Writings, and Inventions of John Napier, of Merchiston. By David Stewart Erskine Earl of Buchan, Walter Minto
  29. ^ Cajori, Florian (1919). A History of Mathematics. Macmillan. p. 157.
  30. ^ Synopsis Palmariorum Matheseos. By William Jones. 1706. (Alt: Synopsis Palmariorum Matheseos: or, a New Introduction to the Mathematics. archive.org.)
  31. ^ C.C. Chang; H. Jerome Keisler (1977). Model Theory. Studies in Logic and the Foundation of Mathematics. Vol. 73. North Holland.; here: Sect.1.3
  32. ^ Equation. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Equation&oldid=32613
  33. ^ Pratt, Vaughan, "Algebra", The Stanford Encyclopedia of Philosophy (Winter 2022 Edition), Edward N. Zalta & Uri Nodelman (eds.), URL: https://plato.stanford.edu/entries/algebra/#Laws
  34. ^ Stoll, Robert R. Set Theory and Logic. San Francisco, CA: Dover Publications. ISBN 978-0-486-63829-4.
  35. ^ Weisstein, Eric W. "Well-Defined". From MathWorld – A Wolfram Web Resource. Retrieved 2013-01-02.
  36. ^ Weisstein, Eric W. "Well-Defined". From MathWorld – A Wolfram Web Resource. Retrieved 2013-01-02.
  37. ^ "Operator Precedence and Associativity in C". GeeksforGeeks. 2014-02-07. Retrieved 2019-10-18.
  38. ^ C.C. Chang; H. Jerome Keisler (1977). Model Theory. Studies in Logic and the Foundation of Mathematics. Vol. 73. North Holland.; here: Sect.1.3
  39. ^ Hermes, Hans (1973). Introduction to Mathematical Logic. Springer London. ISBN 3540058192. ISSN 1431-4657.; here: Sect.II.1.3
  40. ^ Church, Alonzo (1932). "A set of postulates for the foundation of logic". Annals of Mathematics. Series 2. 33 (2): 346–366. doi:10.2307/1968337. JSTOR 1968337.
  41. ^ Morris, Christopher G. (1992). Academic Press dictionary of science and technology. Gulf Professional Publishing. p. 74. algebraic expression over a field.
  42. ^ Mitchell, J. (2002). Concepts in Programming Languages. Cambridge: Cambridge University Press, 3.4.1 Statements and Expressions, p. 26
  43. ^ Maurizio Gabbrielli, Simone Martini (2010). Programming Languages - Principles and Paradigms. Springer London, 6.1 Expressions, p. 120
  44. ^ Cassidy, Kevin G. (Dec 1985). The Feasibility of Automatic Storage Reclamation with Concurrent Program Execution in a LISP Environment (PDF) (Master's thesis). Naval Postgraduate School, Monterey/CA. p. 15. ADA165184.
  1. ^ For a full history, see Cardone and Hindley's "History of Lambda-calculus and Combinatory Logic" (2006).

References

[edit]