{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE EmptyCase #-}
{-# LANGUAGE EmptyDataDecls #-}
{-# LANGUAGE ExistentialQuantification #-}
{-# LANGUAGE NoMonomorphismRestriction #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE PatternSynonyms #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE ScopedTypeVariables #-}

{-# OPTIONS_GHC -Wno-overlapping-patterns #-}

module MAlonzo.Code.Agda.Builtin.Strict where

import MAlonzo.RTE (coe, erased, AgdaAny, addInt, subInt, mulInt,
                    quotInt, remInt, geqInt, ltInt, eqInt, add64, sub64, mul64, quot64,
                    rem64, lt64, eq64, word64FromNat, word64ToNat)
import qualified MAlonzo.RTE
import qualified Data.Text

-- Agda.Builtin.Strict.primForce
d_primForce_18 :: p -> p -> p -> p -> a -> (a -> b) -> b
d_primForce_18 = \ p
_ p
_ p
_ p
_ a
x a -> b
f -> a -> b
f (a -> b) -> a -> b
forall a b. (a -> b) -> a -> b
$! a
x
-- Agda.Builtin.Strict.primForceLemma
d_primForceLemma_34 :: a
d_primForceLemma_34 = a
forall a. a
erased