1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.


Haskell is also a very good programming language for AI. Lazy evaluation and the list and LogicT monads make it easy to express non-deterministic algorithms, which is often the case. Infinite data structures are great for search trees. The language's features enable a compositional way of expressing the algorithms. The only drawback is that working with graphs is a bit harder at first because of purity.

Sort By:
Replies Views
Last Message ↓
  1. There are no threads to display.

Thread Display Options