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-11-02 18:12:55

expired found date

-

created at

2024-11-02 18:12:55

updated at

2026-03-02 09:34:08

Domain name statistics

length

20

crc

48440

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

175977

mp size raw text

50381

mp inner links count

13

mp inner links status

20 (imported)

Open Graph

title

(parentheses)

description

ramblings and thought on Haskell, programming and logic

image

site name

(parentheses)

author

updated

2026-02-20 21:39:15

raw text

(parentheses) | ramblings and thought on Haskell, programming and logic (parentheses) ramblings and thought on Haskell, programming and logic Menu Skip to content Home About Useful links Frobenius property of weak factorisation systems and Pi-types Leave a reply I’ve put together a note on the Frobenius property for weak factorisaion systems and it’s relation to models of type theory. Awodey and Warren described a way of obtaining a model of type theory with identity types from a model category structure/weak factorisation system. However, in absence of axioms for other type formers (specifically, Π -types), one is required to put an additional restriction on the weak factorisation system, in order to model identity elimination in an arbitrary context/with arbitrary parameters; specifically, it is required that cofibrations are stable under pullbacks along fibrations. In presence of Π -types, however, this is not necessary, as I tried to explain in the note. ...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

SEC and Crypto [en] (228)

index version

2025123101

spam phrases

1

Text statistics

text nonlatin

2

text cyrillic

0

text characters

35879

text words

7692

text unique words

1558

text lines

1505

text sentences

335

text paragraphs

117

text words per sentence

22

text matched phrases

1

text matched dictionaries

3

RSS

rss status

32 (unknown)

rss found date

2024-11-02 18:12:56

rss size orig

152942

rss items

20

rss spam phrases

1

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

37

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

2024-11-02 18:12:55

sitemap process date

2024-11-04 05:07:13

sitemap first import date

-

sitemap last import date

2025-10-31 15:16:12