Hi, Assuming that Type:Type (or *:*) in dependently typed languages is said to be inconsistent (Girard's paradox?). Does that mean that it is possible to define a Y combinator in such a language? Thanks, Edsko