How to make these dynamically typed functions type-safe? [closed]

Answer 1

I found a Haskell solution for #1 using Rank-N-Types (just for GHCi)

{-# LANGUAGE RankNTypes #-}
apply :: (forall a . a -> r) -> r
apply x = x x

apply $ const 42 -- Yields 42

Answer 2

When it comes to example #1, you would have to specify the return type of Apply(), and then all functions x that you pass also must return this. Most statically typed languages would not be able to do that safely without checks, as the x function you pass in can return whatever.

In example #2 the type of the iterator objects are that they are iterators. If you mean what they return, they return iterators. I don't see why that wouldn't be possible in a static system, but maybe I'm missing something.

Answer 3

1# This is not typeable with a finite type. This means that very few (if any) programming languages will be able to type this.

However, as you have demonstrated, there is a specific type for x that allows the function to be typed:

x :: t -> B

Where B is some concrete type. This results in apply being typed as:

apply :: (t -> B) -> B

Note that Hindley-Milner will not derive this type.

2# This is easy to represent in Haskell (left as an exercise to the reader...)