odipar

8 ms·

1.
by odipar 1y ago
I was once into 68k so I may be rusty, but shouldn't it be move.w d1,(a0)+ (increment the target address after each step)?
2.
by odipar 1y ago
The most impressive demo ever: https://www.youtube.com/watch?v=mgXRXDfQ0xw in only 4kb! Image seeing this demo back in the 80's: it would be close to sorcery!
3.
by odipar 2y ago
Identity doesn't imply 'value' equality, that's the whole point of mutability! Conversely, two objects can have the same 'value' while having different identities. Values and objects are different beasts.
4.
by odipar 2y ago
My take is that identity doesn't imply mutability, if you version objects. It could well be that your are looking at an old version of an object, using its unique identity combined with its version (number). Objects refer to other ob
5.
by odipar 3y ago
CodeQL is another datalog with the domain of code analysis as its use case. Too bad you cannot create a custom fact database with CodeQL. Otherwise, the implementation of CodeQL is pretty advanced and efficient.
6.
by odipar 3y ago
Okasaki got me interested in confluently persistent data-structures, way back in the 2000s. They seem magical! To be able to combine data from the past with current data, efficiently! They are almost always trees, with the exception of skip
7.
by odipar 4y ago
As always it is the journey that matters (writing), not the outcome (the essay). For example, students could record their writing of an essay with a keylogger or something. Additionally - with the use of some advanced zero-knowledge algos o
8.
by odipar 4y ago
SeqHash This data structure is an immutable, uniquely represented Sequence ADS (Authenticated Data Structure) with various interesting use cases. It is based on a novel hashing scheme that was first introduced with SeqHash. See http:/
9.
by odipar 4y ago
big brain really like post. lesson learn is deep! "(best grug brain able to herd multiple big brain in right direction and produce many complexity demon trap crystals, large shiney rock pile!)"
10.
by odipar 4y ago
I also personally think CUE hits a sweet spot. The union (pun intended) between types and values (both sets) is really a game changer! CUE is indeed not trivial to implement, especially its intricate semantics are tricky. I work an a CUE al
11.
by odipar 4y ago
Visual is all nice and all, but I really fancy the 'computational' model of spreadsheets which is very easy to learn and apply IMO. My latest find is the CUE language, which I believe is the first 'typed' version of a sp
12.
by odipar 5y ago
Another interesting fixed-point (16 bit) division 'algorithm' is with log and exp tables, with a well chosen base :). consider a and b being 16 bit fixed-points (at the 10 bit position) then: c = a/b is: al = log(a) (log tabl
13.
by odipar 5y ago
No Stinking Loops! http://www.nsl.com
14.
by odipar 5y ago
Is it just me or are Java Modules hard to create and use? I found it pretty confusing to get them to 'work', especially with libraries that are not module enabled. Also, there is not support for Java Modules for Scala nor Kotlin.
15.
by odipar 5y ago
Yep, CTEs are a huge boon to structure your SQL - use them where you can.
16.
by odipar 5y ago
Yes I concur: CTEs is closer to the spirit of relational algebra: every step/expression should yield a table/relation. As data munging is about combining/correlating/sorting/grouping data, why not have a sound (bag)
17.
by odipar 5y ago
My first encounter with 'SQL' was a course on relational algebra that was taught at my university. It started out with defining relations as a mathematical construct, and continued with various operators on such relations. Then th
18.
by odipar 5y ago
hey, I like your work on Paranoid Scientist. I've never come across hyper-properties: is this something you invented? Regarding hyper-properties: I assume they only work on immutable data values, otherwise it would be hard to manage hi
19.
by odipar 5y ago
I think immutability (or immutable state) adds one big advantage over mutable state: you have access to previous state(s) and the current state. Immutability is very convenient for checking post-conditions that compare previous states and t
20.
by odipar 5y ago
self-plug: you may want to checkout Manikin: it is very similar to Goblins, but with a clear transactional model. https://odipar.github.io/manikin
21.
by odipar 5y ago
Definition of a professional: "engaged in a specified activity as one's main paid occupation rather than as a pastime". I wouldn't call fixing azure pipelines without any professional debugging tools a pastime activi
22.
by odipar 5y ago
I really like Eric's work, especially "From Boolean Algebra to Unified Algebra". His algebraic approach towards building software is really refreshing as it starts with the absolute basics and then slowly builds to a whole fr
23.
by odipar 5y ago
Yed has been serving me for almost 15 years. I think yed's layout algo's are the best in the industry. Also, the extensibility is great (even in the free versions).
24.
by odipar 5y ago
I want more formal architecture diagrams: how would they look like? I also want to know whether my architecture diagram is any good? Is my diagram too detailed, too abstract? Are there any objective measures, or is it all heuristics? That s
25.
by odipar 5y ago
Managing state in (standard) FP doesn't compose that well. Lenses look like a solution to transition 'deep' immutable state, but I find them cumbersome: YMMV. Object Orientation has excellent composability with regards to sta
26.
by odipar 5y ago
I always was a Sinclair guy, even developed some cracking (tape copier) software back in `80s (youth crime, I know). I also had friends who owned a C64. Someday, a friend let me listen to another 1 bit sound that was produced by ..... the C
27.
by odipar 5y ago
I've come full cycle: 0) Procedural 1) OO 2) FP 3) Really started to dislike mutability 4) Developed various FP frameworks 5) Back to pure (immutable!) OO and messages!
28.
by odipar 5y ago
Thanks for the reply! Unfortunately, persistent data structures tend to produce (short-lived) garbage which the JVM is very good at collecting! So yes, Clojure benefits immensely from the JVM. It is also an interesting research topic whethe
29.
by odipar 5y ago
I like your response, and yes, it was a major oversimplification and I'm sorry for that. Indeed, it is always about design choices and trade-offs. I can see why BLAS code is important and why Julia is an optimal choice for computation
30.
by odipar 5y ago
I don't think you can allocate immutable data structures on the stack. I've never seen a 10 million entry immutable set on the stack but I could be wrong.

More ›