frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Einstein's relativity rules chemical bonds in heavy elements, new research shows

https://www.brown.edu/news/2026-07-09/chemical-bonds-relativity
161•hhs•6h ago•54 comments

QuadRF can spot drones and see WiFi through my wall

https://www.jeffgeerling.com/blog/2026/quadrf-can-spot-drones-and-see-wifi-through-my-wall/
507•speckx•13h ago•183 comments

Apple sues OpenAI, accuses ex-employees of stealing trade secrets

https://9to5mac.com/2026/07/10/apple-sues-openai-trade-secret-theft/
770•stock_toaster•8h ago•385 comments

An iroh powered smart fan

https://www.iroh.computer/blog/an-iroh-powered-smart-fan
54•surprisetalk•3d ago•4 comments

An update on residential proxies and the scraper situation

https://lwn.net/SubscriberLink/1080822/990a8a5e2d379085/
138•chmaynard•9h ago•121 comments

GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]

https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf
396•scrlk•10h ago•308 comments

SpaceX wants to launch 100k more Starlink satellites for 100x the bandwidth

https://www.zdnet.com/home-and-office/networking/spacex-wants-to-launch-100000-more-starlink-sate...
128•CrankyBear•11h ago•373 comments

The tech of 'Terminator 2' – an oral history (2017)

https://vfxblog.com/2017/08/23/the-tech-of-terminator-2-an-oral-history/
194•markus_zhang•12h ago•70 comments

Combustion engine web-based simulator

https://combustionlab.net
138•mytuny•5d ago•63 comments

Inference Optimization for MiMo v2.5: Pushing Hybrid SWA Efficiency to the Limit

https://mimo.xiaomi.com/blog/mimo-v2-5-inference
60•theanonymousone•3d ago•24 comments

Late Bronze Age Collapse

https://acoup.blog/2026/01/30/collections-the-late-bronze-age-collapse-a-very-brief-introduction/
345•dmonay•17h ago•235 comments

Good Tools Are Invisible

https://www.gingerbill.org/article/2026/07/10/good-tools-are-invisible/
387•theanonymousone•18h ago•181 comments

The footgun of right-to-left decorative characters

https://blog.alexbeals.com/posts/the-footgun-of-right-to-left-decorative-characters
27•dado3212•4d ago•16 comments

AI 2040: Plan A

https://ai-2040.com/
188•kschaul•1d ago•197 comments

New York City to ban deceptive subscription practices

https://www.theguardian.com/us-news/2026/jul/10/new-york-city-deceptive-subscriptions-ban
474•randycupertino•10h ago•234 comments

Silent speech with ultrasound

https://alephneuro.com/blog/silent-speech
25•chrwn•3d ago•5 comments

Computation as a universal and fundamental concept

https://ergo.org/courses/computation-as-a-universal-and-fundamental-concept
107•simonpure•13h ago•79 comments

Snails' teeth beats spider silk as nature's strongest material (2015)

https://www.smithsonianmag.com/smart-news/spider-silk-loses-top-spot-natures-strongest-material-s...
170•simonebrunozzi•12h ago•133 comments

Alternate clock designs and time systems

https://serialc.github.io/altClocks/
120•ethanpil•4d ago•63 comments

After 7 years in production, Scarf has reluctantly moved away from Haskell

https://avi.press/posts/2026-07-10-after-7-years-in-production-scarf-has-reluctantly-moved-away-f...
101•aviaviavi•15h ago•116 comments

Moss (YC F25) Is Hiring

https://www.ycombinator.com/companies/moss/jobs/52LnqLQ-software-engineer-sdk
1•srimalireddi•7h ago

Preemption is GC for memory reordering (2019)

https://pvk.ca/Blog/2019/01/09/preemption-is-gc-for-memory-reordering/
20•mpweiher•2d ago•4 comments

War Atlas: An interactive cartography of every named war in human history

https://waratlas.org
133•NaOH•11h ago•58 comments

A love letter to flashcards

https://lesleylai.info/en/flashcards/
140•surprisetalk•13h ago•87 comments

Lost city discovered beneath Egypt's desert with ancient church

https://www.dailymail.com/sciencetech/article-15956159/Incredible-lost-city-discovered-Egypts-des...
170•Bender•4d ago•86 comments

GhostLock, a stack-UAF that has existed in ALL Linux distributions for 15 years

https://nebusec.ai/research/ionstack-part-2/
54•djfergus•8h ago•10 comments

Show HN: Wyrm – Solve algebra by touch, built on an open-source soundness engine

https://github.com/dicroce/wyrm_math
67•dicroce•1d ago•10 comments

Successful Companies Go Blind

https://ianreppel.org/how-successful-companies-go-blind/
201•speckx•15h ago•71 comments

Show HN: Getting GLM 5.2 running on my slow computer

