2-As_prover.Let_syntaxinclude Monad_let.Base_syntax2
with type ('a, 'e) t := ( 'a, Backend.Field.t ) tinclude Core_kernel.Monad.Infix2
with type ('a, 'e) t := ( 'a, Backend.Field.t ) tval (>>=) :
( 'a, Backend.Field.t ) t ->
( 'a -> ( 'b, Backend.Field.t ) t ) ->
( 'b, Backend.Field.t ) tval (>>|) :
( 'a, Backend.Field.t ) t ->
( 'a -> 'b ) ->
( 'b, Backend.Field.t ) tinclude Monad_let.Let_syntax2 with type ('a, 'e) t := ( 'a, Backend.Field.t ) tval return : 'a -> ( 'a, Backend.Field.t ) tval bind :
( 'a, Backend.Field.t ) t ->
f:( 'a -> ( 'b, Backend.Field.t ) t ) ->
( 'b, Backend.Field.t ) tval map :
( 'a, Backend.Field.t ) t ->
f:( 'a -> 'b ) ->
( 'b, Backend.Field.t ) tval both :
( 'a, Backend.Field.t ) t ->
( 'b, Backend.Field.t ) t ->
( 'a * 'b, Backend.Field.t ) tmodule Open_on_rhs : sig ... endmodule Let_syntax :
Monad_let.Let_syntax2 with type ('a, 'e) t := ( 'a, Backend.Field.t ) t