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-08 20:16:23

expired found date

-

created at

2024-10-08 20:16:23

updated at

2026-01-19 14:09:59

Domain name statistics

length

21

crc

62706

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

114927

mp size raw text

5328

mp inner links count

9

mp inner links status

20 (imported)

Open Graph

title

flippac

description

A wandering hacker, lost in a maze of abstractions all alike

image

site name

flippac

author

updated

2026-01-16 19:02:43

raw text

flippac | A wandering hacker, lost in a maze of abstractions all alike Skip to primary content Skip to secondary content flippac A wandering hacker, lost in a maze of abstractions all alike Search Main menu Home About The Simply-typed Lambda Calculus with Constraints Posted on February 23, 2012 by Philippa Cowderoy 8 Here’s the syntax for the simply-typed lambda calculus (STLC): Here are the typing rules, written in the usual natural deduction style: It turns out that these rules are not only enough to provide typechecking but also type inference if you feed them into Prolog, though that’s far from a coincidence. Type inference for STLC is possible, and Prolog was the result of decades of research into finding proofs (in this case a typing – a proof that a given term has a given type) for problems stated in this style. It’s even less of a coincidence because STLC admits principal typings – so all proofs that a term has a given type are equiva...

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

3825

text words

780

text unique words

346

text lines

202

text sentences

31

text paragraphs

8

text words per sentence

25

text matched phrases

0

text matched dictionaries

0

RSS

rss status

32 (unknown)

rss found date

2024-10-08 20:16:24

rss size orig

136688

rss items

5

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

7

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

2024-10-08 20:16:23

sitemap process date

2024-10-08 20:16:23

sitemap first import date

-

sitemap last import date

2025-06-11 07:27:49