f

f :: FastString
ghc GHC.StgToJS.Symbols
f :: Real a => Int -> Format r (a -> r)
formatting Formatting.ShortFormatters
Render a floating point number using normal notation, with the given number of decimal places.
f :: Format r (Double -> r)
turtle Turtle.Format
Format a Double using decimal notation with 6 digits of precision 
>>> format f 25.1
"25.100000"
f :: SWord32 -> SWord64
sbv Documentation.SBV.Examples.Uninterpreted.AUF
Uninterpreted function in the theorem
f :: SWord8 -> SWord8 -> SWord16
sbv Documentation.SBV.Examples.Uninterpreted.Function
An uninterpreted function
f :: SQ -> SQ
sbv Documentation.SBV.Examples.Uninterpreted.Sort
Declare an uninterpreted function that works over Q's
f :: FromExpr a => a
simple-reflect Debug.SimpleReflect.Vars
f :: Op
rest-rewrite DSL
f :: Swizzle21 a => a -> F a
swizzle Data.Swizzle
f :: Swizzle21 a_aknq => a_aknq -> F a_aknq
swizzle Data.Swizzle.Class
f :: (Swizzle21 a_aknq, Generic a_aknq, GSwizzle21 (Rep a_aknq), F a_aknq ~ GF (Rep a_aknq)) => a_aknq -> F a_aknq
swizzle Data.Swizzle.Class
f :: SwizzleSet21 s_a99Ho f_a99Hp => s_a99Ho -> f_a99Hp -> F s_a99Ho f_a99Hp
swizzle-set Data.SwizzleSet
f :: SwizzleSet21 s_acf9 b_acfa => s_acf9 -> b_acfa -> F s_acf9 b_acfa
swizzle-set Data.SwizzleSet.Class
f :: (SwizzleSet21 s_acf9 b_acfa, Generic s_acf9, Generic (F s_acf9 b_acfa), GSwizzleSet21 (Rep s_acf9) b_acfa, Rep (F s_acf9 b_acfa) ~ GF (Rep s_acf9) b_acfa) => s_acf9 -> b_acfa -> F s_acf9 b_acfa
swizzle-set Data.SwizzleSet.Class
f :: Note -> Float
essence-of-live-coding-pulse LiveCoding.Pulse
Calculate the frequency of a note, with A corresponding to 220 Hz.
f :: (Swizzle21 s_aaAN, SwizzleSet21 s_aaAN u_aaAO, Functor f_aaAP) => (F s_aaAN -> f_aaAP u_aaAO) -> s_aaAN -> f_aaAP (F s_aaAN u_aaAO)
swizzle-lens Data.SwizzleLens
f :: (Swizzle21 s_ad5y, SwizzleSet21 s_ad5y u_ad5z) => (F s_ad5y -> u_ad5z) -> s_ad5y -> F s_ad5y u_ad5z
swizzle-modify Data.SwizzleModify
F :: ArgRep
ghc GHC.StgToCmm.ArgRep GHC.StgToCmm.Layout
newtype F f a
free Control.Monad.Free.Church
The Church-encoded free monad for a functor f. It is asymptotically more efficient to use (>>=) for F than it is to (>>=) with Free. https://ekmett.github.io/reader/2011/free-monads-for-less-2/
F :: (forall r . (a -> r) -> (f r -> r) -> r) -> F f a
free Control.Monad.Free.Church
type F f = FT f Identity
free Control.Monad.Trans.Free.Church
The "free monad" for a functor f.
data F
repa Data.Array.Repa.Repr.ForeignPtr
Arrays represented as foreign buffers in the C heap.
data F
ad Numeric.AD.Internal.Or
F :: FRW
SafeSemaphore Control.Concurrent.FairRWLock
data F
leancheck Test.LeanCheck.Utils.Types
Generic type F. Can be used to test polymorphic functions with five type variables. This type is homomorphic to A, B, C, D, E and Nat6.