HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
pikatchu
LinearML
OCaml2011–2018
pikatchu / LinearML

LinearML

Functional language for parallel programming

8Distinct people
9Mentions
0Explicit recommenders
437GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Functional language for parallel programming

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, 1:49:46 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 year9 dated mentions

Observed mentions: 2011-03-10 20:18:22 UTC to 2018-01-10 02:22:03 UTC.

0122011-01-01 00:00:00 UTC to 2012-01-01 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 comments20112012-01-01 00:00:00 UTC to 2013-01-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2013-01-01 00:00:00 UTC to 2014-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2014-01-01 00:00:00 UTC to 2015-01-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments20142015-01-01 00:00:00 UTC to 2016-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2016-01-01 00:00:00 UTC to 2017-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2017-01-01 00:00:00 UTC to 2018-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2018-01-01 00:00:00 UTC to 2019-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2018

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
20112011-01-01 00:00:00 UTC2012-01-01 00:00:00 UTC110
20122012-01-01 00:00:00 UTC2013-01-01 00:00:00 UTC000
20132013-01-01 00:00:00 UTC2014-01-01 00:00:00 UTC101
20142014-01-01 00:00:00 UTC2015-01-01 00:00:00 UTC000
20152015-01-01 00:00:00 UTC2016-01-01 00:00:00 UTC101
20162016-01-01 00:00:00 UTC2017-01-01 00:00:00 UTC202
20172017-01-01 00:00:00 UTC2018-01-01 00:00:00 UTC202
20182018-01-01 00:00:00 UTC2019-01-01 00:00:00 UTC202

What Hacker News says

9 sources
Function programming with no garbage collector is tough. There is a formalisation for dealing with this, called linear logic, which allows you to statically determine object lifetimes; but it's, um, a bit awkward. Such as, every value must be produced once and consumed once, so if you want to look at a variable, you need to produce a new variable with the same value (which must be consumed later). The seminal linearly typed language is Linear Lisp, which is almost incomprehensible, and also a proof-of-concept which doesn't do anything useful. Classic paper here: http://home.pipeline.com/~hbaker1/LinearLisp.html The closest thing to a modern language that uses them exclusively (Rust doesn't, by the way) is LinearML, which was an experimental toy, now abandoned. Tutorial here, which may be interesting: https://github.com/pikatchu/LinearML/w
Read the rest
iki/Tutorial I asked about it on StackOverflow a while back, and it collected a bunch of useful resources, including links to some of the seminal papers: http://stackoverflow.com/questions/5065861/programming-langu... (Still looking for a modern pure linear typed language, by the way.)
In Towards Idris Version 1.0
PreScheme was a LISP to replace C for low-level programming. Used manual, memory management instead of GC. Very fast and efficient. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.3.4... Formally verified plus a Scheme48 interpreter as part of VLISP project. https://en.wikipedia.org/wiki/PreScheme ATS has no garbage collector that I'm aware of. I've seen it used in device drivers and 8-bit MCU's. https://en.wikipedia.org/wiki/ATS_(programming_language) LinearML is GC-less, functional, parallel programming. https://github.com/pikatchu/LinearML So, functional languages neither require GC's nor infinite memory. Two also combined low-level efficiency with easy, formal verification vs C programs. So, that's higher mapping of idea to code, high efficiency, and better safety all at once. "You can’t just place a LISP book on top of an x8
Read the rest
6 chip" I believe I just did with PreScheme. Microsoft goes further to straight-up use a theorem prover to do x86 coding. http://research.microsoft.com/en-us/um/people/nick/coqasm.pd...
In A 32nm 1000-Processor Array

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.