{-# LANGUAGE UndecidableInstances #-}

module Plutarch.Builtin.Bool (
  -- * Type
  PBool (..),

  -- * Builtin
  pbuiltinIfThenElse,

  -- * Functions
  pif',
  pif,
  pnot,
  (#&&),
  (#||),
  por,
  pand,
  pand',
  por',
) where

import Data.Kind (Type)
import Plutarch.Internal.Lift (
  DeriveBuiltinPLiftable,
  PLiftable,
  PLifted (PLifted),
  pconstant,
 )
import Plutarch.Internal.PLam (plam)
import Plutarch.Internal.PlutusType (
  PlutusType (PInner, pcon', pmatch'),
  pcon,
  pmatch,
 )
import Plutarch.Internal.Term (
  PDelayed,
  S,
  Term,
  pdelay,
  pforce,
  phoistAcyclic,
  punsafeBuiltin,
  (#),
  (:-->),
 )
import PlutusCore qualified as PLC

{- | Builtin Plutus boolean.

@since WIP
-}
data PBool (s :: S) = PTrue | PFalse
  deriving stock
    ( -- | @since WIP
      Int -> PBool s -> ShowS
[PBool s] -> ShowS
PBool s -> String
(Int -> PBool s -> ShowS)
-> (PBool s -> String) -> ([PBool s] -> ShowS) -> Show (PBool s)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall (s :: S). Int -> PBool s -> ShowS
forall (s :: S). [PBool s] -> ShowS
forall (s :: S). PBool s -> String
$cshowsPrec :: forall (s :: S). Int -> PBool s -> ShowS
showsPrec :: Int -> PBool s -> ShowS
$cshow :: forall (s :: S). PBool s -> String
show :: PBool s -> String
$cshowList :: forall (s :: S). [PBool s] -> ShowS
showList :: [PBool s] -> ShowS
Show
    )

-- | @since WIP
deriving via
  (DeriveBuiltinPLiftable PBool Bool)
  instance
    PLiftable PBool

-- | @since WIP
instance PlutusType PBool where
  type PInner PBool = PBool
  {-# INLINEABLE pcon' #-}
  pcon' :: forall (s :: S). PBool s -> Term s (PInner PBool)
pcon' =
    AsHaskell (PInner PBool) -> Term s (PInner PBool)
forall (a :: S -> Type) (s :: S).
PLiftable a =>
AsHaskell a -> Term s a
pconstant (AsHaskell (PInner PBool) -> Term s (PInner PBool))
-> (PBool s -> AsHaskell (PInner PBool))
-> PBool s
-> Term s (PInner PBool)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. \case
      PBool s
PTrue -> Bool
AsHaskell (PInner PBool)
True
      PBool s
PFalse -> Bool
AsHaskell (PInner PBool)
False
  {-# INLINEABLE pmatch' #-}
  pmatch' :: forall (s :: S) (b :: S -> Type).
Term s (PInner PBool) -> (PBool s -> Term s b) -> Term s b
pmatch' Term s (PInner PBool)
b PBool s -> Term s b
f = Term s (PDelayed b) -> Term s b
forall (s :: S) (a :: S -> Type). Term s (PDelayed a) -> Term s a
pforce (Term s (PDelayed b) -> Term s b)
-> Term s (PDelayed b) -> Term s b
forall a b. (a -> b) -> a -> b
$ Term s (PBool :--> (PDelayed b :--> (PDelayed b :--> PDelayed b)))
forall (a :: S -> Type) (s :: S).
Term s (PBool :--> (a :--> (a :--> a)))
pif' Term s (PBool :--> (PDelayed b :--> (PDelayed b :--> PDelayed b)))
-> Term s PBool
-> Term s (PDelayed b :--> (PDelayed b :--> PDelayed b))
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PInner PBool)
Term s PBool
b Term s (PDelayed b :--> (PDelayed b :--> PDelayed b))
-> Term s (PDelayed b) -> Term s (PDelayed b :--> PDelayed b)
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s b -> Term s (PDelayed b)
forall (s :: S) (a :: S -> Type). Term s a -> Term s (PDelayed a)
pdelay (PBool s -> Term s b
f PBool s
forall (s :: S). PBool s
PTrue) Term s (PDelayed b :--> PDelayed b)
-> Term s (PDelayed b) -> Term s (PDelayed b)
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s b -> Term s (PDelayed b)
forall (s :: S) (a :: S -> Type). Term s a -> Term s (PDelayed a)
pdelay (PBool s -> Term s b
f PBool s
forall (s :: S). PBool s
PFalse)

-- | @since WIP
pbuiltinIfThenElse ::
  forall (a :: S -> Type) (s :: S).
  Term s (PBool :--> a :--> a :--> PDelayed a)
pbuiltinIfThenElse :: forall (a :: S -> Type) (s :: S).
Term s (PBool :--> (a :--> (a :--> PDelayed a)))
pbuiltinIfThenElse = DefaultFun -> Term s (PBool :--> (a :--> (a :--> PDelayed a)))
forall (s :: S) (a :: S -> Type). DefaultFun -> Term s a
punsafeBuiltin DefaultFun
PLC.IfThenElse

{- | Strict if-then-else. Emits slightly less code than the lazy version.

@since WIP
-}
pif' ::
  forall (a :: S -> Type) (s :: S).
  Term s (PBool :--> a :--> a :--> a)
pif' :: forall (a :: S -> Type) (s :: S).
Term s (PBool :--> (a :--> (a :--> a)))
pif' = ClosedTerm (PBool :--> (a :--> (a :--> a)))
-> Term s (PBool :--> (a :--> (a :--> a)))
forall (a :: S -> Type) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic (ClosedTerm (PBool :--> (a :--> (a :--> a)))
 -> Term s (PBool :--> (a :--> (a :--> a))))
-> ClosedTerm (PBool :--> (a :--> (a :--> a)))
-> Term s (PBool :--> (a :--> (a :--> a)))
forall a b. (a -> b) -> a -> b
$ Term s (PDelayed (PBool :--> (a :--> (a :--> a))))
-> Term s (PBool :--> (a :--> (a :--> a)))
forall (s :: S) (a :: S -> Type). Term s (PDelayed a) -> Term s a
pforce (Term s (PDelayed (PBool :--> (a :--> (a :--> a))))
 -> Term s (PBool :--> (a :--> (a :--> a))))
-> Term s (PDelayed (PBool :--> (a :--> (a :--> a))))
-> Term s (PBool :--> (a :--> (a :--> a)))
forall a b. (a -> b) -> a -> b
$ DefaultFun -> Term s (PDelayed (PBool :--> (a :--> (a :--> a))))
forall (s :: S) (a :: S -> Type). DefaultFun -> Term s a
punsafeBuiltin DefaultFun
PLC.IfThenElse

{- | Lazy if-then-else.

@since WIP
-}
pif ::
  forall (a :: S -> Type) (s :: S).
  Term s PBool ->
  Term s a ->
  Term s a ->
  Term s a
pif :: forall (a :: S -> Type) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif Term s PBool
cond Term s a
ifT Term s a
ifF = Term s PBool -> (PBool s -> Term s a) -> Term s a
forall (a :: S -> Type) (s :: S) (b :: S -> Type).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PBool
cond ((PBool s -> Term s a) -> Term s a)
-> (PBool s -> Term s a) -> Term s a
forall a b. (a -> b) -> a -> b
$ \case
  PBool s
PTrue -> Term s a
ifT
  PBool s
PFalse -> Term s a
ifF

{- | Boolean negation.

@since WIP
-}
pnot ::
  forall (s :: S).
  Term s (PBool :--> PBool)
pnot :: forall (s :: S). Term s (PBool :--> PBool)
pnot = (forall (s :: S). Term s (PBool :--> PBool))
-> Term s (PBool :--> PBool)
forall (a :: S -> Type) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PBool :--> PBool))
 -> Term s (PBool :--> PBool))
-> (forall (s :: S). Term s (PBool :--> PBool))
-> Term s (PBool :--> PBool)
forall a b. (a -> b) -> a -> b
$ (Term s PBool -> Term s PBool) -> Term s (PBool :--> PBool)
forall a (b :: S -> Type) (s :: S) (c :: S -> Type).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: S -> Type).
HasCallStack =>
(Term s c -> Term s PBool) -> Term s (c :--> PBool)
plam ((Term s PBool -> Term s PBool) -> Term s (PBool :--> PBool))
-> (Term s PBool -> Term s PBool) -> Term s (PBool :--> PBool)
forall a b. (a -> b) -> a -> b
$ \Term s PBool
x ->
  Term s (PBool :--> (PBool :--> (PBool :--> PBool)))
forall (a :: S -> Type) (s :: S).
Term s (PBool :--> (a :--> (a :--> a)))
pif' Term s (PBool :--> (PBool :--> (PBool :--> PBool)))
-> Term s PBool -> Term s (PBool :--> (PBool :--> PBool))
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PBool
x Term s (PBool :--> (PBool :--> PBool))
-> Term s PBool -> Term s (PBool :--> PBool)
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# PBool s -> Term s PBool
forall (a :: S -> Type) (s :: S). PlutusType a => a s -> Term s a
pcon PBool s
forall (s :: S). PBool s
PFalse Term s (PBool :--> PBool) -> Term s PBool -> Term s PBool
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# PBool s -> Term s PBool
forall (a :: S -> Type) (s :: S). PlutusType a => a s -> Term s a
pcon PBool s
forall (s :: S). PBool s
PTrue

{- | Lazy AND for terms.

@since WIP
-}
(#&&) :: forall (s :: S). Term s PBool -> Term s PBool -> Term s PBool
Term s PBool
x #&& :: forall (s :: S). Term s PBool -> Term s PBool -> Term s PBool
#&& Term s PBool
y = Term s (PDelayed PBool) -> Term s PBool
forall (s :: S) (a :: S -> Type). Term s (PDelayed a) -> Term s a
pforce (Term s (PDelayed PBool) -> Term s PBool)
-> Term s (PDelayed PBool) -> Term s PBool
forall a b. (a -> b) -> a -> b
$ Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
forall (s :: S).
Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
pand Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
-> Term s PBool -> Term s (PDelayed PBool :--> PDelayed PBool)
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PBool
x Term s (PDelayed PBool :--> PDelayed PBool)
-> Term s (PDelayed PBool) -> Term s (PDelayed PBool)
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PBool -> Term s (PDelayed PBool)
forall (s :: S) (a :: S -> Type). Term s a -> Term s (PDelayed a)
pdelay Term s PBool
y

infixr 3 #&&

{- | Lazy OR for terms.

@since WIP
-}
(#||) :: forall (s :: S). Term s PBool -> Term s PBool -> Term s PBool
Term s PBool
x #|| :: forall (s :: S). Term s PBool -> Term s PBool -> Term s PBool
#|| Term s PBool
y = Term s (PDelayed PBool) -> Term s PBool
forall (s :: S) (a :: S -> Type). Term s (PDelayed a) -> Term s a
pforce (Term s (PDelayed PBool) -> Term s PBool)
-> Term s (PDelayed PBool) -> Term s PBool
forall a b. (a -> b) -> a -> b
$ Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
forall (s :: S).
Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
por Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
-> Term s PBool -> Term s (PDelayed PBool :--> PDelayed PBool)
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PBool
x Term s (PDelayed PBool :--> PDelayed PBool)
-> Term s (PDelayed PBool) -> Term s (PDelayed PBool)
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PBool -> Term s (PDelayed PBool)
forall (s :: S) (a :: S -> Type). Term s a -> Term s (PDelayed a)
pdelay Term s PBool
y

infixr 2 #||

{- | Hoisted lazy AND at the Plutarch level.

@since WIP
-}
pand :: forall (s :: S). Term s (PBool :--> PDelayed PBool :--> PDelayed PBool)
pand :: forall (s :: S).
Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
pand = (forall (s :: S).
 Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool)))
-> Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
forall (a :: S -> Type) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S).
  Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool)))
 -> Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool)))
