Lambda
 Volume Number: 9 Issue Number: 9 Column Tag: Lisp Listener

# “The Lambda Lambada: Y Dance?”

## Mutual Recursion

By André van Meulebrouck, Chatsworth, California

Note: Source code files accompanying article are located on MacTech CD-ROM or source code disks.

“Mathematics is thought moving in the sphere of complete abstraction from any particular instance of what it is talking about.” - Alfred North Whitehead

Welcome once again to Mutual of Omo Oz Y Old Kingdom (with apologies to the similar named TV series of yesteryears).

In this installment, Lambda, the forbidden (in conventional languages) function, does the lambada-the forbidden (in l-calculus) dance. Film at 11.

In [vanMeule Jun 91] the question was raised as to whether everything needed to create a metacircular interpreter (using combinators) has been given to the reader.

One of the last (if not the last) remaining items not yet presented is mutual recursion, which allows an interpreter’s eval and apply functions to do their curious tango (the “lambda lambada”?!?).

In this article, the derivation of a Y2 function will be shown. Y2 herein will be the sister combinator of Y, to be used for handling mutual recursion (of two functions) in the applicative order. The derivation of Y2 will be done in a similar manner as was done for deriving Y from pass-fact in [vanMeule May 92].

This exercise will hopefully give novel insights into Computer Science and the art of programming. (This is the stuff of Überprogrammers!) This exercise should also give the reader a much deeper understanding of Scheme while developing programming muscles in ways that conventional programming won’t.

## Backdrop and motivation

[vanMeule Jun 91] described the minimalist game. The minimalist game is an attempt to program in Scheme using only those features of Scheme that have more or less direct counterparts in l-calculus. The aim of the minimalist game is (among other things):

1) To understand l-calculus and what it has to say about Computer Science.

2) To develop expressive skills. Part of the theory behind the minimalist game is that one’s expressive ability is not so much posited in how many programming constructs one knows, but in how cleverly one wields them. Hence, by deliberately limiting oneself to a restricted set of constructs, one is forced to exercise one’s expressive muscles in ways they would not normally get exercised when one has a large repertoire of constructs to choose from. The maxim here is: “learn few constructs, but learn them well”.

In l-calculus (and hence the minimalist game) there is no recursion. It turns out that recursion is a rather impure contortion in many ways! However, recursion can be simulated by making use of the higher order nature of l-calculus. A higher order function is a function which is either passed as an argument (to another function) or returned as a value. As thrifty as l-calculus is, it does have higher order functions, which is no small thing as very few conventional languages have such a capability, and those that do have it have only a very weak version of it. (This is one of the programming lessons to be learned from playing the minimalist game: The enormous power of higher order functions and the losses conventional languages suffer from not having them.)

## Different kinds of recursion

As soon as a language has global functions or procedures and parameter passing provided via a stack discipline, you’ve got recursion! In fact, there is essentially no difference between a procedure calling itself or calling a different function-the same stack machinery that handles the one case will automatically handle the other. (There’s no need for the stack machinery to know nor care whether the user is calling other procedures or the same procedure.)

However, as soon as a language has local procedures, it makes a very big difference if a procedure calls itself! The problem is that when a local procedure sees a call to itself from within itself, by the rules of lexical scoping, it must look for its own definition outside of its own scope! This is because the symbol naming the recursive function is a free variable with respect to the context it occurs in.

```; 1
>>> (let ((local-fact
(lambda (n)
(if (zero? n)
1
(* n (local-fact (1- n)))))))
(local-fact 5))
```
```ERROR:  Undefined global variable
local-fact

Entering debugger.  Enter ? for help.
debug:>
```

This is where letrec comes in.

```; 2

>>> (letrec ((local-fact
(lambda (n)
(if (zero? n)
1
(* n (local-fact (1- n)))))))
(local-fact 5))
120
```

To understand what letrec is doing let’s translate it to its semantic equivalent. letrec can be simulated using let and set! [CR 91].

```; 3
>>> (let ((local-fact ‘undefined))
(begin
(set! local-fact
(lambda (n)
(if (zero? n)
1
(* n (local-fact (1- n))))))
(local-fact 5)))
120
```

