Edited, memorised or added to reading queue

on 16-Sep-2015 (Wed)

Do you want BuboFlash to help you learning these things? Click here to log in or create user.

Flashcard 150905518

Question
uando receberam a palavra de [...] , que ouviram de n ´ os, voc ˆ es a aceitaram n ˜ ao como a palavra de homens , mas pelo que ela realmente ´ e, a palavra de Deus.” 1 Tessalonicenses 2:13 [P ´ agina 1636]
Answer
Deus

statusnot learnedmeasured difficulty37% [default]last interval [days]               
repetition number in this series0memorised on               scheduled repetition               
scheduled repetition interval               last repetition or drill

Parent (intermediate) annotation

Open it
uando receberam a palavra de Deus , que ouviram de n ´ os, voc ˆ es a aceitaram n ˜ ao como a palavra de homens , mas pelo que ela realmente ´ e, a palavra de Deus.” 1 Tessalonicenses 2:13 [P ´ agina 1636]<

Original toplevel document (pdf)

cannot see any pdfs






Flashcard 150909473

Tags
#angielski #has-images #has-kbd #has-sounds #ogden #ogden-picturable #słownictwo #wn30-n2219486 #wordnet


Question

rzeczownik: mrówka

Answer
  • ant

statusnot learnedmeasured difficulty37% [default]last interval [days]               
repetition number in this series0memorised on               scheduled repetition               
scheduled repetition interval               last repetition or drill





Flashcard 150913829

Tags
#test
Question
blue en fr ?
Answer
bleu

statusnot learnedmeasured difficulty37% [default]last interval [days]               
repetition number in this series0memorised on               scheduled repetition               
scheduled repetition interval               last repetition or drill





Annotation 150913836

#credit-suisse-basis-points #finance
Credit Suisse
statusnot read reprioritisations
last reprioritisation on suggested re-reading day
started reading on finished reading on

pdf

cannot see any pdfs



Annotation 150913852

A non-covering type family is a type family whose patterns do not cover the whole space.
statusnot read reprioritisations
last reprioritisation on suggested re-reading day
started reading on finished reading on

What are type families? | Types and Kinds
a total type family is properly a function on types. Those other dependently typed languages have functions on types, and they seem to work nicely. I am completely unbothered by total type families. Non-covering type families are strange <span>A non-covering type family is a type family whose patterns do not cover the whole space. Let’s consider closed and open families separately, because the issues that come up are different. Closed type families For example: > type family F1 a where > F1 Int



Annotation 150913870

#haskell #type-families
In GHC, a type family that can’t reduce is considered “stuck”. Such a type is effectively a new type, equal only to itself, like empty datatypes a programmer might declare.
statusnot read reprioritisations
last reprioritisation on suggested re-reading day
started reading on finished reading on

What are type families? | Types and Kinds
t1 :: Int -> SillyGadt (F1 Char) > MkSillyGadt2 :: Float -> SillyGadt (F1 Double) Now, even though F1 Char is nonsense, SillyGadt (F1 Char) is inhabited. And GHC distinguishes between F1 Char and F1 Double . <span>In GHC, a type family that can’t reduce is considered “stuck”. Such a type is effectively a new type, equal only to itself, like empty datatypes a programmer might declare. The only thing different about something like F1 Char from something like Maybe Char is that F1 Char cannot be used in a type pattern (that is, the left-hand side of a type family



Annotation 150913876

#haskell #type-families 
type family F1 a where
  F1 Int = Bool

So, when we declare F1, we create an infinite family of unique types containing F1 applied to all types of kind *, except for Int, because F1 Int is identically Bool.
statusnot read reprioritisations
last reprioritisation on suggested re-reading day
started reading on finished reading on

What are type families? | Types and Kinds
ly thing different about something like F1 Char from something like Maybe Char is that F1 Char cannot be used in a type pattern (that is, the left-hand side of a type family equation or data family instance). That’s the only difference. <span>So, when we declare F1 , we create an infinite family of unique types containing F1 applied to all types of kind * , except for Int , because F1 Int is identically Bool . I find this treatment of non-covering closed type families rather bizarre. Compare against term-level behavior. When a term-level function is non-covering, passing an argument for which