M-expression

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In computer programming, M-expressions (or meta-expressions) were an early proposed syntax for the Lisp programming language, inspired by contemporary languages such as Fortran and ALGOL. The notation was never implemented into the language and, as such, it was never finalized.[1]

Compared to S-expressions, M-expressions introduce function notation, infix operators (including a defun operator), and shorthands for cond and list into the language.[2]

Background[edit]

John McCarthy published the first paper on Lisp in 1960 while a research fellow at the Massachusetts Institute of Technology. In it he described a language of symbolic expressions (S-expressions) that could represent complex structures as lists. Then he defined a set of primitive operations on the S-expressions, and a language of meta-expressions (M-expressions) that could be used to define more complex operations. Finally, he showed how the meta-language itself could be represented with S-expressions, resulting in a system that was potentially self-hosting.[3] The draft version of this paper is known as "AI Memo 8".[4]

Example M-expressions (LISP 1.5, 1965)[2]
Expression type Mathematical notation M-expression Modern Lisp S-expression
List value [1;2;3] (quote (1 2 3))
Function application f[x;y] (f x y)
Function definition label[square;λ[[x];times[x;x]]] (define square (lambda (x) (* x x)))
Conditional expression [lessp[x;0] → minus[x]; T → x] (cond ((< x 0) (- x)) (t x))

McCarthy had planned to develop an automatic Lisp compiler (LISP 2) using M-expressions as the language syntax and S-expressions to describe the compiler's internal processes. Stephen B. Russell read the paper and suggested to him that S-expressions were a more convenient syntax. Although McCarthy disapproved of the idea, Russell and colleague Daniel J. Edwards hand-coded an interpreter program that could execute S-expressions.[2] This program was adopted by McCarthy's research group, establishing S-expressions as the dominant form of Lisp.

McCarthy reflected on the fate of M-expressions in 1979:

The project of defining M-expressions precisely and compiling them or at least translating them into S-expressions was neither finalized nor explicitly abandoned. It just receded into the indefinite future, and a new generation of programmers appeared who preferred internal notation to any FORTRAN-like or ALGOL-like notation that could be devised.[5]

Implementations[edit]

A form of sugared M-expressions has been implemented in the Wolfram language of Wolfram Mathematica since 1988:

Example Wolfram snippets
Expression type Sugared syntax (InputForm) Function form (FullForm)
List value {1, 2, 3} List[1, 2, 3]
Function application f[x, y] f[x, y]
Function definition
  • square = #*# & (pure)
  • square[x_] := x*x (pattern)
  • Set[square, Function[x, Times[x, x]]] (pure)
  • SetDelayed[square[Pattern[x, Blank[]]], Times[x, x]] (pattern)

(Conditionals take more to explain, as the general conditional system in the language relies on pattern matching and rewriting.)[6]

For LISP[edit]

MLisp was a contemporary (1968-1973) project to implement an M-expression-like frontend for Lisp. A few extra features like hygienic macros, pattern matching, and backtracking were incorporated. It eventually evolved into an abandoned LISP70 draft. M-LISP (MetaLISP) from 1989 was another attempt to blend M-expressions with Scheme.[7]

A parser for the "AI Memo 8" M-expression is available in Common Lisp, but the author intends it as a case against M-expressions due to its perceived inability to cope with macros.[8]

Further development[edit]

A CGOL (1977) was implemented in MacLisp and follows a similar goal of introducing Algol-like syntax with infix operators.[7] It is known to work on Armed Bear Common Lisp.[9]

A more recent (circa 2003) variant is the I-expression, which use indentation to indicate parentheses implicitly, and are thus in some ways intermediate between S-expressions and M-expressions. I-expressions were introduced in Scheme Request For Implementation 49 as an auxiliary syntax for Scheme, but they have not been widely adopted.[10]

A further development is the "sweet" t-expression, which has infix operators without precedence. Like I-expressions, t-expressions are only a simple transformation away from S-expressions, so that theoretically they can be used on any Lisp dialect and not interfere with features like macros.[11]

Additional syntax-related include Apple's Dylan (Algol-like tokens) and Clojure's addition of other literal syntaxes.[7]

References[edit]

  1. ^ "The implementation of LISP". www-formal.stanford.edu. Retrieved 2020-03-29.
  2. ^ a b c "LISP 1.5 Programmer's Manual" (PDF). Community.computerhistory.org. 1965. Archived from the original (PDF) on 2006-02-11. Retrieved 2013-09-02.
  3. ^ McCarthy, John (April 1960) "Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I"
  4. ^ McCarthy, John (March 1959). "Recursive Functions of Symbolic Expressions and Their Computation by Machine (AI Memo 8)".
  5. ^ "The implementation of LISP". Formal.stanford.edu. 1979-02-12. Retrieved 2013-08-24.
  6. ^ Mathematica as a Rewrite Language.
  7. ^ a b c Lee, Xah. "LISP Infix Syntax Survey".
  8. ^ "A Parser for M-Expressions". Let's newbies play with them, and realize how impractical they are. Note for example, that we cannot use macros anymore because their syntax would need to be known by the M-expression parser.
  9. ^ CGOL on ABCL Development of the Armed Bear Common Lisp implementation blog.
  10. ^ Möller, Egil (2003). "SRFI 49: Indentation-sensitive syntax". srfi.schemers.org.
  11. ^ Wheeler, DA (2013). "SRFI 110: Sweet-expressions (t-expressions)". srfi.schemers.org.