In scala I am wondering if there is a way I can define a new type including itself For example type A = Tuple(e1: Int, e2: A) Ofcourse type A = List[A] is illegal so is there another way to do thi...

Consider I have a tuple of tuples: type Example = [[3,5,7], [4,9], [0,1,10,9]]; I want to create an utility type Flatten<T> such that Flatten<Example> gives: type FlatExample = Flatten...

I am currently working on a simple interpreter for a programming language and I have a data type like this: data Expr = Variable String | Number Int | Add [Expr] | Sub Expr Expr And I have m...

My original problem is this. I made the following type but it does not work due to the circular references error and I don't know how to solve it: type Increment<T extends number, Tuple extend...

Here is a data structure I can write down and which is accepted by the Rust compiler: pub struct Pair<S, T>(S, T); pub enum List<T> { Nil, Cons(T, Box<List<Pair<i32, ...

I have functions that represent steps in a process. Each function also knows the next step, if there is one. I'd like to be able to do something like: fun fooStep() : Step? { ... do something ......

I have a situation where I need a method that can take in types: Array[Int] Array[Array[Int]] Array[Array[Array[Int]]] Array[Array[Array[Array[Int]]]] etc... let's call this type RAI for "recurs...

This is a purely academic question, but riffing off of this question about type constraints. The questioner gave this as an example: type Something<'a, 'b when 'b :> seq<'b>>() = m...