Mohammad Alaggan, Ph.D.

My handle on bsky is malaggan

I used this wiki in 2004

Boost Blueprint 054: Boost.Sort spreadsort is a hybrid radix/comparison sort that exploits key type to hit near-linear complexity. Same interface as std::sort, measurably faster Also in the box: pdqsort for pathological distributions, spinsort for nearly-sorted data, flat_stable_sort for stable sorting with minimal memory One header. Four algorithms. Pick the one your data needs Level up your C++ architecture. Follow @Boost_Libraries for the #BoostBlueprint series #cpp

There is a solution against slow syscalls - to convert your service into a unikernel similar to @nanovms ( nanovms.com ) or unikraft ( unikraft.org ). Then syscalls are replaced with regular function calls with the minimum overhead. This allows achieving significant performance boost in busy services - hackernoon.com/faster-than-li… . If you aren't familiar with unikernels, I suggest practicing the following great tutorial - labs.iximiuz.com/tutorials/unik…

Z3! You're on WATCH! Latest update to lean.py is a drop in replacement for Z3py! Everyone's trying to put SMT solvers in their proof assistant, how about putting a prover in your solver? here's the crazy thing: if you know Z3, you KNOW lean.py.

C++23 introduced 'deducing this'. It means I can fully use my 10 years of accumulated FP knowledge and finally write self-recursive lambdas easily. The world is not ready for the kind of FP I'm going to unleash.

بفضل الله أطلقنا مجرّة على الـ IOS والـ Android 🚀 أول منصة وتطبيق عربي للمطوّرين لمتابعة أخبار البرمجة والتقنية من المصادر العربية والعالمية وكمان مشاركة وتبادل الخبرات! الفكرة ببساطة إننا نستحق إن يكون عندنا منصة عربية مبنية خصيصًا لاحتياجتنا وبتسهل علينا الوصول للمستجدات اللي بتطرأ في المجال بشكل سريع وبسهولة، خصوصًا إن البدايل المتاحة غير مرغوبة بالمرة! مجرّة بتجمع أخبار وأدوات ومقالات من +80 مصدر عربي وعالمي في خلاصة يومية مخصّصة لاهتماماتك. ومدعومة بأدوات الذكاء الاصطناعي علشان تساعدك تطلع بأكبر استفادة ممكنة ⚡ طب ايه اللي بيميّزها؟ 🎯 تقدر تبني مجرتك بالشكل اللي يناسبك وتشوف المقالات اللي تهمّك فعلاً من المصادر المتاحة والوسوم 🤖 أكتر من +5 أوامر مدعومة بالذكاء الاصطناعي بالعربي — تلخيص، وتبسيط، وأمثلة عملية وتطبيقية من أي مقال، ونقد بنّاء بضغطة واحدة 🌟 الكوكبات — أكتر من +25 كوكبة في مجالات مختلفة متخصّصة للمطوّرين (تقدر تفكر فيها كـ subreddits للمطوّرين العرب) لمشاركة وتبادل الخبرات 🔥 سلسلة القراءة — حافظ على عادة القراءة اليومية بالإضافة لنظام Gamification للتحفيز و Reputation Scores 🏆 لوحة الصدارة والإنجازات 💳 بطاقتك المجرّية — بطاقة هويتك كمطوّر ، وتقدر تشاركها على GitHub و X 💎 تجربة استخدام مميزة للمطورين ومدعومة بالكامل بالعربي بالإضافة لإنكوا تقدروا تحولوا كل tap في المتصفح بتاعكوا لصفحة مليانة بآخر المستجدات من خلال Chrome Extension 🎁 المنصة والتطبيق مبنيين لدعم المجتمع التقني العربي وكلهم مجانيين بالكامل، وإن شاء الله فيه أفكار كتير للتطوير منهم ، بالإضافة لإننا فتحنا باب الشراكات والرعاة فاللي حابب يشاركنا ويكون جزء من رحلة مجرّة هنكون سعداء جدًا بده .. هستنى أعرف رأيكوا خصوصًا بعد ما تجربوا التطبيق على الموبايل .. وطبعًا ده هيساعد باننا نحسن للأفضل 💪 تقدروا دلوقتي تنضموا لأكتر من +2,350 مطور عربي .. ساعدونا في نشرها علشان مجرتنا تكبر والفايدة تعم على الجميع 💜

This makes me think of Chess vs Computer Vision. For computers, chess was thought of as hard, and computer vision as easy, but it turned out to be the opposite for similar reasons as the feedback hypothesis.

When I publish a piece of writing under my name (e.g. in my blog, or a document at work), I want the reader to know that I deeply understand and own what I wrote. That I respect their time and effort. In exchange, I want them to be fully and deeply engaged with reading.

