Hacker Newsnew | past | comments | ask | show | jobs | submit | jbhn's commentslogin

VS Code uses LSPs which are mentioned.


TL;DR: Java’s multi-billion-dollar ecosystem is quietly dependent on a shrinking, fragile IDE infrastructure, and without deliberate investment beyond IntelliJ and Eclipse, its long-term developer productivity is at serious risk.


So the outlook is good for emacs, vim, and maybe VSCode?


Note that "full" solutions are possible in standard OO languages as well (without the usual visitor vs subclasses trade-off): https://news.ycombinator.com/item?id=45210114


I agree, given that (JVM) Clojure is literally just a Java Library.

From a programmer's point of view I don't want to have to write all the machinery that makes for a "full" solution (that is also correct and performant enough)...

In fact I can't! Which is why I hope more programming languages make that machinery available, because the "X/Y" problem (Type / Method) manifests itself (pretty easily) in every single web app out there (and likely most software ever written).


Please do Strings next. Effective Rust isn't useful at guiding to a good default.

The technical arguments for one or the other option are available in a bunch of places, but no good guidance on an idiomatic default.


Can you give an example of a situation where you’re not sure what string type to use?


I think Library APIs are a good example. I've found myself in the situation where I do not care about the string representation (or can convert in a few places if necessary), but need to provide an interface for others that is as frictionless as possible. My instinct there was to be generic and use From/To traits, but it never felt quite right.


Sure. I'll add it to my bucket list.


Reflections in Tree Calculus work differnt from lisp quote/unqote used here. It is a hunch, but I think Tree Calculus can implement this (if it is sound) (book pg 64 ff on quote), but not vice-versa.

As far as I know there is no Tree Calculus with (dependent) types, because types in Tree Calculus work different from main stream type theory (you internalize the type checker using reflection (see book pg 58), a bit like I did here with scheme: https://github.com/JanBessai/tcscheme).


Dependent Types + Combinatory Logic is highly non-trivial, as is shown in this series of work by Altenkirch et al.:

https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.F...

https://drops.dagstuhl.de/storage/00lipics/lipics-vol269-typ...

https://types2023.webs.upv.es/slides/S22/TYPES2023-Altenkirc...

I wonder: Where does rholang3 fit in this?


One should mention the RustBelt project: https://plv.mpi-sws.org/rustbelt/ here. It was in place to develop a specification for Rust that is accessible for formal verification. I think that is the way to go, rather than semi-formal standadese language. I've some related background and would love to do it (given there was a good postion/pay).


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: