2 ms·
Another intriguing approach in the same family as ILP and GP is some recent work on just doing exhaustive search, but over heavily type-constrained Haskell code
by _delirium 15y ago
Another intriguing approach in the same family as ILP and GP is some recent work on just doing exhaustive search, but over heavily type-constrained Haskell code, with the semantic information being used to greatly narrow the search space: http://nautilus.cs.miyazaki-u.ac.jp/~skata/MagicHaskeller.html http://nautilus.cs.miyazaki-u.ac.jp/~skata/MagicHaskeller.ht...
and paper: http://nautilus.cs.miyazaki-u.ac.jp/~skata/skatayama_pricai2008.pdf http://nautilus.cs.miyazaki-u.ac.jp/~skata/skatayama_pricai2...