@@ -28,31 +28,31 @@ This library provides a minimal yet powerful implementation of Lisp's symbolic e
2828Deno
2929
3030``` sh
31- deno add jsr:@ts/ expression
31+ deno add jsr:@lambda/ts- expression
3232```
3333
3434Node.js (npx)
3535
3636``` sh
37- npx jsr add @ts/ expression
37+ npx jsr add @lambda/ts- expression
3838```
3939
4040Bun
4141
4242``` sh
43- bunx jsr add @ts/ expression
43+ bunx jsr add @lambda/ts- expression
4444```
4545
4646pnpm
4747
4848``` sh
49- pnpm dlx jsr add @ts/ expression
49+ pnpm dlx jsr add @lambda/ts- expression
5050```
5151
5252Yarn
5353
5454``` sh
55- yarn dlx jsr add @ts/ expression
55+ yarn dlx jsr add @lambda/ts- expression
5656```
5757
5858## Examples
@@ -92,7 +92,7 @@ calculateDistance(makePoint(-2, -3), makePoint(-4, 4)); // ≈ 7.28
9292### Building a Binary Tree
9393
9494``` ts
95- import { cons , car , cdr } from " @ts/ expression" ;
95+ import { cons , car , cdr } from " @lambda/ts- expression" ;
9696
9797const leaf = <T >(value : T ) => cons (value , cons (null , null ));
9898
@@ -113,7 +113,7 @@ car(car(cdr(tree))); // "left"
113113### File System path representation
114114
115115``` ts
116- import { cons , car , cdr } from " @ts/ expression" ;
116+ import { cons , car , cdr } from " @lambda/ts- expression" ;
117117
118118const node = <A , B >(a : A , b : B ) => cons (a , b );
119119
0 commit comments