It looks like you're new here. If you want to get involved, click one of these buttons!

- All Categories 2.3K
- Chat 502
- Study Groups 21
- Petri Nets 9
- Epidemiology 4
- Leaf Modeling 2
- Review Sections 9
- MIT 2020: Programming with Categories 51
- MIT 2020: Lectures 20
- MIT 2020: Exercises 25
- Baez ACT 2019: Online Course 339
- Baez ACT 2019: Lectures 79
- Baez ACT 2019: Exercises 149
- Baez ACT 2019: Chat 50
- UCR ACT Seminar 4
- General 72
- Azimuth Code Project 110
- Statistical methods 4
- Drafts 10
- Math Syntax Demos 15
- Wiki - Latest Changes 3
- Strategy 113
- Azimuth Project 1.1K
- - Spam 1
- News and Information 148
- Azimuth Blog 149
- - Conventions and Policies 21
- - Questions 43
- Azimuth Wiki 715

Options

- Class summary by David Dalrymple. YouTube link.

## Comments

I found one of the comments made in passing to be very interesting.

Very very heavily paraphrasing:

and

Interested, I looked for what is out there on the web on this sort of thing:

Coq is not unique. For instance, the redprl project (a successor to nuprl, another proof system), can be found here http://www.redprl.org/en/latest/

Small proof languages can be thought of as a subset (subcategory?) of functional programming languages, and you can write things like web servers in them, eg https://github.com/coq-concurrency/pluto.

`I found one of the comments made in passing to be very interesting. Very very heavily paraphrasing: >[Coq is useful in its way for providing proofs of termination of a partial function, but not really practical for most purposes in programming] and >[Proofs are not a first class object in Haskell (but are in Coq)] Interested, I looked for what is out there on the web on this sort of thing: * https://github.com/coq/coq/wiki/List-of-Coq-PL-Projects * https://basics.sjtu.edu.cn/~yuxin/teaching/Coq/Coq2018.html, a 2018 course on coq * https://coq.inria.fr/tutorial-nahas, a tutorial for using the language / getting started * https://coq.inria.fr/, the main page for the language * https://softwarefoundations.cis.upenn.edu/, some resources on proof systems * http://adam.chlipala.net/itp/, older but still valuable resources on formal proof systems (2006) Coq is not unique. For instance, the redprl project (a successor to nuprl, another proof system), can be found here http://www.redprl.org/en/latest/ Small proof languages can be thought of as a subset (subcategory?) of functional programming languages, and you can write things like web servers in them, eg https://github.com/coq-concurrency/pluto.`