Mutual recursion is slightly different from “regular” recursion: instead of a function calling itself, it calls a different function that then calls the original function. For instance, “foo” and “fido” would be mutually recursive if foo called fido, and fido called foo. The letrec trick will work fine for mutual recursion.

```; 4

>>> (let ((my-even? ‘undefined)
(my-odd? ‘undefined))
(begin
(set! my-even?
(lambda (n)
(if (zero? n)
#t
(my-odd? (1- n)))))
(set! my-odd?
(lambda (n)
(if (zero? n)
#f
(my-even? (1- n)))))
(my-even? 80)))
#t
```

The reason this works is because both functions that had to have mutual knowledge of each other were defined as symbols in a lexical context outside of the context in which the definitions were evaluated.

However, all the above letrec examples rely on being able to modify state. l-calculus doesn’t allow state to be modified. (An aside: since parallel machines have similar problems and restrictions in dealing with state, there is ample motivation for finding non-state oriented solutions to such problems in l-calculus.)

The recursion in local-fact can be ridded by using the Y combinator. However, in the my-even? and my-odd? example the Y trick doesn’t work because in trying to eliminate recursion using Y, the mutual nature of the functions causes us to get into a chicken-before-the-egg dilemma.

It’s clear we need a special kind of Y for this situation. Let’s call it Y2.

## The pass-fact trick

[vanMeule May 92] derived the Y combinator in the style of [Gabriel 88] by starting with pass-fact (a version of the factorial function which avoids recursion by passing its own definition as an argument) and massaging it into two parts: a recursionless recursion mechanism and an abstracted version of the factorial function.

Let’s try the same trick for Y2, using my-even? and my-odd? as our starting point.

First, we want to massage my-even? and my-odd? into something that looks like pass-fact. Here’s what our “template” looks like:

```; 5

>>> (define pass-fact
(lambda (f n)
(if (zero? n)
1
(* n (f f (1- n))))))
```
```pass-fact
>>> (pass-fact pass-fact 5)
120
```

Here’s a version of my-even? and my-odd? modeled after the pass-fact “template”.

```; 6
>>> (define even-odd
(cons
(lambda (function-list)
(lambda (n)
(if (zero? n)
#t
(((cdr function-list) function-list)
(1- n)))))
(lambda (function-list)
(lambda (n)
(if (zero? n)
#f
(((car function-list) function-list)
(1- n)))))))
even-odd
>>> (define pass-even?
((car even-odd) even-odd))
pass-even?
>>> (define pass-odd?
((cdr even-odd) even-odd))
pass-odd?
>>> (pass-even? 8)
#t
```

## This could derive one crazy!

Now that we know we can use higher order functions to get rid of the mutual recursion in my-even? and my-odd? the next step is to massage out the recursionless mutual recursion mechanism from the definitional parts that came from my-even? and my-odd?. The following is the code of such a derivation, including test cases and comments.

