eff
Agda
eff | Agda | |
---|---|---|
18 | 27 | |
546 | 2,378 | |
0.4% | 0.6% | |
0.0 | 9.8 | |
almost 1 year ago | 5 days ago | |
Haskell | Haskell | |
ISC 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.
eff
-
Haskellers who moved to Rust: What has been your experience?
You can swap-out implementations for testing, avoid the crazy N^2 instances issues, etc. They're pretty cool. Currently there are many competing libraries. polysemy and eff both have good examples on their homepages.
-
What are the current hot topics in type theory and static analysis?
Effect systems and Algebraic effects. ocaml has just released a stripped-down effect system. People are also working on Effect systems for Haskell (eff, fused-effects, effet). Koka is a language built with effects first and foremost and it’s rapidly gaining popularity. Unison also has effects.
-
[ANNOUNCE] GHC 9.6.1 is now available
There are also a few subtle issues that arise with delconts related to semantics of higher order effects (see here and here), but they might be solvable.
-
Effectful | Paweł Szulc | Lambda Days 2022
Details are in https://github.com/hasura/eff/issues/12 and https://www.reddit.com/r/haskell/comments/pywuqg/unresolved_challenges_of_scoped_effects_and_what/.
-
Looking for languages that combine algebraic effects with parallel execution
You'll get fearless parallel with STM in the mixture, and GHC is getting a work in progress effect system for Haskell, as Delimited continuation primops has been merged.
-
Should I pick up OCaml or Haskell?
My last example is algebraic effects, some of which have been made possible in a both practical and efficient way thanks to extremely recent research, and that I can use to implement architectures like Ports and Adapters or Clean Architecture and have very maintainable code. (Extensible Effects — An Alternative to Monad Transformers was published in 2013, Effect Handlers in Scope was published in 2014 and they are behind Polysemy, while there is ongoing work on effects with even better performance, like Eff)
-
[ANN] cleff - fast and consise extensible effects
cleff's Eff monad is esentially implemented as a ReaderT IO. [...] This is first done by eff, [...]
-
Opinions on Reader + Continuation-based IO?
Here is link number 1 - Previous text "eff"
-
Where's more discussion of the designs of effect systems?
Languages such as Koka only support algebraic effects, not scoping operations such as catch and listen. The Effect Handlers in Scope paper introduces scoping operations, which lead to the Haskell libraries fused-effects and polysemy, but they turned out to have some weird semantics. eff is her effort to fix that.
-
Languages that don't support Error-Catching as a Control Structure?
There are a few languages that have algebraic effect systems, most notably Haskell, but these systems are implemented as libraries, not baked into the language (which can have advantages and disadvantages).
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 well-known 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 agda-mode
-
FP language idea - would this is possible to infer and type check?
Agda has the so-called 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/mixfix-operators.html - https://github.com/agda/agda/blob/master/examples/Introduction/Operators.agda - https://github.com/agda/agda-stdlib/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.
What are some alternatives?
freer-simple - A friendly effect system for Haskell
lean - Lean Theorem Prover
fused-effects - A fast, flexible, fused effect system for Haskell
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 semi-interactive development of machine-checked proofs.
frp-zoo - Comparing many FRP implementations by reimplementing the same toy app in each.
open-typerep - Open type representations and dynamic types
in-other-words - A higher-order effect system where the sky's the limit
HoleyMonoid - Automatically exported from code.google.com/p/monoid-cont
polysemy - :gemini: higher-order, no-boilerplate monads
distributive - Dual Traversable
extensible-effects - Extensible Effects: An Alternative to Monad Transformers
lean4 - Lean 4 programming language and theorem prover