unboxed-references VS semantic-source

unboxed-references

We haven't tracked posts mentioning unboxed-references yet.
Tracking mentions began in Dec 2020.

semantic-source

• The Meaning of Monad in MonadTrans
  2 projects | news.ycombinator.com | 13 Aug 2023

  One production example I know: GitHub code navigation is written in Haskell https://github.com/github/semantic

• Semantic: Parsing, analyzing, and comparing source code across many languages
  1 project | news.ycombinator.com | 28 May 2023
• How to Get Started with Tree-Sitter
  3 projects | news.ycombinator.com | 28 May 2023

  ah, easy. it's because support has not been added into https://github.com/github/semantic which is the tech that powers the GitHub UI. Adding support is pretty easy/mainly glue code [1] that imports the tree sitter API.

  [1] https://github.com/github/semantic/blob/793a876ae45d38a6bd17...

• Scala community now has control over the official Scala grammar for tree-sitter 🎉
  3 projects | /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 | /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.

• Stack Graphs
  6 projects | news.ycombinator.com | 9 Dec 2021

  Meanwhile their Tree-Sitter-based semantic parser[1] looks abandoned. There is even rotting for years pull request[2] adding support of the same stack graphs into it.

  [1] https://github.com/github/semantic

  [2] https://github.com/github/semantic/pull/535

• Cardano relying on Haskell is not bad at all
  1 project | /r/cardano | 30 Nov 2021

  The semantic team at GitHub uses it for statically analyzing the dozens of languages that end up in GitHub repositories: https://github.com/github/semantic/blob/eaf13783838861fe5eb6cd46d59354774a8eb88d/docs/why-haskell.md

• 7 Useful Tools Written in Haskell
  1 project | /r/functionalprogramming | 3 Nov 2021

  Yesterday I was looking for some examples of projects using tree-sitter (which is C) when I found GitHub's semantic, used to analyze and compare source code, and written in Haskell: https://github.com/github/semantic/