-> (forall (s :: S).
    Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool)))
-> Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
forall a b. (a -> b) -> a -> b
$ (Term s PBool
 -> Term s (PDelayed PBool) -> Term s (PDelayed PBool))
-> Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
forall a (b :: S -> Type) (s :: S) (c :: S -> Type).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: S -> Type).
HasCallStack =>
(Term s c -> Term s (PDelayed PBool) -> Term s (PDelayed PBool))
-> Term s (c :--> (PDelayed PBool :--> PDelayed PBool))
plam ((Term s PBool
  -> Term s (PDelayed PBool) -> Term s (PDelayed PBool))
 -> Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool)))
-> (Term s PBool
    -> Term s (PDelayed PBool) -> Term s (PDelayed PBool))
-> Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
forall a b. (a -> b) -> a -> b
$ \Term s PBool
x Term s (PDelayed PBool)
y -> Term
  s
  (PBool
   :--> (PDelayed PBool :--> (PDelayed PBool :--> PDelayed PBool)))
forall (a :: S -> Type) (s :: S).
Term s (PBool :--> (a :--> (a :--> a)))
pif' Term
  s
  (PBool
   :--> (PDelayed PBool :--> (PDelayed PBool :--> PDelayed PBool)))
-> Term s PBool
-> Term
     s (PDelayed PBool :--> (PDelayed PBool :--> PDelayed PBool))
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PBool
x Term s (PDelayed PBool :--> (PDelayed PBool :--> PDelayed PBool))
-> Term s (PDelayed PBool)
-> Term s (PDelayed PBool :--> PDelayed PBool)
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PDelayed PBool)
y Term s (PDelayed PBool :--> PDelayed PBool)
-> Term s (PDelayed PBool) -> Term s (PDelayed PBool)
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# ClosedTerm (PDelayed PBool) -> Term s (PDelayed PBool)
forall (a :: S -> Type) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic (Term s PBool -> Term s (PDelayed PBool)
forall (s :: S) (a :: S -> Type). Term s a -> Term s (PDelayed a)
pdelay (Term s PBool -> Term s (PDelayed PBool))
-> Term s PBool -> Term s (PDelayed PBool)
forall a b. (a -> b) -> a -> b
$ PBool s -> Term s PBool
forall (a :: S -> Type) (s :: S). PlutusType a => a s -> Term s a
pcon PBool s
forall (s :: S). PBool s
PFalse)