```; 7
(define my-even?
(lambda (n)
(if (zero? n)
#t
(my-odd? (1- n)))))
;
(define my-odd?
(lambda (n)
(if (zero? n)
#f
(my-even? (1- n)))))
;
(my-even? 5)
;
; Get out of global environment-use local environment.
;
(define mutual-even?
(letrec
((my-even? (lambda (n)
(if (zero? n)
#t
(my-odd? (1- n)))))
(my-odd? (lambda (n)
(if (zero? n)
#f
(my-even? (1- n))))))
my-even?))
;
(mutual-even? 5)
;
; Get rid of destructive letrec.  Use let instead.
; Make a list of the mutually recursive functions.
;
(define mutual-even?
(lambda (n)
(let
((function-list
(cons (lambda (functions n) ; even?
(if (zero? n)
#t
((cdr functions) functions
(1- n))))
(lambda (functions n) ; odd?
(if (zero? n)
#f
((car functions) functions
(1- n)))))))
((car function-list) function-list n))))
;
(mutual-even? 5)
;
; Curry, and get rid of initial (lambda (n) ...) .
;
(define mutual-even?
(let
((function-list
(cons (lambda (functions) ; even?
(lambda (n)
(if (zero? n)
#t
(((cdr functions) functions)
(1- n)))))
(lambda (functions) ; odd?
(lambda (n)
(if (zero? n)
#f
(((car functions) functions)
(1- n))))))))
((car function-list) function-list)))
;
(mutual-even? 5)
;
; Abstract ((cdr functions) functions) out of if, etc..
;
(define mutual-even?
(let
((function-list
(cons (lambda (functions)
(lambda (n)
((lambda (f)
(if (zero? n)
#t
(f (1- n))))
((cdr functions) functions))))
(lambda (functions)
(lambda (n)
((lambda (f)
(if (zero? n)
#f
(f (1- n))))
((car functions) functions)))))))
((car function-list) function-list)))
;
(mutual-even? 5)
;
; Massage functions into abstracted versions of
; originals.
;
(define mutual-even?
(let
((function-list
(cons (lambda (functions)
(lambda (n)
(((lambda (f)
(lambda (n)
(if (zero? n)
#t
(f (1- n)))))
((cdr functions) functions))
n)))
(lambda (functions)
(lambda (n)
(((lambda (f)
(lambda (n)
(if (zero? n)
#f
(f (1- n)))))
((car functions) functions))
n))))))
((car function-list) function-list)))
;
(mutual-even? 5)
;
; Separate abstracted functions out from recursive
; mechanism.
;
(define mutual-even?
(let
((abstracted-functions
(cons (lambda (f)
(lambda (n)
(if (zero? n)
#t
(f (1- n)))))
(lambda (f)
(lambda (n)
(if (zero? n)
#f
(f (1- n))))))))
(let
((function-list
(cons (lambda (functions)
(lambda (n)
(((car abstracted-functions)
((cdr functions) functions))
n)))
(lambda (functions)
(lambda (n)
(((cdr abstracted-functions)
((car functions) functions))
n))))))
((car function-list) function-list))))
;
(mutual-even? 5)
;
; Abstract out variable abstracted-functions in 2nd let.
;
(define mutual-even?
(let
((abstracted-functions
(cons (lambda (f)
(lambda (n)
(if (zero? n)
#t
(f (1- n)))))
(lambda (f)
(lambda (n)
(if (zero? n)
#f
(f (1- n))))))))
((lambda (abstracted-functions)
(let
((function-list
(cons (lambda (functions)
(lambda (n)
(((car abstracted-functions)
((cdr functions) functions))
n)))
(lambda (functions)
(lambda (n)
(((cdr abstracted-functions)
((car functions) functions))
n))))))
((car function-list) function-list)))
abstracted-functions)))
;
(mutual-even? 5)
;
; Separate recursion mechanism into separate function.
;
(define y2
(lambda (abstracted-functions)
(let
((function-list
(cons (lambda (functions)
(lambda (n)
(((car abstracted-functions)
((cdr functions) functions))
n)))
(lambda (functions)
(lambda (n)
(((cdr abstracted-functions)
((car functions) functions))
n))))))
((car function-list) function-list))))
;
(define mutual-even?
(y2
(cons (lambda (f)
(lambda (n)
(if (zero? n)
#t
(f (1- n)))))
(lambda (f)
(lambda (n)
(if (zero? n)
#f
(f (1- n))))))))
;
(mutual-even? 5)
;
; y2 has selector built into it-generalize it!
;
(define y2-choose
(lambda (abstracted-functions)
(lambda (selector)
(let
((function-list
(cons (lambda (functions)
(lambda (n)
(((car abstracted-functions)
((cdr functions) functions))
n)))
(lambda (functions)
(lambda (n)
(((cdr abstracted-functions)
((car functions) functions))
n))))))
((selector function-list) function-list)))))
;
; Now we can achieve the desired result-defining
; both mutual-even? and mutual-odd? without recursion.
;
(define mutual-even-odd?
(y2-choose
(cons (lambda (f)
(lambda (n)
(if (zero? n)
#t
(f (1- n)))))
(lambda (f)
(lambda (n)
(if (zero? n)
#f
(f (1- n))))))))
;
(define mutual-even?
(mutual-even-odd? car))
;
(define mutual-odd?
(mutual-even-odd? cdr))
;
(mutual-even? 5)
(mutual-odd? 5)
(mutual-even? 4)
(mutual-odd? 4)
```

## Deriving Mutual Satisfaction

Notice that mutual-even? and mutual-odd? could have been defined using y2 instead of y2-choose, however, the definitional bodies of my-even? and my-odd? would have been repeated in defining mutual-even? and mutual-odd?.

