Brouwer’s Lattices

In Western literature pseudo-Boolean algebras are more commonly called Heyting algebras. Complete Heyting algebras (often called frames or locales) have been extensively studied on account of their connections with topology: the lattice of open sets of any topological space is a locale, and locales can in some respects be considered as generalized topological spaces. (Source)... Continue Reading →

Conway’s Arrow

One must be careful to treat an arrow chain as a whole. Arrow chains do not describe the iterated application of a binary operator. Whereas chains of other infixed symbols (e.g. 3 + 4 + 5 + 6 + 7) can often be considered in fragments (e.g. (3 + 4) + 5 + (6 + 7)) without a change of meaning (see associativity), or at least can be evaluated step by step in... Continue Reading →

A Love’s Toughness

A system that does not permit you to typecast yourself is by definition attempting to typecast you as something other than yourself - in some degree. This may actually be a good thing, especially when it comes in the form of tough love from a friend. But still, be mindful.

An Icono’s Clasm

Complex typing systems with elastic relational stacks are often vulnerable to "stack overflow" errors at arbitrary relational limits. One way this can often happen is due to collisions between hidden types, deep subtypes implied by one or more entangled substructural typing domains, but which may not necessarily be well-typed from the perspective of the parent... Continue Reading →

Create a website or blog at WordPress.com

Up ↑