Ruby VS Agda

Ruby Reviews

Agda Reviews

Ruby mentions (3)

• A full-stack serverless application with AssemblyLift and Next.js

  The counter function is written in Ruby. Since Ruby is an interpreted language, AssemblyLift deploys a customized Ruby 3.1 interpreter compiled to WebAssembly, which executes the function handler. Since the interpreter is somewhat large, the cold-start time of a Ruby function tends to be larger than that of a Rust function. Our counter is being run in the backround, so we're fine with it being a little bit laggy... - Source: dev.to / over 1 year ago

• Why is no one promoting ruby?

  But, in general I was told use rubyapi.org unless you _really_ want to stick with the ruby-lang.org docs for all you do (which is fine) or to dig more into some object hierarchy, etc. Source: almost 2 years ago

• Looking for pwsh (core/open source, v7) integration w/ rbenv, asdf

  [2] 'rbenv' - https://github.com/rbenv/rbenv - Ruby version management utility. Run something like rbenv install 3.1.1 to install that version on your system (requires related project ruby-build), then rbenv local 3.1.1 in your code's directory to specify that for any ruby command in that directory only, you want to use version 3.1.1 that you installed through rbenv. Does other useful stuff too. Only does Ruby,... Source: about 2 years ago

Agda mentions (7)

• 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... Source: 10 months ago

• 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 well-known but is very cool. Source: 11 months ago

• 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. Source: over 1 year ago

• If C++ would be safe as Rust, Would you consider your current/next project be in C++?

  Safer doesn't mean better. You could proof program correctness, and get proven program with tools like Coq (https://news.ycombinator.com/) and Agda (https://wiki.portal.chalmers.se/agda/pmwiki.php). However, it leads to much higher cost of creating software than both C++ and Rust. It's a trade-off. A great thing about Rust is that the safety costs very little compared to Coq and Agda. Source: over 1 year ago

• Do you feel static types have "won the war", so to speak?

  At the most extreme level, you disappear into a meditative solitary retreat for a couple of years to seek enlightenment, and when you emerge you're no longer a programmer who writes programs, you're a theorist who proves theorems in Agda, and you have transcended above things that are tainted by the inherent evil of the material plane like "side effects" and "business needs" and "delivery timelines" and "could you... Source: almost 2 years ago