magrittr
dafny
magrittr | dafny | |
---|---|---|
10 | 31 | |
951 | 2,763 | |
0.0% | 4.4% | |
2.3 | 9.7 | |
about 1 year ago | 5 days ago | |
R | C# | |
GNU General Public License v3.0 or later | GNU General Public License v3.0 or later |
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.
magrittr
- This is not a pipe - René Magritte
-
Six programming languages I’d like to see
R (yes, the statistics language) has exactly this.
You can literally extract the body of a function as a list of "call" objects (which are themselves just dressed-up lists of symbols), inject/delete/modify individual statements, and then re-cast your new list to a new function object.
I don't know why the original devs thought this was necessary or even desirable in a statistics package, but it turns out to be a lot of fun to program with. It has also made possible a wide variety of clever and elegant custom syntaxes, such as a pipe infix operator implemented as a 3rd-party library without any custom language extensions [0]. The pipe infix operator got so popular that it was eventually made part of the language core syntax in version 4.1 [1].
[0]: https://magrittr.tidyverse.org/
[1]: https://www.r-bloggers.com/2021/05/the-new-r-pipe/
- Hadley is pro- base pipe.
-
Functional pipes in python like %>% from R's magrittr
In R (thanks to magrittr) you can now perform operations with a more functional piping syntax via %>%. This means that instead of coding this:
-
Question about dot notation
Try reading the documentation for magrittr.
-
When did WG21 decide this is what networking looks like?
Related note: the statistical programming language R has a library named magrittr to support the pipe operator.
-
How can I find the data entry of the row after one found?
About the pipe (%>%) symbol, it's provided by the magrittr package. The package documentation details how to use the pipe operator.
-
Best practice for chaining nested functions?
I was wondering what some good ways are to handle nested function calls without chaining them in long, ugly nested statements. I am looking for functionality similar to the pipe forward operator %>% in magrittr/R or |> in F#.
-
I much prefer `data.action()` to `action(data). Is it an r/unpopularopinion?
You may like R: https://magrittr.tidyverse.org
-
What's so "tidy" about tidyverse?
Agreed on everything else you said (especially the type safety stuff, it massively helps in production), but one correction: magrittr is absolutely in the tidyverse suite. It's not considered one of its "core" packages that it visibly tells you it loads, but magrittr is loaded when calling library(tidyverse) and development of the package is handled by the tidyverse team under their Github account: https://github.com/tidyverse/magrittr
dafny
- Dafny is a verification-aware programming language
- Candy – a minimalistic functional programming language
- Dafny – a verification-aware programming language
-
Lean4 helped Terence Tao discover a small bug in his recent paper
Code correctness is a lost art. I requirement to think in abstractions is what scares a lot of devs to avoid it. The higher abstraction language (formal specs) focus on a dedicated language to describe code, whereas lower abstractions (code contracts) basically replace validation logic with a better model.
C# once had Code Contracts[1]; a simple yet powerful way to make formal specifications. The contracts was checked at compile time using the Z3 SMT solver[2]. It was unfortunately deprecated after a few years[3] and once removed from the .NET Runtime it was declared dead.
The closest thing C# now have is probably Dafny[4] while the C# dev guys still try to figure out how to implement it directly in the language[5].
[1] https://www.microsoft.com/en-us/research/project/code-contra...
[2] https://github.com/Z3Prover/z3
[3] https://github.com/microsoft/CodeContracts
[4] https://github.com/dafny-lang/dafny
[5] https://github.com/dotnet/csharplang/issues/105
-
The Deep Link Equating Math Proofs and Computer Programs
I don't think something that specific exists. There are a very large number of formal methods tools, each with different specialties / domains.
For verification with proof assistants, [Software Foundations](https://softwarefoundations.cis.upenn.edu/) and [Concrete Semantics](http://concrete-semantics.org/) are both solid.
For verification via model checking, you can check out [Learn TLA+](https://learntla.com/), and the more theoretical [Specifying Systems](https://lamport.azurewebsites.net/tla/book-02-08-08.pdf).
For more theory, check out [Formal Reasoning About Programs](http://adam.chlipala.net/frap/).
And for general projects look at [F*](https://www.fstar-lang.org/) and [Dafny](https://dafny.org/).
- Dafny
- The Dafny Programming and Verification Language
-
In Which I Claim Rich Hickey Is Wrong
Dafny and Whiley are two examples with explicit verification support. Idris and other dependently typed languages should all be rich enough to express the required predicate but might not necessarily be able to accept a reasonable implementation as proof. Isabelle, Lean, Coq, and other theorem provers definitely can express the capability but aren't going to churn out much in the way of executable programs; they're more useful to guide an implementation in a more practical functional language but then the proof is separated from the implementation, and you could also use tools like TLA+.
https://dafny.org/
https://whiley.org/
https://www.idris-lang.org/
https://isabelle.in.tum.de/
https://leanprover.github.io/
https://coq.inria.fr/
http://lamport.azurewebsites.net/tla/tla.html
-
Programming Languages Going Above and Beyond
> I think we can assume it won't be as efficient has hand written code
Actually, surprisingly, not necessarily the case!
If you'll refer to the discussion in https://github.com/dafny-lang/dafny/issues/601 and in https://github.com/dafny-lang/dafny/issues/547, Dafny can statically prove that certain compiler branches are not possible and will never be taken (such as out-of-bounds on index access, logical assumptions about whether a value is greater than or less than some other value, etc). This lets you code in the assumptions (__assume in C++ or unreachable_unchecked() under rust) that will allow the compiler to optimize the codegen using this information.
-
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.
What are some alternatives?
dplyr - dplyr: A grammar of data manipulation
tlaplus - TLC is a model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.
scenebuilder - Scene Builder is a visual, drag 'n' drop, layout tool for designing JavaFX application user interfaces.
FStar - A Proof-oriented Programming Language
kitten - A statically typed concatenative systems programming language.
rust - Rust for the xtensa architecture. Built in targets for the ESP32 and ESP8266
power-fx-host-samples - Samples for hosting Power Fx engine.
koka - Koka language compiler and interpreter
libuv-tutorial - http://nikhilm.github.io/uvbook/
Rust-for-Linux - Adding support for the Rust language to the Linux kernel.
ggplot2 - An implementation of the Grammar of Graphics in R
interactive - .NET Interactive combines the power of .NET with many other languages to create notebooks, REPLs, and embedded coding experiences. Share code, explore data, write, and learn across your apps in ways you couldn't before.