HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
alantech
marsha
Python2023–2023
alantech / marsha

marsha

Marsha is a functional, higher-level, English-based programming language that gets compiled into tested Python software by an LLM

2Distinct people
8Mentions
0Explicit recommenders
466GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Marsha is a functional, higher-level, English-based programming language that gets compiled into tested Python software by an LLM

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

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

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 9–Nov 16 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/16/2026, 8:59:02 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 hour8 dated mentions

Observed mentions: 2023-07-25 15:43:56 UTC to 2023-07-26 06:18:11 UTC.

0122023-07-25 15:00:00 UTC to 2023-07-25 16:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsJul 25, 15:002023-07-25 16:00:00 UTC to 2023-07-25 17:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-07-25 17:00:00 UTC to 2023-07-25 18:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2023-07-25 18:00:00 UTC to 2023-07-25 19:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2023-07-25 19:00:00 UTC to 2023-07-25 20:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-07-25 20:00:00 UTC to 2023-07-25 21:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-07-25 21:00:00 UTC to 2023-07-25 22:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-07-25 22:00:00 UTC to 2023-07-25 23:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsJul 25, 22:002023-07-25 23:00:00 UTC to 2023-07-26 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-07-26 00:00:00 UTC to 2023-07-26 01:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-07-26 01:00:00 UTC to 2023-07-26 02:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2023-07-26 02:00:00 UTC to 2023-07-26 03:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-07-26 03:00:00 UTC to 2023-07-26 04:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-07-26 04:00:00 UTC to 2023-07-26 05:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-07-26 05:00:00 UTC to 2023-07-26 06:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-07-26 06:00:00 UTC to 2023-07-26 07:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsJul 26, 06:00

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
Jul 25, 15:002023-07-25 15:00:00 UTC2023-07-25 16:00:00 UTC110
Jul 25, 16:002023-07-25 16:00:00 UTC2023-07-25 17:00:00 UTC000
Jul 25, 17:002023-07-25 17:00:00 UTC2023-07-25 18:00:00 UTC202
Jul 25, 18:002023-07-25 18:00:00 UTC2023-07-25 19:00:00 UTC202
Jul 25, 19:002023-07-25 19:00:00 UTC2023-07-25 20:00:00 UTC000
Jul 25, 20:002023-07-25 20:00:00 UTC2023-07-25 21:00:00 UTC000
Jul 25, 21:002023-07-25 21:00:00 UTC2023-07-25 22:00:00 UTC000
Jul 25, 22:002023-07-25 22:00:00 UTC2023-07-25 23:00:00 UTC101
Jul 25, 23:002023-07-25 23:00:00 UTC2023-07-26 00:00:00 UTC000
Jul 26, 00:002023-07-26 00:00:00 UTC2023-07-26 01:00:00 UTC000
Jul 26, 01:002023-07-26 01:00:00 UTC2023-07-26 02:00:00 UTC101
Jul 26, 02:002023-07-26 02:00:00 UTC2023-07-26 03:00:00 UTC000
Jul 26, 03:002023-07-26 03:00:00 UTC2023-07-26 04:00:00 UTC000
Jul 26, 04:002023-07-26 04:00:00 UTC2023-07-26 05:00:00 UTC000
Jul 26, 05:002023-07-26 05:00:00 UTC2023-07-26 06:00:00 UTC000
Jul 26, 06:002023-07-26 06:00:00 UTC2023-07-26 07:00:00 UTC101

What Hacker News says

1 sources
I don't believe that I can change your mind on this, so I didn't intend to respond, but as this is the top comment, I do want to provide a rebuttal on why we do think this is actually a programming language, that the code we have written is actually a compiler, and why Marsha is a useful exploration of the programming language design space. First, a programming language is just a syntax to describe functionality that could be turned into an actual program. Lisp[1] was defined in 1958 but didn't have a full compiler until 1962. Was it not a programming language in the intervening 4 years? Marsha does not fall into this, since it can already generate working code, but the bar for what is a programming language, I believe, is lower than most would immediately think. Second, a programming language does not need to be imperative to be a progra
Read the rest
mming language, or languages like Lean[2] that have you write proofs that the compiler then figures out how to generate the code to fulfill would not be programming languages. Lean, Coq, and other such languages are much more technically impressive than Marsha, true, but they share the property you describe the properties a function should have and then the compiler generates the program that fulfills those properties. Marsha differs from these Proof-based languages in that poor specificity still produces some sort of program instead of a compilation error, which makes it sort of like Javascript that will do something with the code you write as long as it is syntactically valid. This is not a desirable property of Marsha, but it is a trade-off that in practice makes it more immediately usable to a larger number of people than Lean or Coq, because the skill level required is lower. This is also, as you allude to, the current state of the world in most software development -- project managers come up with high-level requirements for new features, technical leads on engineering teams convert this into tasks and requirements for individual contributors who then write the code and tests which are then peer reviewed by the team as a sanity check and then committed. This process may or may not cover all situations and the specifications at all levels are likely not as rigorous as what Lean would require of you. Marsha mimics this process, starting from the tech lead level and bleeding into the individual contributor level. The type and function descriptions are analogous to the tech lead requirements and the examples are analogous to the test suite the individual contributor would write. Just like in real world development, if these are not well specified, the resulting code will likely have logic bugs that would need to be addressed with a stricter definition and improved test cases. The compiler consumes this definition into an AST[3], walks the tree to generate intermediate forms, and generates an output in a format that can be executed by a computer. Some use "transpiler" for a compiler that targets another language, but that is a subset of compilers, not a separate kind of tool, in my opinion, or the Java compiler would be a "transpiler" for the JVM bytecode format that is also not directly executable by a computer. We are still in the very early stages with Marsha and agree that more syntax could be helpful -- we already have 4 different syntactic components to Marsha versus the fully open-ended text entry behavior of Github Copilot or ChatGPT. But what makes Marsha interesting (to me) is that it makes it possible to explore a totally new dimension in programming language design: the formalization of the syntax to define a program itself. In many papers on new algorithms, the logic is often described in a human-readable list of steps without the hard specificity of programming languages, improving the ability of the reader to understand the core of the algorithm, rather than getting bogged down in the implementation details of this or that programming language. There is still a formalism, but it differs from that of traditional programming languages, and Marsha lets you work with your computer in a similar way. Are there cases where this is a bad idea? Absolutely. Just like there are cases where writing your code in Python is a bad idea versus writing it in Rust. There is no perfect programming language useful for all scenarios, and probably never will exist. But there will be a subset of situations where the trade-offs Marsha provides makes sense. By being more forgiving than even the most forgiving interpreted languages out there, Marsha is in a good position to fill that niche if the primary barrier is difficulty. [1]: https://en.wikipedia.org/wiki/Lisp_(programming_language)#Hi... [2]: https://en.wikipedia.org/wiki/Lean_(proof_assistant) [3]: https://github.com/alantech/marsha/blob/main/marsha/parse.py...
In Show HN: Marsha – An LLM-Based Programming Language

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.