• Herein Y2 was derived from mutual-even?. Try deriving it instead from pass-even?.

• Question for the Überprogrammer: if evaluation were normal order rather than applicative order, could we use the same version of Y for mutually recursive functions that we used for “regular” recursive functions (thus making a Y2 function unnecessary)?

• Another question: Let’s say we have 3 or more functions which are mutually recursive. What do we need to handle this situation when evaluation is applicative order? What about in normal order? (Note: evaluation in l-calculus is normal order.)

Creating a “minimalist” (i.e., combinator based) metacircular interpreter might now be possible if we can tackle the problem of manipulating state!

## Thanks to:

The local great horned owls that watch over everything from on high; regularly letting fellow “night owls” know that all is well by bellowing their calming, reassuring “Who-w-h-o-o” sounds.

Bugs/infelicities due to: burning too much midnite oil!

## Bibliography and References

[CR 91] William Clinger and Jonathan Rees (editors). “Revised4 Report on the Algorithmic Language Scheme”, LISP Pointers, SIGPLAN Special Interest Publication on LISP, Volume IV, Number 3, July-September, 1991. ACM Press.

[Gabriel 88] Richard P. Gabriel. “The Why of Y”, LISP Pointers, Vol. II, Number 2, October-November-December, 1988.

[vanMeule May 91] André van Meulebrouck. “A Calculus for the Algebraic-like Manipulation of Computer Code” (Lambda Calculus), MacTutor, Anaheim, CA, May 1991.

[vanMeule Jun 91] André van Meulebrouck. “Going Back to Church” (Church numerals.), MacTutor, Anaheim, CA, June 1991.

[vanMeule May 92] André van Meulebrouck. “Deriving Miss Daze Y”, (Deriving Y), MacTutor, Los Angeles, CA, April/May 1992.

Community Search:
MacTech Search:

## Latest Forum Discussions

Top Mobile Game Discounts
Every day, we pick out a curated list of the best mobile discounts on the App Store and post them here. This list won't be comprehensive, but it every game on it is recommended. Feel free to check out the coverage we did on them in the links... | Read more »
Blue Archive heads for nature in New Yea...
Continuing the Blue Archive trend of releasing seasonal events to the Western version of the game nowhere near when they actually happened, the Cyber New Year March update has arrived. It brings with it a story centring around New Year, which it... | Read more »
Once Human conquers maths to be one hotl...
It feels like Once Human has been in development for about ten years at this point, but that has clearly not blunted the excitement for NetEases’ upcoming open-world survival game. As a matter of fact, it seems things have never been better, as... | Read more »
Watcher of Realms celebrates its first a...
It has been one year since Moonton Games kicked off the fantasy RPG Watcher of Realms, and there are a lot of celebrations to mark the occasion. You could take part in a brand-new mode, earn some skins, and recruit some of the strongest characters... | Read more »
Tarisland finally launches and celebrate...
It has felt like a lifetime, as it always does when it comes to waiting, but now Level Infinites’ anticipated MMORPG Tarisland is available across mobiles and Windows. It is time to pick your favourite of the nine classes, customise them to your... | Read more »
Reverse: 1999 offer Reality teams a mout...
Bluepoch Games has confirmed that Phase 2 of Reverse:1999s Version 1.6 has launched, and brings with it a lot to get your teeth into. Along with some sign-in rewards and a bunch of stories to enjoy, as well as a new 6-star character who just might... | Read more »
Uncharted Waters Origin unveils its late...
LINE Games, Motif, and KOEI Tecmo have announced the latest raft of updates for their seafaring adventure title Uncharted Waters Origin, and if you've played for a while you know what to expect. A new Admiral, new mates, and some new story, the... | Read more »
Wrecking Golf is a casual physics-based...
In case you missed it, Dusan Popovic has officially launched Wrecking Golf on iOS and Android, the indie developer's casual golf game on mobile presented with charming pixel-art visuals. Featuring physics-based mechanics and simple controls, the... | Read more »
Blue Archive is striking out to Anime Ex...
At this point in my writing career, I have seen quite a few press releases come about, and it feels like one of the most frequently updated games there is Blue Archive. It is, of course, great to see a game have a life like this, and now Nexon is... | Read more »
Grab a Grammy-inspired Backbone One with...
There are so many mobile controllers on the market that it could be a little difficult to know which to go for. If you are someone who goes for a good old celebrity endorsement, however, then the new Backbone One might be for you, created as it... | Read more »