https://github.com/JustVugg/colibri
838•vforno•1d ago•206 comments

Show HN: Phobos – A tiny scale-free kernel language with tile-DAG support

https://www.joa-ebert.com/posts/2026-07-07-phobos-lang/
6•joajoa•3d ago•0 comments
Open in hackernews

The Lisp in the Cellar: Dependent types that live upstairs [pdf]

https://zenodo.org/records/15424968
88•todsacerdoti•1y ago
Downloadable: https://zenodo.org/records/15424968/files/deputy-els.pdf

Comments

droideqa•1y ago
Sadly "deputy clojure" on Google brings no results...

The only hint is this repo[0] referenced in the paper.

[0]: https://gitlab.com/fredokun/deputy

agumonkey•1y ago
Pretty readable code
reuben364•1y ago
Thinking out aloud here.

One pattern that I have frequently used in EMACS elisp is that redefining a top-level value overwrites that value rather than shadowing it. Basically hot reloading. This doesn't work in a dependently typed context as the type of subsequent definitions can depend on values of earlier definitions.

    def t := string
    def x: t := "asdf"
    redef t := int
redefining t here would cause x to fail to type check. So the only options are to either shadow the variable t, or have redefinitions type-check all terms whose types depend on the value being redefined.

Excluding the type-level debugging they mention, I think a lean style language-server is a better approach. Otherwise you are basically using an append-only ed to edit your environment rather than a vi.

extrabajs•1y ago
I don’t see the connection to dependent types. But anyway, is ‘redef’ part of your language? What type would you give it?
reuben364•1y ago
I just wrote redef to emphasize that I'm not shadowing the original definition.

    def a := 1
    def f x := a * x
    -- at this point f 1 evaluates to 1
    redef a := 2
    -- at this point f 1 evaluates to 2
But with dependent types, types can depend on prior values (in the previous example the type of x depends on the value t in the most direct way possible, as the type of x is t). If you redefine values, the subsequent definitions may not type-check anymore.
extrabajs•1y ago
I see what you mean. But would you not experience the same sort of issue simply from redefining types in the same way? It seems this kind of destructive operation (whether on types or terms) is the issue. As someone who's used to ML, it seems strange to allow this kind of thing (instead of simply shadowing), but maybe it's a Lisp thing?
resize2996•1y ago
> EMACS elisp

I used this to write the front end for an ATM machine.

wk_end•1y ago
I've fantasized about some kind of a dependently-typed Smalltalk-like thing before, and in those fantasies the solution would be that changes would be submitted in the form of transactions - they wouldn't be live until you bundled them all together into one big change that would be fully type-checked, as you describe.
dang•1y ago
Any URL for this that we can open in a browser (as opposed to the dreaded "Content-Disposition: attachment")?
Jtsummers•1y ago
https://zenodo.org/records/15424968 - This at least takes you to a webpage where you can view the paper. If you select to download it, it still downloads of course instead of just opening in the browser.
dang•1y ago
Thanks! I've switched to that above, and put the downloadable link in the top text.
reikonomusha•1y ago
Related context: The 2025 European Lisp Symposium [1] was just wrapped a few hours ago in Zurich. There was content on:

- Static typing a la Haskell with Coalton in Common Lisp

- Dependent typing with Deputy in Clojure (this post)

- The Common Lisp compiler SBCL ported to the Nintendo Switch

- Common Lisp and AI/deep learning

- A special retrospective on Modula and Oberon

- Many lightning talks.

[1] https://european-lisp-symposium.org/2025/index.html

no_wizard•1y ago
I feel like Lisp would be an ideal language for AI development. Its exceedingly good for DSL development and pattern matching. Its already structurally like math notation as well, which I would think would lend itself to thinking how models would consume information and learn
rscho•1y ago
Well... believe it or not, some have thought of using lisp for AI for quite some time. ;-)
froh•1y ago
indeed.

Peter Norvig, 1992

Paradigms of AI Programming: Case Studies in Common Lisp

https://g.co/kgs/hck8wsE

https://en.m.wikipedia.org/wiki/Peter_Norvig

it's no coincidence Google is actively maintaining sbcl, either.

Zambyte
fithisux•1y ago
Impressive.
kscarlet•1y ago
The only option that you described is called "hyperstatic global environment".

And it is called that for a reason, it is not very dynamic :) and probably too static to the taste of many Lisp and all Smalltalk fans.

•
1y ago
Why not go all the way to the source? John McCarthy coined the term "artificial intelligence", and then invented / discovered LISP in pursuit of it in the 1950s :D
ayrtondesozzla•1y ago
https://quantumzeitgeist.com/lisp-and-the-dawn-of-artificial...

Lisp was the de facto language of artificial intelligence in the U.S. for many years. Apparently Prolog was popular in Europe (according to Norvig's PAIP)