algebra-driven-design
tcases
| algebra-driven-design | tcases | |
|---|---|---|
| 11 | 1 | |
| 129 | 201 | |
| - | 0.5% | |
| 4.3 | 7.1 | |
| 6 months ago | 25 days ago | |
| Haskell | Java | |
| BSD 3-clause "New" or "Revised" 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.
algebra-driven-design
- What are some useful techniques for designing in functional languages?
-
Rust for projects that demand OOP type programming
You might want to read on Algebra-Driven Design and Data Oriented Design. If you are greedy, both books were pirated.
-
Does anyone use formal methods to validate the behaviour of programs/software at their job?
I would like to do this more. At the moment I don't do formal verification. However, I often borrow methodology from the excellent book Algebra-Driven Design (text available on GitHub but support the author if you find it useful!) when designing systems. This means I define algebraic data types to describe the program and the laws that relate the different types, and use that to guide implementation in a language that doesn't support ADTs.
- Best books for Haskell
-
Do you feel static types have "won the war", so to speak?
Their approach might be to express their business logic as a carefully selected collection of types and laws, as described in Algebra-Driven Design (the full text is available on GitHub, please support the author if you find it useful though). I recommend this book to everyone because, even if you don't use this approach to design your programs, it's an excellent way to think about problems and better understand the problem space.
-
Can someone message me explaining category theory and representation theory? I’m trying to choose a topic for independent study and need some help.
If you have an interest in computer science, category theory is very useful there. Here's a good book on the topic (Algebra-Driven Design, by Sandy Maguire).
-
Does anybody know a simple algorithm for generating unit tests given a function's code?
This reminds me of QuickSpec (different from QuickCheck) in Haskell. It takes Haskell code and finds the Mathematical laws that the code supports. It does this using a sort of smart random search. I learned about this as part of the Algebra Driven Design book.
- Source material for Algebra-Driven Design now available!
-
Advice on designing algebras
Sorry probably worth pointing out that I'm not referring to an Algebra in the pure math sense. I'm more referring to specifying algebraic laws that an API would have to satisfy as talked about in this book https://leanpub.com/algebra-driven-design.
tcases
-
Does anybody know a simple algorithm for generating unit tests given a function's code?
Black-box test case generation software: * https://github.com/Cornutum/tcases
What are some alternatives?
learn-you-a-haskell - “Learn You a Haskell for Great Good!” by Miran Lipovača
EvoMaster - The first open-source AI-driven tool for automatically generating system-level test cases (also known as fuzzing) for web/enterprise applications. Currently targeting whitebox and blackbox testing of Web APIs, like REST, GraphQL and RPC (e.g., gRPC and Thrift).
Agda - Agda is a dependently typed programming language / interactive theorem prover.
openapi4j - OpenAPI 3 parser, JSON schema and request validator.
pynguin - The PYthoN General UnIt Test geNerator is a test-generation tool for Python
methods2test - methods2test is a supervised dataset consisting of Test Cases and their corresponding Focal Methods from a set of Java software repositories
FsCheck - Random Testing for .NET
HoloDB - HoloDB is an RDBMS seemingly filled with random data. This data does not actually take up any space in memory or on a volume (to use an analogy, it is as if the data set is projected as a hologram from a simple configuration). The base layer is an arbitrarily large, read-only data set that is readable and searchable, and yet fully consistent. Any pieces of data and index lookups are calculated on-the-fly. An optional second layer is built on top of this, allowing read-write access (stores differences while maintains consistency and searchability). You can start an arbitrarily large database in moments, with minimal effort; all you need is a YAML configuration file or some JPA entites.
austin-sbst - Automatically exported from code.google.com/p/austin-sbst