Lilac [she/her]

  • 1 Post
  • 3 Comments
Joined 3 years ago
Cake day: March 23rd, 2022
  • Lilac [she/her]@lemmygrad.mltoMemes@lemmy.ml•6÷2(1+2)
    1·
    11 months ago

    Kinda. You can’t define a name, but you can get the compiler to interpret literals as a function. If you have a Num instance for (Integer -> Integer) where,

    fromInteger i = \x -> x * i

    the compiler can interpret integer literals as functions like so

    x = 2(5) :: Integer

  • Lilac [she/her]@lemmygrad.mltoRust Programming@lemmy.ml•Are there other languages that rust where enums can store data?
    6·
    2 years ago

    Typed functional languages usually do, as mentioned by others. This is form of Algebraic Data Type called a Sum Type (as oppose to a Product type, which is basically a normal struct).

    Here’s some examples of creating a binary tree in different languages (also Lemmy’s code formatter is terrible)

    Examples

    Haskell

    data Tree a = Empty | Leaf a | Node (Tree a) (Tree a)

    F#

    type Tree<'a> = Empty | Leaf of 'a | Node of (Tree<'a> * Tree<'a>)

    Scala

    sealed trait Tree[+A]

    case class Empty[A]() extends Tree[A]

    case class Leaf[A](a: A) extends Tree[A]

    case class Node[A](left: Tree[A], right: Tree[A]) extends Tree[A]

    Rust

    enum Tree<T> {

    ​ Empty,

    ​ Leaf(T),

    ​ Node(Box<Tree<T>>, Box<Tree<T>>),

    }