User loginNavigation 
Type BombsPeople like blowing stuff up, explosions are great! I started wondering about type bombs, small expressions which have large type terms. Is there anything known about that, in particular for Haskell/ML since these are popular? The small bomb I know of employs 'dup' and is relatively well known. I.e., take `dup`
The repeated application gives back a type term which grows exponentially in the size of the expression.
(It depends on the type checker, of course, whether the type actually is represented exponentially.) You can lift `dup` further but can you grow faster? I tried `let t = (\f > f . f) in let d = (\x > (x,x)) in (t.t.t.t) d 0` which doesn't type check in ghci as a first order approximation. But I thought I would ask you, people. What is the fastest growing type term you can come up with? Or what term will keep a type checker really, really busy? By marco at 20180428 00:31  LtU Forum  previous forum topic  next forum topic  other blogs  3497 reads

Browse archivesActive forum topics 
Recent comments
1 hour 23 min ago
11 hours 49 min ago
13 hours 3 min ago
1 day 12 hours ago
1 day 15 hours ago
1 day 16 hours ago
1 day 16 hours ago
1 day 18 hours ago
1 day 21 hours ago
1 day 22 hours ago