Мир сегодня с "Юрий Подоляка"

Труха⚡️Україна

Карап чыгуу

Николаевский Ванёк

Карап чыгуу

Мир сегодня с "Юрий Подоляка"

Карап чыгуу

Труха⚡️Україна

Карап чыгуу

Николаевский Ванёк

Карап чыгуу

(φ (μ (λ)))

www.phimulambda.org
Uncovering underlying intersections between philosophy (φ), mathematics (μ) and logic (λ).
Other embeddings include:
- Computing
- Cognitive Science
- Linguistics
- Statistics

@DivyaRanjan1905

TGlist рейтинг

ТипАчык

Текшерүү

Текшерилбеген

Ишенимдүүлүк

Ишенимсиз

Орду

ТилиБашка

Канал түзүлгөн датаЛют 10, 2025

TGlistке кошулган дата

Трав 23, 2024

Мен каналдын ээсимин

Өзгөрүүлөр тарыхы

Тиркелген топ

λ-expressions

Telegram каналы (φ (μ (λ))) статистикасы

Толугураак

Катталгандар

585

24 саат00%Жума

61%Ай

438%

Цитация индекси

0

Эскерүүлөр0Каналдарда бөлүштү0Каналдарда эскерүүлөр0

1 посттун орточо көрүүлөрү

138

12 саат103

8.4%24 саат1380%48 саат1460%

Катышуу (ER)

2.9%

Кайра посттошту2Комментарийлер1Реакциялар2

Көрүүлөр боюнча катышуу (ERR)

23.59%

24 саат0%Жума0%Ай

2.45%

1 жарнама посттун орточо көрүүлөрү

111

1 саат4944.14%1 – 4 саат2724.32%4 - 24 саат3531.53%

Толугураак

Биздин ботту каналыңызга кошуп, анын аудиториясынын жынысын билүү.

Акыркы 24 саатта бардык посттор

0

Динамика

"(φ (μ (λ)))" тобундагы акыркы жазуулар

Бардык посттор

01.04.202518:27

Diﬀerential of a real-valued function at a point for vectors and operators.

From Alan Kennington's Differential Geometry Reconstructed: A Unified Systematic Framework

Кайра бөлүшүлгөн:

Books

31.03.202515:32

Кайра бөлүшүлгөн:

A Math Book

30.03.202520:09

https://www.coloradocollege.edu/newsevents/newsroom/professor-emeritus-of-mathematics-george-simmons-passes-away.html

29.03.202517:43

https://github.com/finalpatch/ob-glsl

28.03.202519:00

Emacs package from a friend to archive web pages into Org files:

https://github.com/nitincodery/org-dex.el

Chrome Extension:
https://github.com/nitincodery/org-dex.crx

Firefox Extension: https://github.com/nitincodery/org-dex.xpi

27.03.202523:36

https://mastodon.social/@organicmaps/114233788700982882

27.03.202515:50

Me and some OCaml friends did some discussion and comparison between implementations of a Segment Tree in Haskell and Reason/OCaml. We were mostly trying to analyze space & time complexity and the extent to which you can remain in pure functional realm or fall back to imperative design. It was fun, my implementation is here. And after the discussion I found two things that it lacks:

1. Not general enough: It works only on arrays of Int elements, and the combination operators it takes are rigidly stuck to the type (a -> a -> a) when one can simply do a Monoid.

2. Parent Reference: It uses the standard Data.Tree which does not provide any reference for the parent of a child node, thus you'd be tracing the patch from the root node and running in linear time O(n) when in an imperative language it'll simply take a reference and thus be constant time O(1).

While the solution to the first problem is to just use Monoid, the second one isn't that trivial. I forgot that there is a classic Functional Pearl that brought forth the idea of Zipper monad in Haskell, this allows you to locally look up in a general data structure in constant time. So I would probably go the path of that, and maybe also not use arrays and base the tree entirely on a list, since they are efficient in Haskell.

The Reason/OCaml implementation isn't yet public, but soon would be, during the discussion's stream, funnily enough the implementation developed into using for loops, which kind of defeats the point of doing functional programming. In the coming days we might improvise on the implementations and do a benchmark of their time complexity. I might also write a blogpost about Zipper and Segment Trees in Haskell. Segment trees are actually widely applied in computational geometry, and Berg, et.al Computational Geometry (1997) has a nice section (10.3) devoted to this. That was one of the references for my implementation.

For those who want to be part of the ongoing discussion or join next time, this happens at the discord server of Reason OCaml India.

27.03.202511:22

https://lemmy.world/post/27426660

27.03.202509:36

https://dyne.org/dynebolic/

26.03.202518:37

https://www.wired.com/story/forth-collapse-os-apocalypse-programming-language/

26.03.202512:02

In an OOPL data type definitions belong to objects. So I can’t find all the data type definition in one place. In Erlang or C I can define all my data types in a single include file or data dictionary. In an OOPL I can’t - the data type definitions are spread out all over the place.

Let me give an example of this. Suppose I want to define a ubiquitous data structure. ubiquitous data type is a data type that occurs “all over the place” in a system.

As lisp programmers have know for a long time it is better to have a smallish number of ubiquitous data types and a large number of small functions that work on them, than to have a large number of data types and a small number of functions that work on them.

A ubiquitous data structure is something like a linked list, or an array or a hash table or a more advanced object like a time or date or filename.

In an OOPL I have to choose some base object in which I will define the ubiquitous data structure, all other objects that want to use this data structure must inherit this object. Suppose now I want to create some “time” object, where does this belong and in which object…

Joe Armstrong, Why OO Sucks

25.03.202522:16

While my DNS server and Codeberg fix the issues, here's the Org file for the blogpost.

25.03.202521:46

Since this package is almost entirely based on using dynamic modules in Emacs, I wrote a detailed blogpost on how this works in Emacs and why it should be used more.

I'll soon add RSS support for the site. It is based on Pollen, a Racket DSL for typography, and in my opinion, supersedes all SSGs. Source is available.

https://www.phimulambda.org/blog/emacs-dynamic-module.html

25.03.202512:00

https://en.wikipedia.org/wiki/Sleeping_Beauty_problem

25.03.202508:52

David Turner, Total Functional Programming, Journal of Universal Computer Science (2004)

Бардык посттор

Эч нерсе табылган жок 😢

Толугураак

Рекорддор

01.04.202523:59

585Катталгандар

19.05.202423:59

0Цитация индекси

30.09.202423:59

2631 посттун көрүүлөрү

15.03.202512:58

1661 жарнама посттун көрүүлөрү

17.02.202517:44

32.63%ER

28.09.202423:59

131.50%ERR

Өнүгүү

Толугураак

Катталуучулар

Citation индекси

Бир посттун көрүүсү

Жарнамалык посттун көрүүсү

ERR

Толугураак

(φ (μ (λ))) популярдуу жазуулары

Бардык посттор

26.03.202512:02

24.03.202514:36

Got it to be stable, and found a way to do superfast scrolling.

Most of the magic is done by C + MuPDF and Emacs' SVG rendering support. Would soon release for ELPA as I finish EPUB support.

Кайра бөлүшүлгөн:

Books

31.03.202515:32

25.03.202512:00

https://en.wikipedia.org/wiki/Sleeping_Beauty_problem

27.03.202515:50

28.03.202519:00

26.03.202518:37

https://www.wired.com/story/forth-collapse-os-apocalypse-programming-language/

01.04.202518:27

Diﬀerential of a real-valued function at a point for vectors and operators.

From Alan Kennington's Differential Geometry Reconstructed: A Unified Systematic Framework