Toggle navigation
HN
Paper
All
Show
Ask
Jobs
Top stories
Today
Last 7 days
Last months
This year
Stats
Stories by noch
An Introduction to Algorithms and Datastructures in SML
3 points
noch
2017-08-31T12:49:11Z
homepages.inf.ed.ac.uk
Syntax highlighting for `less`, powered by Emacs
1 points
noch
2017-08-30T16:28:19Z
github.com
Dependently Typed State Machines [pdf]
1 points
noch
2017-08-25T15:24:31Z
www.idris-lang.org
How to Retain History When Moving Files Between Git Repositories
3 points
noch
2017-08-24T16:21:19Z
blogs.s-osg.org
Extensions to the xterm protocol
3 points
noch
2017-08-24T16:16:11Z
github.com
A Red-Black Tree Implementation with Provable Properties
3 points
noch
2017-08-20T14:01:43Z
fstaals.net
Rust for Semanticists
3 points
noch
2017-08-19T18:31:29Z
asaj.org
A Modern Implementation of the Common Lisp LOOP Macro
1 points
noch
2017-08-18T11:55:40Z
www.youtube.com
Programmatic Manipulation of Lisp Type Specifiers
2 points
noch
2017-08-14T01:45:41Z
www.youtube.com
Edward Kmett, “Efficiently Coding for Modern CPUs”
2 points
noch
2017-08-07T21:50:05Z
www.youtube.com
Libre Graphics Magazine ends its run (2016)
1 points
noch
2017-08-07T21:03:03Z
libregraphicsmag.com
A formalization of category theory in Coq
109 points
noch
2017-08-04T12:31:46Z
github.com
Computational Category Theory
92 points
noch
2017-08-04T12:30:39Z
www.cs.man.ac.uk
Conor McBride – What are Types for, or are they only Against?
1 points
noch
2017-08-04T12:29:42Z
www.youtube.com
One VM to Rule Them All, One VM to Bind Them
4 points
noch
2017-07-30T02:10:44Z
www.youtube.com
Systemd-cryptsetup: Booting with encrypted root partition fails instantly
58 points
noch
2017-07-30T02:09:55Z
github.com
Advice for Writing Small Programs in C
4 points
noch
2017-06-22T18:46:50Z
www.youtube.com
An intro to web components with otters
4 points
noch
2017-06-22T11:54:38Z
meowni.ca
The Software Languages Book
2 points
noch
2017-06-22T02:34:31Z
www.softlang.org
Software Foundations
2 points
noch
2017-06-20T15:53:25Z
softwarefoundations.cis.upenn.edu
28
29
30
31
32
33