From e9554f919b7a6a4d4ea63b1274dc03fcf975acc9 Mon Sep 17 00:00:00 2001 From: Jakub Jankiewicz Date: Tue, 27 Feb 2024 20:40:26 +0100 Subject: [PATCH] inner linking --- docs/docs/scheme-intro/streams.md | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/docs/docs/scheme-intro/streams.md b/docs/docs/scheme-intro/streams.md index 16cfbe00d..a77100a5d 100644 --- a/docs/docs/scheme-intro/streams.md +++ b/docs/docs/scheme-intro/streams.md @@ -13,7 +13,8 @@ The base of those data structures are two expressions `delay` and `force`. The result of delay is often called a Promise. -To create a lazy pair you use cons with first element (`car`) and the rest (`cdr`) is a delay expression: +To create a lazy pair you use cons with first element (`car`) and the rest (`cdr`) is a delay +expression: ```scheme (define s (cons 1 (delay 2))) @@ -47,7 +48,7 @@ Lets define some helper procedures: `(cons ,x (delay ,y))) ``` -This is lazy version of cons that utilize lisp macro. +This is lazy version of cons that utilize [lisp macro](/docs/scheme-intro/macros). You can also define `car` and `cdr` versions that work with streams: