tricu/demos/size.tri

!module Size

!import "lib/base.tri" Lib

main = size size

compose = \f g x : f (g x)

succ = Lib.y (\self :
  Lib.triage
    1
    t
    (Lib.triage
      (t (t t))
      (\_ Lib.tail : t t (self Lib.tail))
      t))

size = (\x :
  (Lib.y (\self x :
    compose succ
      (Lib.triage
        (\x : x)
        self
        (\x y : compose (self x) (self y))
        x)) x 0))
# Modules Basic implementation of a module system including tests. 2025-01-27 16:04:04 -06:00			`!module Size`

			`!import "lib/base.tri" Lib`

# File eval mode now relies on main function To encourage organizing code in a way that helps in understanding, I have implemented the common idiom of requiring a `main` function. In tricu and other functional languages, it is usually placed near the top of the module. The evaluator gracefully handles the situation of passing multiple files where the intermediary "library" files do not have main functions. 2025-01-26 15:33:12 -06:00			`main = size size`

Allow lambda expressions without explicit paren 2025-01-26 08:52:28 -06:00			`compose = \f g x : f (g x)`
Add size demo 2025-01-23 18:57:59 -06:00
# Modules Basic implementation of a module system including tests. 2025-01-27 16:04:04 -06:00			`succ = Lib.y (\self :`
			`Lib.triage`
Definition dependency analysis tricu now allows defining terms in any order and will resolve dependencies to ensure that they're evaluated in the right order. Undefined terms are detected and throw errors during dependency ordering. For now we can't define top-level mutually recursive terms. 2025-01-26 14:50:15 -06:00			`1`
			`t`
# Modules Basic implementation of a module system including tests. 2025-01-27 16:04:04 -06:00			`(Lib.triage`
Definition dependency analysis tricu now allows defining terms in any order and will resolve dependencies to ensure that they're evaluated in the right order. Undefined terms are detected and throw errors during dependency ordering. For now we can't define top-level mutually recursive terms. 2025-01-26 14:50:15 -06:00			`(t (t t))`
# Modules Basic implementation of a module system including tests. 2025-01-27 16:04:04 -06:00			`(\_ Lib.tail : t t (self Lib.tail))`
Add size demo 2025-01-23 18:57:59 -06:00			`t))`

Definition dependency analysis tricu now allows defining terms in any order and will resolve dependencies to ensure that they're evaluated in the right order. Undefined terms are detected and throw errors during dependency ordering. For now we can't define top-level mutually recursive terms. 2025-01-26 14:50:15 -06:00			`size = (\x :`
# Modules Basic implementation of a module system including tests. 2025-01-27 16:04:04 -06:00			`(Lib.y (\self x :`
Definition dependency analysis tricu now allows defining terms in any order and will resolve dependencies to ensure that they're evaluated in the right order. Undefined terms are detected and throw errors during dependency ordering. For now we can't define top-level mutually recursive terms. 2025-01-26 14:50:15 -06:00			`compose succ`
# Modules Basic implementation of a module system including tests. 2025-01-27 16:04:04 -06:00			`(Lib.triage`
Definition dependency analysis tricu now allows defining terms in any order and will resolve dependencies to ensure that they're evaluated in the right order. Undefined terms are detected and throw errors during dependency ordering. For now we can't define top-level mutually recursive terms. 2025-01-26 14:50:15 -06:00			`(\x : x)`
			`self`
			`(\x y : compose (self x) (self y))`
Add size demo 2025-01-23 18:57:59 -06:00			`x)) x 0))`