Notes

why it matters?

Because your program can have more bits than there are atoms in universe.

Also when reduction doesn't normalize the expresssion

Function types in haskell for inststance aren't decidable, with due exceptions. Analogy

Questions

constuctivity is needed for computability , would you say that about predicativity ?

It turns out if you tweak ZF in the right way, and remove EM, you get a perfectly fine constructive logic, i.e. a theory in which every function nat -> nat can be realized by some lambda term.

Harder to say what happens at other function spaces though… tweet

table 1 reference

you can use properties drawer to implement simple database capabilities, but it has one important limitation - values are mere text, so you can’t have real Org mode links there, meaning that Element API, Org roam and some other tools do not recognise them as links.

agenda on top of the cached data? , to instead expose an API to build the interface from a different data source

will org-roam’s caching model work at larger scales? rgrep isn’t magic, it’s literally just grep -r or recursive grep, something that all *NIX users are familiar with

org-roam’s functions are just a read-only interface on top of the database layer. how can users specify their own schema, when the schema and how the database is populated is very much tied to what’s being pulled out of each Org file?

should org-roam provide a core for managing metadata (including links) with APIs to build on top of that (like org-roam-buffer, dailies, agenda and other stuff) which could be shared either in the org-roam repository or separately.

CI/CD without continuous refactoring is digital equivalent of horading – @Grday_Booch

Test case - Lisp env for Emacs

You are doing n projects with conflicting deps,envs and due overlaps.

Say your make file for a lib/package has both internal and of course external conf

mySourceRegexes = [
   "^app.*$"
   "^.*\\.cabal$"
   "package.yaml"
 ];

Deps

Itself - (recursive) ¹

Let application or function to Compose everything else and return to self, add set of all the properties, itself, constraints , accessed dep paths to it, as your function composes everything (dep from self and returns everything to itself. Its like symlinking or man fetching clothes fromt the closet and wearing them.

the sub/supersets of parametrs , as it accesses them and fetches them

What does it call itself

stratified lambda calculus

Think about it

evaluation by reduction ie substituion - integration

confluence is related to convergence

It's somewhat fair to call it calulus, depending on how you see calculus

Bishop's

Russel's

HoTT and Topos

⊥ :≡ 0

T :≡ 1

P ∧ Q :≡ P ∗ Q

P ∨ Q :≡ || P + Q ||

P ⇒ Q :≡ P → Q

∀ (x : A) ⋅ P(x) :≡ ∏ (x:A) ⋅ P(x)

∃ (x : A) ⋅ P(x) :≡ || ∑ (x :A) . P(x) ||

Chesterton

a small circle is quite as infinite as a large circle

cauchy sequences does not have same topology as \R , it has topology of cantor space.

every cauchy real has a dedekind cut