{- | As 'pand', but strict.

@since WIP
-}
pand' :: forall (s :: S). Term s (PBool :--> PBool :--> PBool)
pand' :: forall (s :: S). Term s (PBool :--> (PBool :--> PBool))
pand' = (forall (s :: S). Term s (PBool :--> (PBool :--> PBool)))
-> Term s (PBool :--> (PBool :--> PBool))
forall (a :: S -> Type) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PBool :--> (PBool :--> PBool)))
 -> Term s (PBool :--> (PBool :--> PBool)))
-> (forall (s :: S). Term s (PBool :--> (PBool :--> PBool)))
-> Term s (PBool :--> (PBool :--> PBool))
forall a b. (a -> b) -> a -> b
$ (Term s PBool -> Term s PBool -> Term s PBool)
-> Term s (PBool :--> (PBool :--> PBool))
forall a (b :: S -> Type) (s :: S) (c :: S -> Type).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: S -> Type).
HasCallStack =>
(Term s c -> Term s PBool -> Term s PBool)
-> Term s (c :--> (PBool :--> PBool))
plam ((Term s PBool -> Term s PBool -> Term s PBool)
 -> Term s (PBool :--> (PBool :--> PBool)))
-> (Term s PBool -> Term s PBool -> Term s PBool)
-> Term s (PBool :--> (PBool :--> PBool))
forall a b. (a -> b) -> a -> b
$ \Term s PBool
x Term s PBool
y -> Term s (PBool :--> (PBool :--> (PBool :--> PBool)))
forall (a :: S -> Type) (s :: S).
Term s (PBool :--> (a :--> (a :--> a)))
pif' Term s (PBool :--> (PBool :--> (PBool :--> PBool)))
-> Term s PBool -> Term s (PBool :--> (PBool :--> PBool))
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PBool
x Term s (PBool :--> (PBool :--> PBool))
-> Term s PBool -> Term s (PBool :--> PBool)
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PBool
y Term s (PBool :--> PBool) -> Term s PBool -> Term s PBool
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# PBool s -> Term s PBool
forall (a :: S -> Type) (s :: S). PlutusType a => a s -> Term s a
pcon PBool s
forall (s :: S). PBool s
PFalse

