# orderedItems[].content
Hi I am applying for work as a generalist #FunctionalPrograming out four any remote work I can do better , any career advice or job referral ll help
my #resume can be found at , open for DM mentions etc
#FediHire
https://cloud.disroot.org/s/S2wxLoQMeP kHZJ7

# orderedItems[].contentMap.en
Hi I am applying for work as a generalist #FunctionalPrograming out four any remote work I can do better , any career advice or job referral ll help
my #resume can be found at , open for DM mentions etc
#FediHire
https://cloud.disroot.org/s/S2wxLoQMeP kHZJ7

# orderedItems[].content
Life is too Short to not reason the way you spend time and clearly express what meaning you deduce out of your labor to price it

# orderedItems[].contentMap.en
Life is too Short to not reason the way you spend time and clearly express what meaning you deduce out of your labor to price it

# orderedItems[].content
Moreover I had rescued it with USB iso , when somehow some messed up ci script had changed the dotfiles dir's perms st root owned it not home user for main branch , unlike on the other branch .
While I should be known this a couple of years back , but then again , if you re a know it all at the time of starting it , why start it at all.
I won't hasitate to to say this month is the most frustrating and learning experience of mine with -nixos
Not to mention the cached profiles in devenv/direnv dirs in dotfiles

# orderedItems[].contentMap.en
Moreover I had rescued it with USB iso , when somehow some messed up ci script had changed the dotfiles dir's perms st root owned it not home user for main branch , unlike on the other branch .
While I should be known this a couple of years back , but then again , if you re a know it all at the time of starting it , why start it at all.
I won't hasitate to to say this month is the most frustrating and learning experience of mine with -nixos
Not to mention the cached profiles in devenv/direnv dirs in dotfiles

# orderedItems[].summary
Illusive idea if clarity when learning lambda calculus

# orderedItems[].content
At one point the term - stratified #lambdaclculus seemed so cryptic that I read entire book on that theory.
No it simply means , no universal quantifiers and hence no circular reasoning in logic , to me me.
Context - predicativ- ity
Moral - if a lot of time in progress is going on demystifying such pseudo cryptic terms in stead of asking well framed questions with well founded definitions , its time to step back / take a break a rethink the direction

Now unguided paper chasing is worse than learning from #ai , as it can give you even more misleading summary.

#puremath

# orderedItems[].contentMap.en
At one point the term - stratified #lambdaclculus seemed so cryptic that I read entire book on that theory.
No it simply means , no universal quantifiers and hence no circular reasoning in logic , to me me.
Context - predicativ- ity
Moral - if a lot of time in progress is going on demystifying such pseudo cryptic terms in stead of asking well framed questions with well founded definitions , its time to step back / take a break a rethink the direction

Now unguided paper chasing is worse than learning from #ai , as it can give you even more misleading summary.

#puremath

# orderedItems[].summary
I am not fully convinced here , maybe lazy eval is a cult

# orderedItems[].content
In a lazy evaluation scheme, the evaluation of an expression is deferred until the
value of the expression is actually needed elsewhere in the computation. That
is, the expression is evaluated on demand. This contrasts with what is called
eager evaluation in which an expression is evaluated as soon as its inputs are
available.
For example, if eager evaluation is used, an argument (which may be an arbi-
trary expression) of a function call is evaluated before the body of the function.
If lazy evaluation is used, the argument is not evaluated until the value is actu-
ally needed during the evaluation of the function body. If an argument’s value
is never needed, then the argument is expression is never evaluated.
Why should we care? Well, this facility allows programmers to construct and
use data structures that are conceptually unbounded or infinite in size. As
long as a program never actually needs to inspect the entire structure, then a
terminating computation is still possible.
For example, we might define the list of natural numbers as a list beginning
with 0, followed by the list formed by adding one to each element of the list of
natural numbers.
Lazy evaluation thus allows programmers to separate the data from the control.
They can define a data structure without having to worry about how it is
processed and they can define functions that manipulate the data structure
without having to worry about its size or how it is created. This ability to
separate the data from the control of processing enables programs to be highly
modular
#haskell
https://john.cs.olemiss.edu/~hcc/csci4 50/notes/haskell_notes.pdf

# orderedItems[].contentMap.en
In a lazy evaluation scheme, the evaluation of an expression is deferred until the
value of the expression is actually needed elsewhere in the computation. That
is, the expression is evaluated on demand. This contrasts with what is called
eager evaluation in which an expression is evaluated as soon as its inputs are
available.
For example, if eager evaluation is used, an argument (which may be an arbi-
trary expression) of a function call is evaluated before the body of the function.
If lazy evaluation is used, the argument is not evaluated until the value is actu-
ally needed during the evaluation of the function body. If an argument’s value
is never needed, then the argument is expression is never evaluated.
Why should we care? Well, this facility allows programmers to construct and
use data structures that are conceptually unbounded or infinite in size. As
long as a program never actually needs to inspect the entire structure, then a
terminating computation is still possible.
For example, we might define the list of natural numbers as a list beginning
with 0, followed by the list formed by adding one to each element of the list of
natural numbers.
Lazy evaluation thus allows programmers to separate the data from the control.
They can define a data structure without having to worry about how it is
processed and they can define functions that manipulate the data structure
without having to worry about its size or how it is created. This ability to
separate the data from the control of processing enables programs to be highly
modular
#haskell
https://john.cs.olemiss.edu/~hcc/csci4 50/notes/haskell_notes.pdf