M-expression
In Lisp programming language, M-expressions were an early proposed syntax for the Lisp, inspired by contemporary languages such as Fortran and ALGOL. The notation was never implemented into the language and, as such, it was never finalized.
M-expressions are a syntax for LISP code and provide function notation, syntax for a form and for embedded literal data into programs. Thus M-Expressions used S-Expressions for literal data. The syntax for S-Expressions and M-Expressions is defined on pages 8 and 9 of the Lisp 1.5 manual.
M-Expressions also had a corresponding S-Expression representation. Code was manually translated from M-Expressions to S-Expressions. The lists in M-expressions embedded literal data that then had to be quoted in S-Expressions.
Background
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 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 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. The draft version of this paper is known as "AI Memo 8".| Expression type | Mathematical notation | M-expression | Modern Lisp S-expression |
| List value | |||
| Function application | |||
| Function definition | |||
| Conditional expression |
McCarthy had planned to develop an automatic Lisp compiler using M-expressions as the language syntax and S-expressions to describe the compiler's internal processes. Stephen R. 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. 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 book Anatomy of LISP by John Allen explains the definition of M-expressions and uses them throughout the book to explain Lisp and its implementation.
Examples
The definitions for the functions apply and eval from the Lisp 1.5 Manual, page 13.apply =
→
→ caar;
eq → cdar;
eq → cons;cadr → atom → eq;cadr;x;a;
eq;LAMBDA] → eval;parlis;x;a;
eq;LABEL] → apply;x;cons;caddr
eval =
→ cdr,QUOTE] → cadr;
eq;COND] → evcon;a];
T → apply;evlis;a];a;
T → apply;evlis;a];a
Using the function eval on an s-expression.
eval
Implementations
For LISP
was a contemporary 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 from 1989 was another attempt to blend M-expressions with Scheme.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.
Further development
A CGOL was implemented in MacLisp and follows a similar goal of introducing Algol-like syntax with infix operators. It is known to work on Armed [Bear Common Lisp].A more recent 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.
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.
Additional syntax-related include Apple's Dylan and Clojure's addition of other literal syntaxes.