HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
blanchette
logical_verification_2020
Lean2020–2023
blanchette / logical_verification_2020

logical_verification_2020

Companion files for Logical Verification 2020–2021 at VU Amsterdam

Explore on GitHubRead Hacker News discussions
4Distinct people
5Mentions
0Explicit recommenders
95GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Companion files for Logical Verification 2020–2021 at VU Amsterdam

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:56:07 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 year5 dated mentions

Observed mentions: 2020-04-03 13:37:03 UTC to 2023-08-30 17:47:58 UTC.

0122020-01-01 00:00:00 UTC to 2021-01-01 00:00:00 UTC (exclusive): 2 mentions; 2 submissions, 0 comments20202021-01-01 00:00:00 UTC to 2022-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments20212022-01-01 00:00:00 UTC to 2023-01-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-01-01 00:00:00 UTC to 2024-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2023

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
20202020-01-01 00:00:00 UTC2021-01-01 00:00:00 UTC220
20212021-01-01 00:00:00 UTC2022-01-01 00:00:00 UTC202
20222022-01-01 00:00:00 UTC2023-01-01 00:00:00 UTC000
20232023-01-01 00:00:00 UTC2024-01-01 00:00:00 UTC101

What Hacker News says

5 sources
Syzygies·Nov 14, 2021
Yes! Parser combinators extended to typed trees, with an efficient syntax, would be a great basis for a programming language. Macros would be a primary application rather than strapped-on as they are now in every language. Another clue that we're watching a planet form, a fundamental idea is about to coalesce: Combinators for applying tactics in a theorem proving language such as Lean bear an uncanny resemblance to parser combinators. Today, most programmers view verified code as impractical. Huh? Is getting hacked, or the wrong answer, practical? In the future we'll be able to use the same code to write efficient programs, efficient randomized tests, and for program verification. It will feel like targeting different architectures. The key idea in type-based theorem proving is "propositions as types": One defines a type to state a propos
Read the rest
ition, then demonstrates an instance of that type to prove the proposition. Existence is boolean (true or false) which is also the coefficient semiring for automata theory in computer science. There, one generalizes to arbitrary coefficient rings, and gets probability models such as hidden Markov chains as part of the same theory. How does one generalize "propositions as types" to arbitrary coefficients? Does this subsume random testing? The parallel here is that one wants a valid instance of a type to prove a theorem, and a probability distribution on valid instances of a (far simpler) type for random testing. Anyone designing a language in this decade should look to program verification and theorem proving for the deepest influences. The Hitchhiker's Guide to Logical Verification https://github.com/blanchette/logical_verification_2020/raw/... Benjamin Pierce: Backtracking Generators for Random Testing https://www.youtube.com/watch?v=dfZ94N0hS4I&t=489s Homotopy Type Theory https://homotopytypetheory.org/book/
In Show HN: Luna is a Clojure domain specific language that translates to regex
Syzygies·Nov 11, 2021
A recent book in the same vein: The Hitchhiker's Guide to Logical Verification https://github.com/blanchette/logical_verification_2020 This is a tipping point work making the case that type theory is like a musician reading sheet music. Sure, the Beatles couldn't, but... Anyone developing a new programming language should understand languages at the level of Lean, even if the common uses of their constructs aren't theorem proving. The analogies are mind-blowing. Monadic parsing is the same thing as meta-programming tactics? I'm still wrapping my head arond that one.
In Types and Programming Languages (2002)

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.