Top Tweets for #typeapplications
Look at those crazy instantiations.
I am desperate for a feature that lists all #TypeApplications visibly

@hisham_hm @taylorfausak One of the most important ones is #TypeApplications
{-# Language TypeApplications #-}
which allows you to use @ to pass types as arguments.
First you should think of polymorphic types like
minBound :: Bounded a => a
as having an invisible argument
This would also be helped it GHC could mark, or temporarily fill in, visible #TypeApplications
mempty @(a->a->a)
v
mappend @a
When GHC instance resolution bites: today I had well-typed wrong code `mempty x y` where I meant `mappend x y`! A quick explanation of why this was well-typed https://t.co/bqf30YPKID Proposals e.g. by @Iceland_jack to allow GHC to explain its instance resolution would have helped
It's easy to forget how much happens behind the scenes
fmap fmap fmap odd (+)
it's there, we should be privy. The first two 'fmap's are 4th order functions
Haskell IDE should have
· option to, temporarily or otherwise, override all #TypeApplications to be visible

I always use #TypeApplications for read-like functions (with return-type polymorphism)
Person <$> read @String
<*> read @Int
but not for show
@mattoflambda Assuming a proxy for a Type but I would expect a modern library to provide a proxy-free #TypeApplications as the primary interface, but I think visible quantification would be best (in dependent Haskell)
sizeOf :: forall a -> Storable a => Int
How feasible is it to grep Haskell code with
traverse @Maybe @(Cont _)
foldr @[] @_ @(_->_)
so you get a result even if it appears without #TypeApplications
runCont (traverse pure Nothing)
@autumnskullcap @tritlo Using an extension #TypeApplications (https://t.co/AZrBuKHKSY) you can write that succinctly as
{-# Language TypeApplications #-}
map = fmap @[]
@lexi_lambda > it can sometimes be very difficult for someone not familiar with idiomatic Haskell to resolve the constraints in their head
Copious #TypeApplications / sigs / local defs
take 5 (xs <> pure @[] x)
also imagine if we had infix application (=
take 5 (xs <> @[_] pure @[] x)
#Haskell beginners:
explicitly specify all #TypeApplications, until it is clear to you how functions are instantiated.
It makes polymorphic recursion obvious
It's where you define a function foo @a but call it at something like foo @[a]
![Iceland_jack's tweet photo. #Haskell beginners:
explicitly specify all #TypeApplications, until it is clear to you how functions are instantiated.
It makes polymorphic recursion obvious
It's where you define a function foo @a but call it at something like foo @[a] https://t.co/7PfhMeuuU0](https://pbs.twimg.com/media/EEh5_1qXUAAY08N.png)
@MxLambda Did you mean 'data Void' with no constructors?
#RankNTypes is where #TypeApplications shine,
also (forall a b. a -> b) vs (forall a. a -> forall b. b) =
We could define Void = (forall b. b)

@IsolaMonte Visible #TypeApplications are so useful, I want to bring attention to #InstanceSigs which doesn't get enough love
@josecalderon @_andy_gill @Augustsson Should I write the whole paper on "#ApplyingVia" = #TypeApplications + via
I have various ideas for via in instance declarations, via in module imports; should they all be included

@xgrommx The idea is that #ApplyingVia extends #TypeApplications to mean this
sequenceA @[] @(via Backwards)
~~>
sequenceABackwards
https://t.co/rb7bId5FDb
I wrote a tutorial that explains strategies for using Haskell folds by leaning on GHCi.
"The Adventures of Foldilocks" incorporates story-telling, illustration and code examples you can practice.
I played to my strengths here and used many bad puns.
Commentary on walking through the first chapters of Learn You a Haskell
Haskell beginners should use a lot of visible #TypeApplications (https://t.co/AZrBuKHKSY)
Going through LYAH
https://t.co/YtfWRit7Kl
#TypeApplications
> id @Int 4
4
> id @(Int -> Int) (id @Int) 4
4
> id @((Int -> Int) -> (Int -> Int)) (id @(Int -> Int)) (id @Int) 4
4
Last Seen Hashtags on Sotwe
Most Popular Users

Elon Musk 
@elonmusk
240.4M followers

Barack Obama 
@barackobama
119.3M followers

Donald J. Trump 
@realdonaldtrump
111.7M followers

Cristiano Ronaldo 
@cristiano
110.2M followers

Narendra Modi 
@narendramodi
107M followers

Rihanna 
@rihanna
97.6M followers

NASA 
@nasa
92.1M followers

Justin Bieber 
@justinbieber
90.8M followers

KATY PERRY 
@katyperry
87.4M followers

Taylor Swift 
@taylorswift13
81.3M followers

Lady Gaga 
@ladygaga
72.8M followers

Kim Kardashian 
@kimkardashian
69.7M followers

Virat Kohli 
@imvkohli
69.6M followers

YouTube 
@youtube
68.7M followers

Bill Gates 
@billgates
63.8M followers

The Ellen Show
@theellenshow
62.5M followers

Neymar Jr 
@neymarjr
62.3M followers

CNN 
@cnn
61.9M followers

X 
@x
60.8M followers

Selena Gomez 
@selenagomez
60.5M followers


![Iceland_jack's tweet photo. #Haskell beginners:
explicitly specify all #TypeApplications, until it is clear to you how functions are instantiated.
It makes polymorphic recursion obvious
It's where you define a function foo @a but call it at something like foo @[a] https://t.co/7PfhMeuuU0](https://pbs.twimg.com/media/EEh5_0-X4AAp5YH.png)



