HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
samsquire
ideas4
HISTORICAL RECORD2022–2023
samsquire / ideas4 · Not publicly available

ideas4

Discover this repository through its Hacker News conversations.

3Distinct people
47Mentions
1Explicit recommenders
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A public description has not been verified.

Where it is used

No documented product use has been verified yet.

What people are saying

I love these words "As I continued that work, I've also started talking about the feasibility of creating a supercompiler." and thoughts already. One of my ideas is a…

samsquire used a recommendation phrase. One indexed comment matches. This is a phrase match, not a verdict.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

Mentioned in the same Hacker News threads. That is not proof they are substitutes.

This week on Hacker News

Nov 9–Nov 16 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/16/2026, 1:56:48 AM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by month47 dated mentions

Observed mentions: 2022-05-30 03:50:01 UTC to 2023-08-18 15:43:39 UTC.

02462022-05-01 00:00:00 UTC to 2022-06-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 commentsMay 20222022-06-01 00:00:00 UTC to 2022-07-01 00:00:00 UTC (exclusive): 5 mentions; 0 submissions, 5 comments2022-07-01 00:00:00 UTC to 2022-08-01 00:00:00 UTC (exclusive): 6 mentions; 0 submissions, 6 comments2022-08-01 00:00:00 UTC to 2022-09-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2022-09-01 00:00:00 UTC to 2022-10-01 00:00:00 UTC (exclusive): 5 mentions; 0 submissions, 5 comments2022-10-01 00:00:00 UTC to 2022-11-01 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2022-11-01 00:00:00 UTC to 2022-12-01 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 comments2022-12-01 00:00:00 UTC to 2023-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 commentsDec 20222023-01-01 00:00:00 UTC to 2023-02-01 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2023-02-01 00:00:00 UTC to 2023-03-01 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 comments2023-03-01 00:00:00 UTC to 2023-04-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-04-01 00:00:00 UTC to 2023-05-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2023-05-01 00:00:00 UTC to 2023-06-01 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 comments2023-06-01 00:00:00 UTC to 2023-07-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2023-07-01 00:00:00 UTC to 2023-08-01 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 comments2023-08-01 00:00:00 UTC to 2023-09-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsAug 2023

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
May 20222022-05-01 00:00:00 UTC2022-06-01 00:00:00 UTC202
Jun 20222022-06-01 00:00:00 UTC2022-07-01 00:00:00 UTC505
Jul 20222022-07-01 00:00:00 UTC2022-08-01 00:00:00 UTC606
Aug 20222022-08-01 00:00:00 UTC2022-09-01 00:00:00 UTC202
Sep 20222022-09-01 00:00:00 UTC2022-10-01 00:00:00 UTC505
Oct 20222022-10-01 00:00:00 UTC2022-11-01 00:00:00 UTC404
Nov 20222022-11-01 00:00:00 UTC2022-12-01 00:00:00 UTC303
Dec 20222022-12-01 00:00:00 UTC2023-01-01 00:00:00 UTC202
Jan 20232023-01-01 00:00:00 UTC2023-02-01 00:00:00 UTC404
Feb 20232023-02-01 00:00:00 UTC2023-03-01 00:00:00 UTC404
Mar 20232023-03-01 00:00:00 UTC2023-04-01 00:00:00 UTC000
Apr 20232023-04-01 00:00:00 UTC2023-05-01 00:00:00 UTC202
May 20232023-05-01 00:00:00 UTC2023-06-01 00:00:00 UTC303
Jun 20232023-06-01 00:00:00 UTC2023-07-01 00:00:00 UTC101
Jul 20232023-07-01 00:00:00 UTC2023-08-01 00:00:00 UTC303
Aug 20232023-08-01 00:00:00 UTC2023-09-01 00:00:00 UTC101

What Hacker News says

2 sources
Great comment! >I think late architecture is orthogonal to functional, imperative Absolutely. From a truly architectural view, procedural, functional, and method-oriented (current OO) are really only variations on the call/return architectural style. Good and sometimes important distinctions, but not really that far apart. They are very much about computing, results from inputs. That is an appropriate architecture for fewer and fewer programs. See Why Architecture Oriented Programming matters https://blog.metaobject.com/2019/02/why-architecture-oriente... and Can Programmers Escape the Gentle Tyranny of call/return? https://2020.programming-conference.org/details/salon-2020-p... > its solution is higher level than even functional programming Yes. Well, functional actually gets most of its utility from being lower level as far as para
Read the rest
digms go (less powerful). But yes. > and more abstract No. Well, yes, if expressed with current programming languages. But that's part of the problem set, not part of the solution set. We should be able to express our architectures less abstractly, more concretely, but for that we need linguistic support. Which is why I am working on that: http://objective.st > I want software architecture to be cheap and easy to change without breaking any existing behaviours. I don't know much research on this subject. There was quite a bit of research at CMU, for example on packaging mismatch. Famous paper Architectural Mismatch, Why Reuse is so hard, and the 10 year follow up in 2009: Architectural Mismatch: Why Reuse is Still So Hard https://repository.upenn.edu/cgi/viewcontent.cgi?article=107...* Not much has changed since. > https://github.com/samsquire/ideas4 > https://devops-pipeline.com Will check those out. Dataflow is definitely a big part of it, with the extension of dataflow constraints (make, spreadsheets, "FRP"/"Rx"). But so is in-process REST with Storage Combinators! And breaking down barriers between scripting and "real" programming.
In Late Architecture with Functional Programming
I think late architecture is orthogonal to functional, imperative and its solution is higher level than even functional programming and more abstract. I think the solution requires a new class of programming that is beyond APIs and functions. It's the realm of relationships and pluralities, scheduling, understanding of meaning. (The realm of LLMs) I want software architecture to be cheap and easy to change without breaking any existing behaviours. I don't know much research on this subject. I think APIs are the wrong thing to code against, because APIs are tied to architecture. Some codebases are millions of lines big, it is extremely difficult to change a codebase's architecture when it is that big. It's either a lot of work or an extremely complicated program to rewrite sourcecode of that magnitude that isn't throwaway and not general p
Read the rest
urpose transformations. If you have a codebase that has a client per thread and you want to refactor it to multiplex clients over threads. Or you want to add load shedding or backpressure to your microservice architecture, you have a large amount of work to do. If you want to add a field to a message or underlying library that your every microservice architecture uses, you have a lot of pain to go through. If you want to change the workflow of a digitised business procedure you have a LOT of refactoring to do. My ideas on the solution to this problem include: - Vector programming: represent software architecture as vector embeddings, code against sequences of vectors that are arranged into relationships and then the space where the vectors reside is concretised - Compositional behavioural typing: We need some way of combining behaviours together, composing the code of functions such that code is interleaved rather than chaining together functions. In most programming languages I know, data is typed, not the behaviour, and behaviour cannot be changed without changing the code. I think behaviour is more useful to type than data. Composing behaviour is not g(f(x)), it's taking arbitrary parts of the innerworkings of f and g and applying behaviours to their mechanisms. Inheritance doesn't do it properly, because you have to rewrite functions to replicate the original behaviour with a tweak. React hooks don't do it. It's the missing idea of computer science. My dream is that classes are compatible if you can provide a mapping from the innerworkings of one class to another class and the code can seamlessly compose without rewriting. And it be open to extension. It's like metaprogramming for behaviour rather than types. Code that that matches a "dispatcher" interface, automatically inferred by the compiler, and I can can insert a Load balancer or an ACL arbitrarily in the stack, anywhere. I can change the plurality (one-to-many, many-to-one) of architectural relationships, such as insert a hierarchy of load balancers here between these objects. I can make my software internet scalable, multiregion, multithreaded by adding to the diagram. I can see the architecture as a giant relational diagram data structure and mutate it directly and cheaply and without breaking any existing behaviour. I've been journalling about this on github.com/samsquire/ideas4 I also wrote https://devops-pipeline.com which is an dataflow/diagram based perspective of software infrastructure.
In Late Architecture with Functional Programming

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.