Resources for writing a parser combinator library

This one is in Haskell (which is Lazy), but has some nice ideas:

http://eprints.nottingham.ac.uk/237/1/monparsing.pdf

The Boost.Spirit website has very nice ideas about implementing parser combinators too. Boost.Spirit uses Boost.Phoenix extensively, which is a library of lazy containers (so it's effectively lazy code too):

http://boost-spirit.com/home/

I was working on a simple parser combinator library in C++. I think the following functions are all you really need as a foundation for a library. I couldn't quickly tell if Julia has anything like generics but it will be very helpful if it does.

template<typename R, typename U>
auto Zero() -> ParserType(R, U)
{
    return [] (State<U> state) -> Result<R>
    {
        return Result<R>();
    };
}

template<typename R, typename U>
auto Return(R value) -> ParserType(R, U)
{
    return [value] (State<U> state) -> Result<R>
    {
        return Result<R>(value);
    };
}

template<typename R1, typename R2, typename U>
auto Bind(
    function<Result<R1>(State<U>)> parser,
    function<function<Result<R2>(State<U>)>(R1)> continuation
    ) -> ParserType(R2, U)
{
    return [parser, continuation] (State<U> state) -> Result<R2>
    {
        auto r = parser(state);
        if (r.Code == ResultCode::Failure)
            return Result<R2>();
        return continuation(r.Value)(state);
    };
}