Creating a hierarchical anonymous type

Question

Is there a way to create an anonymous type that references instances of itself?

var root = new { Name = "Root", Parent = ??? };
var child = new { Name = "Child", Parent = root };
var childOfChild = new { Name = "Grand child", Parent = child };

For example, we can refer to a delegate on our own:

Action run = null;
run = () => run();

Another example: we can create a common stack of anonymous types:

static Stack<T> CreateStack<T>(params T[] values)
{
    var stack = new Stack<T>();

    foreach (var value in values)
        stack.Add(value);

    return stack;
}

Can you come up with any ways to refer to the anonymous type from yourself?

Answer 1

It seemed that the C # compiler would simply refuse to infer the type recursively. Take this sample code, for example:

(From @Eric: That's right, type inference requires that all “input” lambda types are known before the lambda output type is output)

public void Run()
{
  var k = Generator((str, parent) => new {
    Name = str,
    Parent = parent
  });
}

public Func<string, T, T> Generator<T>(Func<string, T, T> generator)
{
  return (str, obj) => generator(str, obj);
}

, <T> Generator<T>... , , .

Answer 2

# . . , #.

VB ; , , VB.

, , , , . , , , . , !

, . - , .