|about 5 years ago||7 months ago|
|BSD 3-clause "New" or "Revised" License||MIT License|
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
We haven't tracked posts mentioning uuid-quasi yet.
Tracking mentions began in Dec 2020.
Scala community now has control over the official Scala grammar for tree-sitter 🎉
3 projects | reddit.com/r/scala | 3 Jan 2023
2022 State of Haskell Survey
6 projects | news.ycombinator.com | 3 Nov 2022
11 Companies That Use Haskell in Production
7 projects | dev.to | 4 May 2022
GitHub used Haskell for implementing Semantic, a command-line tool for parsing, analyzing, and comparing source code.
What happened with GitHub's semantic project?
3 projects | reddit.com/r/haskell | 29 Jan 2022
As far as engineering effort, you can read this GitHub comment for an overview of where we’d like to take the project in the future. The tl;dr here is that the open sum type view of the world made it very concise to fold over syntax trees (since such a view of data is ultimately unityped, recursion schemes Just Work), but the tradeoff thus associated—namely, that you have to parse a concrete syntax tree into an open-sum view (a complicated and painful-to-read process), that you can never really be sure how a given syntax tree is shaped, and that the types don’t help you nearly as much as they could—proved to be too onerous to deal with. Going forward, we’re generating syntax types from the AST once per target language, and working on an abstraction (probably via this generated code; I made five separate efforts at using Generics for this, and failed every time) that recovers at least some of the convenience of recursion schemes. It turns out that recursion schemes over a mutually recursive syntax tree—as pretty much every language’s syntax trees are, in practice—are pretty much an unsolved problem, especially when extended to languages like TypeScript, which have hundreds of different syntax nodes.3 projects | reddit.com/r/haskell | 29 Jan 2022
I'm just curious. It seems there hasn't been much activity in https://github.com/github/semantic Is GitHub still using semantic it to power some code navigation features? Has it been abandoned or is there some successor project that has taken its place? Is there any writeup / lessons learned about this project?
6 projects | news.ycombinator.com | 9 Dec 2021
is this from Github semantic (https://github.com/github/semantic)?
Seems very suspicious since it’s the same goal using the same technologies. The latest commit is 4mo ago but i assume they have a closed-source version they’ve been working on.6 projects | news.ycombinator.com | 9 Dec 2021
I just published an experimental `tree-sitter` grammar for Swift!
2 projects | reddit.com/r/swift | 28 Aug 2021
Does anyone here have experience with tree-sitter? If you aren't familiar, tree-sitter is a parser generator tool that builds parsers to use with an incremental parsing library. It's what's responsible for AST parsing on GitHub, for instance.
Glean -System for collecting, deriving and querying facts about source code
4 projects | reddit.com/r/haskell | 27 Aug 2021
You might want to put some examples of how exactly to use gleam (maybe a 1-2-3 type fashion?) on the front page if possible. This project seems like github/semantic or possibly even more advanced (given that it comes with it's own query language and a shell) but I just can't figure out exactly how I'd use it exactly.
Diffsitter: A tree-sitter based AST difftool to get meaningful semantic diffs
8 projects | news.ycombinator.com | 18 Jul 2021
What are some alternatives?
diffsitter - A tree-sitter based AST difftool to get meaningful semantic diffs
massiv - Efficient Haskell Arrays featuring Parallel computation
Glean - System for collecting, deriving and working with facts about source code.
months - Month, YearMonth, Quarter, YearQuarter
refined - Refinement types with static checking
jump - Jump start your Haskell development
cantor-pairing - Convert data to and from a natural number representation
critbit - A Haskell implementation of crit-bit trees.
uuid - A Haskell library for creating, printing and parsing UUIDs
unordered-containers - Efficient hashing-based container types
lens - Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens