William Rusnack

I'm interested in this as well. It seems like the only reliable way to do this is to triangulate the polygon and then check for triangle intersections.

@Lemmih I have created a lot of QuickCheck Arbitrary instances for polygons that may be helpful https://bitbucket.org/william_rusnack/geometry-2d/src/master/src/PolylineArbitrary.hs

Let me know if you have any questions. I have most of the development sketched out in a paper notebook so if you need I can scan those and add...

can this be closed?

2 things First, I think it should default to sending an error if the path is not found instead of printing to screen. If you do not want it validated...

I do not.

`httpSink` uses Sink which is being [deprecated](https://hackage.haskell.org/package/conduit/docs/Data-Conduit.html#t:Sink)

then httpSink docs should be updated http://hackage.haskell.org/package/http-conduit-2.3.7.1/docs/Network-HTTP-Simple.html#v:httpSink

#82

Sure ```text arg :: KnownSymbol name => (x -> ProgramT p m a) -> ProgramT (Arg name x & p) m a someCommand someArgument ^^^arg value^^^ opt :: (KnownSymbol option,...