{- | Hoisted lazy OR at the Plutarch level.

@since WIP
-}
por :: forall (s :: S). Term s (PBool :--> PDelayed PBool :--> PDelayed PBool)
por :: forall (s :: S).
Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
por = (forall (s :: S).
 Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool)))
-> Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
forall (a :: S -> Type) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S).
  Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool)))
 -> Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool)))
-> (forall (s :: S).
    Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool)))
-> Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
forall a b. (a -> b) -> a -> b
$ (Term s PBool -> Term s (PDelayed PBool :--> PDelayed PBool))
-> Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
forall a (b :: S -> Type) (s :: S) (c :: S -> Type).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: S -> Type).
HasCallStack =>
(Term s c -> Term s (PDelayed PBool :--> PDelayed PBool))
-> Term s (c :--> (PDelayed PBool :--> PDelayed PBool))
plam ((Term s PBool -> Term s (PDelayed PBool :--> PDelayed PBool))
 -> Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool)))
-> (Term s PBool -> Term s (PDelayed PBool :--> PDelayed PBool))
-> Term s (PBool :--> (PDelayed PBool :--> PDelayed PBool))
forall a b. (a -> b) -> a -> b
$ \Term s PBool
x -> Term
  s
  (PBool
   :--> (PDelayed PBool :--> (PDelayed PBool :--> PDelayed PBool)))
