mirror of
https://github.com/HigherOrderCO/Kind.git
synced 2024-09-11 19:47:15 +03:00
85ad65b026
Now, there are two local binders: let x = ... use x = ... The 'let' binder will create a local definition, type-check it, and assign a name to it. When compiled, it will create 'dup' nodes. The 'use' binder is just an alias. It will not bind a new variable, and, when compiled, will create inline copies. Also, for type-checking, it allows creating aliases that are definitionaly equal for the checker.
14 lines
317 B
Plaintext
14 lines
317 B
Plaintext
Kind.reduce.txt
|
|
: ∀(txt: Kind.Text) Kind.Term
|
|
= λtxt
|
|
use P = λx Kind.Term
|
|
use cons = λx λxs
|
|
(Kind.reduce
|
|
Bool.true
|
|
(Kind.app
|
|
(Kind.app Kind.Book.String.cons (Kind.num x))
|
|
(Kind.txt xs)
|
|
)
|
|
)
|
|
use nil = (Kind.reduce Bool.true Kind.Book.String.nil)
|
|
(~txt P cons nil) |