Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- pconst :: forall (a :: S -> Type) (b :: S -> Type) (s :: S). Term s (a :--> (b :--> a))
- pidentity :: forall (a :: S -> Type) (s :: S). Term s (a :--> a)
- papply :: forall (a :: S -> Type) (b :: S -> Type) (s :: S). Term s ((a :--> b) :--> (a :--> b))
- pon :: forall (a :: S -> Type) (b :: S -> Type) (c :: S -> Type) (s :: S). Term s ((b :--> (b :--> c)) :--> ((a :--> b) :--> (a :--> (a :--> c))))
- pbuiltinUncurry :: forall (a :: S -> Type) (b :: S -> Type) (c :: S -> Type) (s :: S). (PIsData a, PIsData b) => (Term s a -> Term s b -> Term s c) -> Term s (PBuiltinPair (PAsData a) (PAsData b)) -> Term s c
- pflip :: forall (a :: S -> Type) (b :: S -> Type) (c :: S -> Type) (s :: S). Term s ((a :--> (b :--> c)) :--> (b :--> (a :--> c)))
- (#.*) :: forall (d :: S -> Type) (c :: S -> Type) (b :: S -> Type) (a :: S -> Type) (s :: S). Term s (c :--> d) -> Term s (a :--> (b :--> c)) -> Term s (a :--> (b :--> d))
- (#.**) :: forall (e :: S -> Type) (d :: S -> Type) (c :: S -> Type) (b :: S -> Type) (a :: S -> Type) (s :: S). Term s (d :--> e) -> Term s (a :--> (b :--> (c :--> d))) -> Term s (a :--> (b :--> (c :--> e)))
- (#.***) :: forall (f :: S -> Type) (e :: S -> Type) (d :: S -> Type) (c :: S -> Type) (b :: S -> Type) (a :: S -> Type) (s :: S). Term s (e :--> f) -> Term s (a :--> (b :--> (c :--> (d :--> e)))) -> Term s (a :--> (b :--> (c :--> (d :--> f))))
Documentation
pconst :: forall (a :: S -> Type) (b :: S -> Type) (s :: S). Term s (a :--> (b :--> a)) Source #
Since: 1.0.0
papply :: forall (a :: S -> Type) (b :: S -> Type) (s :: S). Term s ((a :--> b) :--> (a :--> b)) Source #
Since: 1.0.0
pon :: forall (a :: S -> Type) (b :: S -> Type) (c :: S -> Type) (s :: S). Term s ((b :--> (b :--> c)) :--> ((a :--> b) :--> (a :--> (a :--> c)))) Source #
Plutarch level on
.
@since 1.3.0
pbuiltinUncurry :: forall (a :: S -> Type) (b :: S -> Type) (c :: S -> Type) (s :: S). (PIsData a, PIsData b) => (Term s a -> Term s b -> Term s c) -> Term s (PBuiltinPair (PAsData a) (PAsData b)) -> Term s c Source #
Make uncurried function with Haskell function with two arguments. @since 1.3.0
pflip :: forall (a :: S -> Type) (b :: S -> Type) (c :: S -> Type) (s :: S). Term s ((a :--> (b :--> c)) :--> (b :--> (a :--> c))) Source #
Since: 1.4.0
(#.*) :: forall (d :: S -> Type) (c :: S -> Type) (b :: S -> Type) (a :: S -> Type) (s :: S). Term s (c :--> d) -> Term s (a :--> (b :--> c)) -> Term s (a :--> (b :--> d)) infixr 8 Source #
Since: 3.0.3