圏論的量子力学のいい点をあげるとたくさんあると思うけど、 パッと思い浮かぶのは ←これ　が　これ→　になるところですかねぇ

@EnricPastor4 @TrisH0x2A I didn't claim it's new. I personally taught using PintOS when I was an assistant professor 14 years ago. I did my own from-scratch kernel 23 years ago. Your point being?

@TrisH0x2A @m_aggan We did that with minix and others 30 years ago. Nothing new.

MIT teaches operating systems by giving students a complete Unix like kernel and asking them to modify it it is called xv6 and is about 6000 lines of C a reimplementation inspired by Unix Version 6 from 1975 rewritten in modern C for x86 multiprocessor processes system calls virtual memory and filesystem are all there and small enough to read end to end in a weekend this is what you study to understand how operating systems actually work not just how they are described

New TIL: I figured out how to use my LLM CLI tool in a shebang line, which means you can write executable scripts in English, or hook up more complex scripts with a snippet of YAML template

On vsyscalls and the vDSO lwn.net/Articles/44652… Implementing virtual system calls lwn.net/Articles/61580… Creating a vDSO: the Colonel's Other Chicken web.archive.org/web/2024011323… Linux syscall, vsyscall, and vDSO... Oh My! web.archive.org/web/2023112503…

To whom it may concern NanoProof.hs: the smallest viable proof checker I posted something similar before, but it was more of a research experiment with weird λ-encoded shit, than something usable. This new repo contains a tiny, 1000-LOC Haskell self-contained proof checker that you can actually use to prove arbitrary theorems. The language has just 6 base types: → Empty (`⊥`): type with 0 elems → Unit (`⊤`): type with 1 elem (`()`) → Bool (`𝔹`): type with 2 elems (`0 | 1`) → Sigma (`ΣA.B`): dependent pairs (`(x,y)`) → Pi (`ΠA.B`): dependent functions (`λx.f`) → Equal (`a==b`): propositional equality (`{==}`) That's all you need. Each of these is needed, as it introduces something fundamental. The file includes a parser, stringifier, equality, a bidirectional type checker, and a simple CLI. It also includes first-class reduction relations, which allow us to pretty print goas just like Lean. You can place '()' in a position to inspect the current context and goal there. I also include a demo proof for the commutation of multiplication.

The most challenging part of writing "The Secret Life of Circuits" wasn't the writing process. It was crafting over 290 full-color illustrations on my own design. I think they set the book apart. For a no-strings-attached sample chapter, check out: lcamtuf.coredump.cx/electronics/pr…

5 lines of python. an economic game with complex equilibria. Our new language Pact uses Choreographies with game theory, allows expressing economic transactions in lines. So simple an agent could write it Claude? make me some money. and make no mistakes arxiv.org/abs/2605.03143

Python doesn't have a refinement type system--except now it does! Combining Lean with @BasisOrg's effectful library for algebraic effects in Python, we can easily verify real code. Python constructs a symbolic expression and sends it to Lean to check. Proof done? Code verified.

Many #LeanLang users were first introduced to Lean via the Natural Number Game, a gamified approach to learning mathematical proofs developed by Kevin Buzzard. The Lean Game Server now hosts 8 games, including real analysis, linear algebra, and introduction to proofs. Open source, so educators can build their own too. Explore: adam.math.hhu.de #FormalMathematics #MathEducation #OpenSource

someone wrote a 680 page interactive book on cs algorithms

There’s a famous Usenet story about a programmer (Mel) who refused higher level abstractions. It was the late 1950s, and even in that era, Mel was…well today we’d call him a boomer. Mel only wrote in raw hexadecimal. He didn’t approve of compilers, and refused to use optimizing assemblers. "You never know where it's going to put things”, he said. Everyone else in the company was moving on to FORTRAN, and they didn’t understand why Mel was so stubborn about using new tools. He *loved* self-modifying code. “If a program can’t rewrite its own code”, he asked, “what good is it?” Mel eventually left the company, and other engineers were tasked with understanding what was left. Mel’s hand-optimized routines always beat the assemblers; but some of it looked absolutely bizarre. One engineer took ~2 weeks to understand why there were loops with no exit condition…yet the program worked fine. I won’t spoil all the details, you should really read it, it’s short. But it’s a fantastic piece on “what defines a real programmer?”…which is becoming increasingly relevant in this vibe-coded era. I strive to understand computers as deeply as Mel! If we aren’t careful, we’re going to lose the “Mels” of this world to time. That’s part of why I go so deep in my youtube videos. I hope that younger viewers are genuinely fascinated by the inner workings of our machines, instead of handing everything off to higher abstractions.