learnyouahaskell
coq
Our great sponsors
learnyouahaskell  coq  

74  81  
283  4,229  
  1.6%  
0.0  9.9  
10 months ago  about 15 hours ago  
Makefile  OCaml  
  GNU Lesser General Public License v3.0 only 
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.
learnyouahaskell

So Hows the Hackathon Going?
you start that way, but don't do http://learnyouahaskell.com really?
 help i just discovered haskell 38 hours ago and i think i love it

Why I decided to learn (and teach) Clojure
Elm is a statically typed language inspired by Haskell. The natural step would be to use Elm on the frontend and Haskell on the backend. And that's what I tried to do. I read with some difficulty the Learn You a Haskell for Great Good! book (available for free here) and learned a lot of cool stuff. But creating a complete backend using Haskell proved to be more than I could chew. So I decided to look for alternatives...

I’m trying coding
Here y’go!

Starting out.
Definitely check out: http://learnyouahaskell.com

Can someone define a monad in simple terms?
You see? It's not simple but you'll get there if you persist. Most Haskell and Purescript books cover it. Personally it clicked for me going through the "learn you a haskell" book. http://learnyouahaskell.com
 Počeo da učim Haskell

Combine and functional programming
You just wait until you start reading this http://learnyouahaskell.com/
 I’m now 25. Should I move out for the sake of independence & struggle financially or should I continue to save for a house?

"Learn Haskell by building a blog generator" is a great resource for learning
This is my second time learning Haskell. I’ve learned it at the university in a course and through http://learnyouahaskell.com, but I’ve mostly forgotten everything but the basics.
coq

Mark Petruska has requested 250000 Algos for the development of a Coqavm library for AVM version 8
Information about the Coq proof assistant: https://coq.inria.fr/ , https://en.wikipedia.org/wiki/Coq

Basic SAT model of x86 instructions using Z3, autogenerated from Intel docs
This type of thing can help you formally verify code.
So, if your proof is correct, and your description of the (language/CPU) is correct, you can prove the code does what you think it does.
Formal proof systems are still growing up, though, and they are still pretty hard to use. See Coq for an introduction: https://coq.inria.fr/

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.
 The seven programming urlanguages
 Rosenpass – formally verified postquantum WireGuard

Any small/simple proof languages?
If you're meaning "more similar to common mathematics" then look at Lean or Coq.

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.

Facts and numbers are not that accurate, actually...
Our approach to quantitative reasoning is not grounded in formal mathematics. Minerva parses questions and generates answers using a mix of natural language and LaTeX mathematical expressions, with no explicit underlying mathematical structure. This approach has an important limitation, in that the model’s answers cannot be automatically verified. Even when the final answer is known and can be verified, the model can arrive at a correct final answer using incorrect reasoning steps, which cannot be automatically detected. This limitation is not present in formal methods for theorem proving (e.g., see Coq, Isabelle, HOL, Lean, Metamath, and Mizar). On the other hand, an advantage of the informal approach is that it can be applied to a highly diverse set of problems which may not lend themselves to formalization.

is CS an engineering practice?
The computer scientists who are figuring these things out are constructing the tools that software engineers need; just like the mathematicians who developed calculus and the physicists who extended Newtonian mechanics into something engineers can apply. Just as an engineer's tools and materials are calculus and physics (not hammers or concrete and steel), a software engineer's tools and materials are proofassistants, category theory, linear polarized logic, and dependent type theory (not the Rust programming language or the UNIX platform).
 OCaml 5.0 Multicore is out
What are some alternatives?
coc.nvim  Nodejs extension host for vim & neovim, load extensions like VSCode and host language servers.
kok.nvim  Fast as FUCK nvim completion. SQLite, concurrent scheduler, hundreds of hours of optimization.
FStar  A Prooforiented Programming Language
Agda  Agda is a dependently typed programming language / interactive theorem prover.
coq.vim  Pathogencompatible distribution of Vicent Aravantinos' vim scripts for Coq.
coqserapi  Coq Protocol Playground with Se(xp)rialization of Internal Structures.
CoqGym  A Learning Environment for Theorem Proving with the Coq proof assistant
mathlib  Lean mathematical components library
CompCert  The CompCert formallyverified C compiler
lean4  Lean 4 programming language and theorem prover
learn4haskell  👩🏫 👨🏫 Learn Haskell basics in 4 pull requests
plutuspioneerprogram  This repository hosts the lectures of the Plutus Pioneers Program. This program is a training course that the IOG Education Team provides to recruit and train software developers in Plutus, the native smart contract language for the Cardano ecosystem.