## Price Scanner via MacPrices.net

Walmart continues to sell clearance 13-inch M...
Walmart continues to offer clearance, but new, Apple 13″ M1 MacBook Airs (8GB RAM, 256GB SSD) online for \$699, \$300 off original MSRP, in Space Gray, Silver, and Gold colors. These are new MacBooks... Read more
Apple is offering steep discounts, up to \$600...
Apple has standard-configuration 16″ M3 Max MacBook Pros available, Certified Refurbished, starting at \$2969 and ranging up to \$600 off MSRP. Each model features a new outer case, shipping is free,... Read more
Save up to \$480 with these 14-inch M3 Pro/M3...
Apple has 14″ M3 Pro and M3 Max MacBook Pros in stock today and available, Certified Refurbished, starting at \$1699 and ranging up to \$480 off MSRP. Each model features a new outer case, shipping is... Read more
Amazon has clearance 9th-generation WiFi iPad...
Amazon has Apple’s 9th generation 10.2″ WiFi iPads on sale for \$80-\$100 off MSRP, starting only \$249. Their prices are the lowest available for new iPads anywhere: – 10″ 64GB WiFi iPad (Space Gray or... Read more
Apple is offering a \$50 discount on 2nd-gener...
Apple has Certified Refurbished White and Midnight HomePods available for \$249, Certified Refurbished. That’s \$50 off MSRP and the lowest price currently available for a full-size Apple HomePod today... Read more
The latest MacBook Pro sale at Amazon: 16-inc...
Amazon is offering instant discounts on 16″ M3 Pro and 16″ M3 Max MacBook Pros ranging up to \$400 off MSRP as part of their early July 4th sale. Shipping is free. These are the lowest prices... Read more
14-inch M3 Pro MacBook Pros with 36GB of RAM...
B&H Photo has 14″ M3 Pro MacBook Pros with 36GB of RAM and 512GB or 1TB SSDs in stock today and on sale for \$200 off Apple’s MSRP, each including free 1-2 day shipping: – 14″ M3 Pro MacBook Pro (... Read more
14-inch M3 MacBook Pros with 16GB of RAM on s...
B&H Photo has 14″ M3 MacBook Pros with 16GB of RAM and 512GB or 1TB SSDs in stock today and on sale for \$150-\$200 off Apple’s MSRP, each including free 1-2 day shipping: – 14″ M3 MacBook Pro (... Read more
Amazon is offering \$170-\$200 discounts on new...
Amazon is offering a \$170-\$200 discount on every configuration and color of Apple’s M3-powered 15″ MacBook Airs. Prices start at \$1129 for models with 8GB of RAM and 256GB of storage: – 15″ M3... Read more
Amazon is offering a \$200 discount on 14″ M3...
Amazon has 14-inch M3 MacBook Pros in stock and on sale for \$150-\$200 off MSRP. Shipping is free. Note that Amazon’s stock tends to come and go, so be sure to check their site often if the model you... Read more

## Jobs Board

Solutions Engineer - *Apple* - SHI (United...
**Job Summary** An Apple Solution Engineer's primary role is tosupport SHI customers in their efforts to select, deploy, and manage Apple operating systems and Read more
*Apple* / Mac Administrator - JAMF Pro - Ame...
Amentum is seeking an ** Apple / Mac Administrator - JAMF Pro** to provide support with the Apple Ecosystem to include hardware and software to join our team and Read more
Operations Associate - *Apple* Blossom Mall...
Operations Associate - Apple Blossom Mall Location:Winchester, VA, United States (https://jobs.jcp.com/jobs/location/191170/winchester-va-united-states) - Apple Read more
Cashier - *Apple* Blossom Mall - JCPenney (...
Cashier - Apple Blossom Mall Location:Winchester, VA, United States (https://jobs.jcp.com/jobs/location/191170/winchester-va-united-states) - Apple Blossom Mall Read more
Omnichannel Associate - *Apple* Blossom Mal...
Omnichannel Associate - Apple Blossom Mall Location:Winchester, VA, United States (https://jobs.jcp.com/jobs/location/191170/winchester-va-united-states) - Apple Read more