Main

processing priority

4

site type

3 (personal blog or private political site, e.g. Blogspot, Substack, also small blogs on own domains)

review version

11

html import

20 (imported)

Events

first seen date

2024-10-18 08:24:46

expired found date

-

created at

2024-10-18 08:24:46

updated at

2026-02-20 08:06:49

Domain name statistics

length

24

crc

32335

tld

2211

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

13642151 (wordpress.com)

previous id

0

replaced with id

0

related id

-

dns primary id

0

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

count skipped due to recent timeouts on the same server IP

0

count content received but rejected due to 11-799

0

count dns errors

0

count cert errors

0

count timeouts

0

count http 429

0

count http 404

0

count http 403

0

count http 5xx

0

next operation date

-

Server

server bits

server ip

-

Mainpage statistics

mp import status

20

mp rejected date

-

mp saved date

-

mp size orig

292878

mp size raw text

46240

mp inner links count

16

mp inner links status

20 (imported)

Open Graph

title

Tangled Web

description

A math blog

image

site name

Tangled Web

author

updated

2026-02-18 14:05:30

raw text

Tangled Web | A math blog Tangled Web A math blog Applicatives, Monads and Concurrency February 12, 2015 With the Functor-Applicative-Monad proposal just around the corner, I’ve been wondering what exactly the relation between Applicative and Monad is. Every Monad can be made a Functor with fmap = liftM where liftM :: Monad m => (a -> b) -> m a -> m b liftM f ma = do a >= f = join (fmap f ma) . This law is particularly interesting because if you define a Monad the way mathematicians do using join instead of (>>=) then you must have Functor as a superclass in order to define (>>=) . So it seems very natural for Functor to be a superclass of Monad. However, it’s not so obvious to me why Applicative should be a superclass of Monad. It’s true that every Monad can be made an Applicative with () = ap where ap :: Monad m => m (a -> b) -> m a -> m b ap mf ma = do a [a] -> [b] ap fs as = [f a | a [a] -> [b] zap [] _ = [] zap _ [] = [] zap (f:fs) (a:as) = (f...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

Other [en] (231)

index version

2025123101

spam phrases

0

Text statistics

text nonlatin

0

text cyrillic

0

text characters

34999

text words

7590

text unique words

1371

text lines

749

text sentences

463

text paragraphs

110

text words per sentence

16

text matched phrases

2

text matched dictionaries

3

RSS

rss status

32 (unknown)

rss found date

2024-10-18 08:24:47

rss size orig

225901

rss items

10

rss spam phrases

0

rss detected language

1 (English)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap status

40 (completed successful import of reports.txt file to table in_pages)

sitemap review version

2

sitemap urls count

13

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

2024-10-18 08:24:46

sitemap process date

2024-10-18 08:24:47

sitemap first import date

-

sitemap last import date

2025-06-20 10:21:06