From 9b8c46e11ac824439611c6b666e6273562171f73 Mon Sep 17 00:00:00 2001 From: jim Date: Tue, 24 Mar 2015 13:40:37 -0400 Subject: [PATCH 1/1] T combinator --- topics/week7_untyped_evaluator.mdwn | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/topics/week7_untyped_evaluator.mdwn b/topics/week7_untyped_evaluator.mdwn index ecf5fcb0..683a0fd1 100644 --- a/topics/week7_untyped_evaluator.mdwn +++ b/topics/week7_untyped_evaluator.mdwn @@ -475,7 +475,7 @@ Here is some more sample inputs, each of which the parser is happy with: /* note that it's not f x (g y) (h z) */ "strings" /* you can input these and pass them around, but can't perform any operations on them */ -Predefined combinators include: `S`, `K` (same as `const`), `I` (same as `id`), `B` (same as `(o)`, occurring in prefix not infix position), `C` (same as `flip`), `T`, `V` (the Church pairing combinator), `W`, `M` (better known as `ω`), and `L`. +Predefined combinators include: `S`, `K` (same as `const`), `I` (same as `id`), `B` (same as `(o)`, occurring in prefix not infix position), `C` (same as `flip`), `T` (same as `flip ($)`), `V` (the Church pairing combinator), `W`, `M` (better known as `ω`), and `L`. The parser also accepts `letrec ... in ...` terms, but currently there is no implementation for how to reduce/interpret these (that's for a later assignment), so you'll just get an error. -- 2.11.0