A categorical programming language
修订版 | a7b8dbad178781d7aae098c63cbce4942ccdca0e (tree) |
---|---|
时间 | 2021-11-13 14:38:58 |
作者 | Corbin <cds@corb...> |
Commiter | Corbin |
Implement bounded unfolds.
@@ -0,0 +1 @@ | ||
1 | +(comp (pair @0 @1) fun/app) |
@@ -0,0 +1,7 @@ | ||
1 | +(pr | |
2 | + (fun/name (pair fst (fun/const nil))) | |
3 | + (curry (comp | |
4 | + (pair fun/app (comp snd snd)) | |
5 | + (pair | |
6 | + (fun/apppair snd (comp fst fst)) | |
7 | + (comp fst cons))))) |