forall (a :: S -> Type) (s :: S).
Term s (PBool :--> (a :--> (a :--> a)))
pif' Term
  s
  (PBool
   :--> (PDelayed PBool :--> (PDelayed PBool :--> PDelayed PBool)))
-> Term s PBool
-> Term
     s (PDelayed PBool :--> (PDelayed PBool :--> PDelayed PBool))
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PBool
x Term s (PDelayed PBool :--> (PDelayed PBool :--> PDelayed PBool))
-> Term s (PDelayed PBool)
-> Term s (PDelayed PBool :--> PDelayed PBool)
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# ClosedTerm (PDelayed PBool) -> Term s (PDelayed PBool)
forall (a :: S -> Type) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic (Term s PBool -> Term s (PDelayed PBool)
forall (s :: S) (a :: S -> Type). Term s a -> Term s (PDelayed a)
pdelay (Term s PBool -> Term s (PDelayed PBool))
-> Term s PBool -> Term s (PDelayed PBool)
forall a b. (a -> b) -> a -> b
$ PBool s -> Term s PBool
forall (a :: S -> Type) (s :: S). PlutusType a => a s -> Term s a
pcon PBool s
forall (s :: S). PBool s
PTrue)

{- | As 'por', but strict.

@since WIP
-}
por' :: Term s (PBool :--> PBool :--> PBool)
por' :: forall (s :: S). Term s (PBool :--> (PBool :--> PBool))
por' = (forall (s :: S). Term s (PBool :--> (PBool :--> PBool)))
-> Term s (PBool :--> (PBool :--> PBool))
forall (a :: S -> Type) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PBool :--> (PBool :--> PBool)))
 -> Term s (PBool :--> (PBool :--> PBool)))
-> (forall (s :: S). Term s (PBool :--> (PBool :--> PBool)))
-> Term s (PBool :--> (PBool :--> PBool))
forall a b. (a -> b) -> a -> b
$ (Term s PBool -> Term s (PBool :--> PBool))
-> Term s (PBool :--> (PBool :--> PBool))
forall a (b :: S -> Type) (s :: S) (c :: S -> Type).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: S -> Type).
HasCallStack =>
(Term s c -> Term s (PBool :--> PBool))
-> Term s (c :--> (PBool :--> PBool))
plam ((Term s PBool -> Term s (PBool :--> PBool))
 -> Term s (PBool :--> (PBool :--> PBool)))
-> (Term s PBool -> Term s (PBool :--> PBool))
-> Term s (PBool :--> (PBool :--> PBool))
forall a b. (a -> b) -> a -> b
$ \Term s PBool
x -> Term s (PBool :--> (PBool :--> (PBool :--> PBool)))
forall (a :: S -> Type) (s :: S).
Term s (PBool :--> (a :--> (a :--> a)))
pif' Term s (PBool :--> (PBool :--> (PBool :--> PBool)))
-> Term s PBool -> Term s (PBool :--> (PBool :--> PBool))
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PBool
x Term s (PBool :--> (PBool :--> PBool))
-> Term s PBool -> Term s (PBool :--> PBool)
forall (s :: S) (a :: S -> Type) (b :: S -> Type).
Term s (a :--> b) -> Term s a -> Term s b
# PBool s -> Term s PBool
forall (a :: S -> Type) (s :: S). PlutusType a => a s -> Term s a
pcon PBool s
forall (s :: S). PBool s
PTrue