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-09-28 22:56:02

expired found date

-

created at

2024-09-28 22:56:02

updated at

2025-12-28 05:51:08

Domain name statistics

length

24

crc

29266

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

185318

mp size raw text

73262

mp inner links count

14

mp inner links status

10 (links queued, awaiting import)

Open Graph

title

taliasplse

description

image

site name

taliasplse

author

updated

2026-03-08 07:18:25

raw text

taliasplse Skip to content taliasplse Menu Home About Automating Transport with Univalent E-Graphs February 2, 2020 July 4, 2020 ~ Talia Ringer ~ Leave a comment How cool would it be if we could take entire verified libraries in an interactive theorem prover defined over existing datatypes and, with the push of a button (and maybe a tiny bit of user guidance), port those libraries’ functions and proofs to use our own datatypes? This is the problem that DEVOID , a part of the PUMPKIN PATCH plugin suite, chips away at —starting with a small and confined use case. I’ve recently extended DEVOID (in a branch) to chip away more at this problem, and the more and more I chip away at it, the clearer the picture becomes. I think this kind of automation is pretty close — say, 5-10 years away —but we have some interesting problems to solve first. In this post, I’ll talk about one of those problems: efficiently automating transport across type equivalence...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

Edukacja (47)

index version

1

spam phrases

0

Text statistics

text nonlatin

2

text cyrillic

0

text characters

56807

text words

12493

text unique words

2078

text lines

816

text sentences

784

text paragraphs

206

text words per sentence

15

text matched phrases

0

text matched dictionaries

0

RSS

rss status

32 (unknown)

rss found date

2024-09-28 22:56:07

rss size orig

109962

rss items

7

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

9

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

2024-09-28 22:56:03

sitemap process date

2024-09-28 22:56:04

sitemap first import date

-

sitemap last import date

2025-12-28 05:51:08