Agda
zig
Agda  zig  

27  840  
2,477  34,037  
1.3%  1.7%  
9.9  10.0  
5 days ago  4 days ago  
Haskell  Zig  
MIT 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.
Agda

Types versus sets (and what about categories?)
This was recently deemed inappropriate:
"Bye bye Set"
"Set and Prop are removed as keywords"
https://github.com/agda/agda/pull/4629

If given a list of properties/definitions and relationship between them, could a machine come up with (mostly senseless, but) true implications?
Still, there are many useful tools based on these ideas, used by programmers and mathematicians alike. What you describe sounds rather like Datalog (e.g. Soufflé Datalog), where you supply some rules and an initial fact, and the system repeatedly expands out the set of facts until nothing new can be derived. (This has to be finite, if you want to get anywhere.) In Prolog (e.g. SWI Prolog) you also supply a set of rules and facts, but instead of a fact as your starting point, you give a query containing some unknown variables, and the system tries to find an assignment of the variables that proves the query. And finally there is a rich array of theorem provers and proof assistants such as Agda, Coq, Lean, and Twelf, which can all be used to help check your reasoning or explore new ideas.

What can Category Theory do?
Haskell and Agda are probably the most obvious examples. Ocaml too, but it is much older, so its type system is not as categorical. There is also Idris, which is not as wellknown but is very cool.

What are the current hot topics in type theory and static analysis?
Most of the proof assistants out there: Lean, Coq, Dafny, Isabelle, F*, Idris 2, and Agda. And the main concepts are dependent types, Homotopy Type Theory AKA HoTT, and Category Theory. Warning: HoTT and Category Theory are really dense, you're going to really need to research them.

Amendmend proposal: Changed syntax for Or patterns
Does this come with plans to separately unify the body with each of the contexts induced by matching on each of the respective patterns (similar to what’s discussed here), or will it behave like the _ pattern and use only the most general context?

Functional Programming and Maths <> How can a code monkey learn Agda?
That's absolutely untrue. From the horse's mouth:
 Doom emacs and agdamode

FP language idea  would this is possible to infer and type check?
Agda has the socalled mixfix operators (which are powerful enough to cover pre/in/postfix cases with an arbitrary number of arguments), check that out:  https://agda.readthedocs.io/en/v2.6.1/language/mixfixoperators.html  https://github.com/agda/agda/blob/master/examples/Introduction/Operators.agda  https://github.com/agda/agdastdlib/blob/master/src/Data/Product/Base.agda

Best Programming Language for Computational Proof
Coq, Agda, Lean, Isabelle, and probably some others which are not coming to my mind at the moment, but those would be considered the major ones.

Do you use Idris or Coq, and why?
Funny that you say this, because there are some obvious long standing open feature requests with looking up the type of the term under cursor — № 4295 and № 516. I am not blaming anyone in particular — this is the way it is. I wish I could find time to rewrite the proof search engine (how hard can it be), but I am already buried under a pile of other commitments and a good chunk of overwhelming sadness.
zig

Pledging $300k to the Zig Software Foundation
> And there's also the aliasing issue
Plans to address this were shared just last week: https://github.com/ziglang/zig/issues/5973#issuecomment2380...

One must imagine Sisyphus writing a new JS framework
You crave the simplicity of C, but miss modern features and a nice build system? You got Zig

The Python Package Index Should Get Rid of Its Training Wheels
I raise you https://github.com/ziglang/zig/issues/20875
It is not entirely clear what any of this means, and in any case, it keeps changing all the time.

Don't defer Close() on writable files
Arguably, one should call `flush()` on the file first. Resource allocation must always succeed; otherwise a lot of invariants break. This is why Zig's close method[0] ignores errors (with the exception of `EBADF`).
[0]: https://github.com/ziglang/zig/blob/fb0028a0d7b43a2a5dd05f07...
 Zig: Prefer depending on NtDll rather than kernel32 or other higher level DLLs

Book – Writing a C Compiler: Build a Real Programming Language from Scratch
Zig is moving away from LLVM (https://github.com/ziglang/zig/issues/16270) and Rust has added Cranelift as a debug backend (https://lwn.net/Articles/964735/).
Not sure about Jai.

C Macro Reflection in Zig – Zig Has Better C Interop Than C Itself
It won't require build.zig, you'll just have to run `zig translatec` on the C file. Andrew's comment here[1] says that @cImport is basically @import + the compiler implicitly running `translatec` for you. There was some discussion of removing the `translatec` subcommand as well (which _would_ force you to use build.zig), but I don't think it's been decided to do that.
[1] https://github.com/ziglang/zig/issues/20630#issuecomment225...

Zen 5's 2Ahead Branch Predictor: How a 30 Year Old Idea Allows for New Tricks
We would need more branch hints? https://github.com/ziglang/zig/issues/5177
Cold, warm, warmer, hot? Sometimes you would set all branches to be cold except one

Aro – Zig's new C compiler
It's the major area of focus right now. You can track the issues with this tag/link if you'd like:
https://github.com/ziglang/zig/issues?q=is%3Aissue+is%3Aopen...
 Use Zig cc to cross‐compile a CMake project
What are some alternatives?
lean  Lean Theorem Prover
Nim  Nim is a statically typed compiled systems programming language. It combines successful concepts from mature languages like Python, Ada and Modula. Its design focuses on efficiency, expressiveness, and elegance (in that order of priority).
coq  Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semiinteractive development of machinechecked proofs.
Odin  Odin Programming Language
opentyperep  Open type representations and dynamic types
v  Simple, fast, safe, compiled language for developing maintainable software. Compiles itself in <1s with zero library dependencies. Supports automatic C => V translation. https://vlang.io
HoleyMonoid  Automatically exported from code.google.com/p/monoidcont
rust  Empowering everyone to build reliable and efficient software.
lean4  Lean 4 programming language and theorem prover
go  The Go programming language
distributive  Dual Traversable
ssrproxyjs  A ServerSide Rendering Proxy focused on customization and flexibility!