Operations:

fun satisfy
ctl fail
ctl pick
fun current-input
fun satisfystd/text/parse/satisfy: forall<a> (pred : (sslice) -> maybe<(a, sslice)>) -> parse maybe<a>
ctl failstd/text/parse/fail: forall<a> (msg : string) -> parse a
ctl pickstd/text/parse/pick: () -> parse bool
fun current-inputstd/text/parse/current-input: () -> parse sslice

Call the fun current-inputstd/text/parse/current-input: () -> parse sslice operation of the effect parsestd/text/parse/parse: (E, V) -> V.

Call the ctl failstd/text/parse/fail: forall<a> (msg : string) -> parse a operation of the effect parsestd/text/parse/parse: (E, V) -> V.

The manystd/text/parse/many: forall<a,e> (p : parser<e,a>) -> <parse|e> list<a> combinator parses p until it fails, returning a list of the results of p. The manystd/text/parse/many: forall<a,e> (p : parser<e,a>) -> <parse|e> list<a> combinator is non-divergent only when p always consumes input or failstd/text/parse/fail: forall<a> (msg : string) -> parse as.

The many1std/text/parse/many1: forall<a,e> (p : parser<e,a>) -> <parse|e> list<a> combinator parses p at least once an then until it fails, returning a list of the results of p. The many1std/text/parse/many1: forall<a,e> (p : parser<e,a>) -> <parse|e> list<a> combinator is non-divergent only when p always consumes input or failstd/text/parse/fail: forall<a> (msg : string) -> parse as.

Call the ctl pickstd/text/parse/pick: () -> parse bool operation of the effect parsestd/text/parse/parse: (E, V) -> V.

Call the fun satisfystd/text/parse/satisfy: forall<a> (pred : (sslice) -> maybe<(a, sslice)>) -> parse maybe<a> operation of the effect parsestd/text/parse/parse: (E, V) -> V.