HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
pseudo-lang
pseudo
Python2016–2016
pseudo-lang / pseudo

pseudo

transpile algorithms/libs to idiomatic JS, Go, C#, Ruby

4Distinct people
6Mentions
0Explicit recommenders
687GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

transpile algorithms/libs to idiomatic JS, Go, C#, Ruby

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 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:03:16 PM 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 3-hour interval6 dated mentions

Observed mentions: 2016-03-11 22:19:08 UTC to 2016-03-14 10:14:31 UTC.

01232016-03-11 21:00:00 UTC to 2016-03-12 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsMar 11, 21:002016-03-12 00:00:00 UTC to 2016-03-12 03:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-12 03:00:00 UTC to 2016-03-12 06:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-12 06:00:00 UTC to 2016-03-12 09:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-12 09:00:00 UTC to 2016-03-12 12:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-12 12:00:00 UTC to 2016-03-12 15:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-12 15:00:00 UTC to 2016-03-12 18:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-12 18:00:00 UTC to 2016-03-12 21:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-12 21:00:00 UTC to 2016-03-13 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-13 00:00:00 UTC to 2016-03-13 03:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-13 03:00:00 UTC to 2016-03-13 06:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsMar 13, 03:002016-03-13 06:00:00 UTC to 2016-03-13 09:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-13 09:00:00 UTC to 2016-03-13 12:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-13 12:00:00 UTC to 2016-03-13 15:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-13 15:00:00 UTC to 2016-03-13 18:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-13 18:00:00 UTC to 2016-03-13 21:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 comments2016-03-13 21:00:00 UTC to 2016-03-14 00:00:00 UTC (exclusive): 3 mentions; 0 submissions, 3 comments2016-03-14 00:00:00 UTC to 2016-03-14 03:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-14 03:00:00 UTC to 2016-03-14 06:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-14 06:00:00 UTC to 2016-03-14 09:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-03-14 09:00:00 UTC to 2016-03-14 12:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsMar 14, 09: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
Mar 11, 21:002016-03-11 21:00:00 UTC2016-03-12 00:00:00 UTC101
Mar 12, 00:002016-03-12 00:00:00 UTC2016-03-12 03:00:00 UTC000
Mar 12, 03:002016-03-12 03:00:00 UTC2016-03-12 06:00:00 UTC000
Mar 12, 06:002016-03-12 06:00:00 UTC2016-03-12 09:00:00 UTC000
Mar 12, 09:002016-03-12 09:00:00 UTC2016-03-12 12:00:00 UTC000
Mar 12, 12:002016-03-12 12:00:00 UTC2016-03-12 15:00:00 UTC000
Mar 12, 15:002016-03-12 15:00:00 UTC2016-03-12 18:00:00 UTC000
Mar 12, 18:002016-03-12 18:00:00 UTC2016-03-12 21:00:00 UTC000
Mar 12, 21:002016-03-12 21:00:00 UTC2016-03-13 00:00:00 UTC000
Mar 13, 00:002016-03-13 00:00:00 UTC2016-03-13 03:00:00 UTC000
Mar 13, 03:002016-03-13 03:00:00 UTC2016-03-13 06:00:00 UTC000
Mar 13, 06:002016-03-13 06:00:00 UTC2016-03-13 09:00:00 UTC000
Mar 13, 09:002016-03-13 09:00:00 UTC2016-03-13 12:00:00 UTC000
Mar 13, 12:002016-03-13 12:00:00 UTC2016-03-13 15:00:00 UTC000
Mar 13, 15:002016-03-13 15:00:00 UTC2016-03-13 18:00:00 UTC000
Mar 13, 18:002016-03-13 18:00:00 UTC2016-03-13 21:00:00 UTC110
Mar 13, 21:002016-03-13 21:00:00 UTC2016-03-14 00:00:00 UTC303
Mar 14, 00:002016-03-14 00:00:00 UTC2016-03-14 03:00:00 UTC000
Mar 14, 03:002016-03-14 03:00:00 UTC2016-03-14 06:00:00 UTC000
Mar 14, 06:002016-03-14 06:00:00 UTC2016-03-14 09:00:00 UTC000
Mar 14, 09:002016-03-14 09:00:00 UTC2016-03-14 12:00:00 UTC101

What Hacker News says

6 sources
Thank you. The goal of Pseudo is to create idiomatic and readable code in the target language, it should look exactly as a human wrote it in order to be useful for bootstrapping codebases in other languages or maintaining code in several languages(basically for cases when developers would continue working on the generated code) Haxe's output isn't alien or too-machine-translated-like, but it's not optimized for that goal too. Pseudo's intermediate format is `pseudo AST`, and it's supposed to be a target for various tools: compilers, parser generators etc. That would make it even possible to convert between different languages for the same codebase(I don't recommend it, but it can be useful). As far as I am aware, Haxe isn't meant to be a compiler target. Pseudo makes it a lot easier to add support for a new language or a library. It's wr
Read the rest
itten in Python and it uses a very declarative/template-like approach: https://github.com/alehander42/pseudo/blob/master/pseudo/gen... And, according to Haxe docs: > These are the technical skills you must achieve to create a compilation target for Haxe: > ... > Learn Ocaml > Understand Haxe compiler sources It will try to support a lot more languages, including functional languages(it does already support Go and Ruby, which aren't supported byHaxe).
In Show HN: Automated algorithm translation for Python, C++, C#, JS
I don't get this. Heres Fibonacci[1] in only 74 lines of YAML, or how about some kind of football CLI program[2] in only ~600 lines of YAML. I've got no idea why anyone would use this, or why the hell YAML was chosen to represent the AST. Edit: Not to crap over the authors project, it seems to produce quite neat output[3][4], it's just writing 600 lines of unreadable YAML to generate a ~32 line Python program seems a bit pointless. 1. https://github.com/alehander42/pseudo/blob/master/examples/f... 2. https://github.com/alehander42/pseudo/blob/master/examples/f... 3. https://github.com/alehander42/pseudo/blob/master/examples/f... 4. https://github.com/alehander42/pseudo/blob/master/examples/f...
In Show HN: Automated algorithm translation for Python, C++, C#, JS
Author here. Pseudo (and Pseudo-Python) are still in early stages, so I'd love some feedback, ideas and critique :) Here are some examples of not-trivial programs translated automatically with Pseudo: Reading and parsing a file with soccer stats https://github.com/alehander42/pseudo/tree/master/examples/f... A verbal-expressions-like library https://github.com/alehander42/pseudo/tree/master/examples/v... And fibonacci because traditions https://github.com/alehander42/pseudo/tree/master/examples/f...
In Show HN: An experimental Python to C#/Go/Ruby/JS transpiler

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.