Community Digest

Top new questions this week:

Tracing the classical reasoner in Isabelle

Some time ago I asked this question on Stack Overflow but got no answer: https://stackoverflow.com/questions/60521384/tracing-tactics-in-isabelle Section 9.4 The Classical Reasoner of the Isar ...

isabelle isabelle-hol classical-logic  
asked by Gergely Score of 6
answered by Pedro Sánchez Terraf Score of 6

Is there a way to use higher order abstract syntax with linear types?

Is there a way to use HOAS style with linear types? I'm also interested in affine types or other substructural systems. I vaguely recall there has been some work for embedded DSLs for Haskell but I'm ...

binders  
asked by Molossus Spondee Score of 3
answered by Neel Krishnaswami Score of 4

Recursive notations with forall quantifier

How can I implement a notation of the form: ∀ x ≤ y ≤ .. ≤ z ≤ t, φ in Coq? A similar notation (but without quantifiers) appears here ...

coq notation  
asked by Vladimir Prigodsky Score of 3

Greatest hits from previous weeks:

Why haven't all of the "hundred greatest theorems" been formalized yet?

The "hundred greatest theorems" used to be maintained here. See this page for the current status of the formalization of these theorems. Apparentely, Fermat's Last Theorem, the Isoperimetric ...

mathematics  
asked by Dustin G. Mixon Score of 24
answered by Kevin Buzzard Score of 27

Proof assistants for beginners - a comparison

What is a good starting point to learn about proof assistants? The answer will invariably depend on the area of interest: mathematics (and its areas, e.g. algebra,combinatorics, analysis, logic), CS - ...

installation beginner ide learning  
asked by Piotr Migdal Score of 31
answered by Agnishom Chattopadhyay Score of 26

How hard is computing integrals in Lean?

Are there tools in mathlib which let you give computations of integrals which would roughly follow standard methods for solving them? For now let me restrict attention to some undergrad-level ...

lean mathematics lean-mathlib calculus  
asked by Wojowu Score of 18
answered by Jacques Carette Score of 10

Which programming languages are most similar to proof assistants?

Related to What is the easiest proof assistant to start with? – I suppose familiarity with programming in general would be beneficial to learning how to work with proof assistants. But which kind of ...

learning  
asked by Glorfindel Score of 13
answered by Agnishom Chattopadhyay Score of 19

What are the bases for different Proof Assistants?

From the Wikipedia article on Proof Assistant it shows some Proof Assistants are based on Higher Order Logic, (HOL Light) and some are based on Dependent Types, (Coq). Are there any other means upon ...

dependent-type foundations cubical-type-theory higher-order-logic  
asked by Guy Coder Score of 29
answered by Namdak Tönpa Score of 29

What are the differences between MLTT and CIC?

In the theory and design of proof assistants based upon dependent types, I feel like there’s a somewhat cultural divide between the "MLTT" world (with Agda as the main representative proof ...

agda type-theory coq calculus-of-inductive-constructions martin-lof-type-theory  
asked by Meven Lennon-Bertrand Score of 24
answered by Neel Krishnaswami Score of 19

What is the state of coinductive types and reasoning in Coq?

Ever since the work by Gimenez for his PhD thesis, Coq has supported positive coinductive types. For example, the type of always-infinite streams containing elements of type ...

coq coinductive-type  
asked by palmskog Score of 16
answered by Pierre-Marie Pédrot Score of 13
You're receiving this message because you subscribed to the Proof Assistants community digest.
Unsubscribe from this community digest       Edit email settings       Leave feedback       Privacy
Stack Overflow

Stack Overflow, 110 William Street, 28th floor, New York, NY 10038

<3