User Andrej Bauer

5 votes

Partitioning a list with 2 elements in the middle in coq

answered Jul 13 at 9:19

5 votes

Accepted

Pattern matching from `Prop` to `Type` in Lean

answered Jun 4 at 12:27

5 votes

Accepted

Is there a most flexible type theory or proof assistant?

answered Jun 19 at 16:24

5 votes

How to abstract over function arity in Lean and Coq?

answered Mar 14 at 22:01

5 votes

Weird use of equality in Coq

answered May 1 at 10:22

5 votes

Accepted

Auxiliary Typeclasses in Lean

answered May 30 at 8:05

4 votes

Accepted

Reasoning about non reflexive equalities & type conversions

answered May 3 at 20:21

4 votes

Accepted

Feferman's universes for proof assistants?

answered Jun 28 at 12:51

4 votes

Is there a multiway system which is equivalent to taking ZFC as axioms?

answered Nov 20 at 12:22

4 votes

Data constructors and universe constraints

answered Mar 1, 2022 at 8:22

4 votes

Accepted

How to convince Agda that definition is terminating in the presence of unapplied recursion?

answered Oct 14, 2022 at 18:34

4 votes

Accepted

What is a 'truncation'?

answered Jun 13, 2022 at 7:47

3 votes

Creating a proof assistant for first order logic in Haskell

answered Jun 18, 2022 at 10:38

3 votes

Is there a tactic in Coq to make a hypothesis from applying two hypotheses?

answered Aug 8, 2022 at 16:29

3 votes

How to elaborate with dependent records present?

answered Feb 28, 2022 at 10:34

3 votes

(Dis)Advantages of basing a proof assistant on CH correspondence?

answered Sep 19 at 13:04

3 votes

Accepted

How to reason about and extract code for inductive types with negative occurrences in Coq?

answered Aug 15 at 7:37

3 votes

Can we prove every provable statement with Lean?

answered Aug 15 at 16:48

3 votes

Accepted

Can alg be used for the formal semantics of a language?

answered Jun 10 at 9:24

3 votes

How does one show termination of a function that is structurally recursive over a type T with subterms of type List T?

answered Jul 8 at 10:37

3 votes

Accepted

How to encode and manipulate (parallel) substitutions?

answered Jun 1 at 21:10

3 votes

How does Z3 "exhaustively search" real numbers?

answered May 25 at 13:31

3 votes

Abstracting over large types in type theory

answered May 26 at 11:24

2 votes

Accepted

Recursive definition of a sum of squares

answered Jun 3 at 14:54

2 votes

Accepted

State-of-the-art constructive encodings of Reals in a (constructive) type theory that supports quotient-types

answered May 21 at 10:02

2 votes

What if identity type in extensional type theory were possibly non-deterministic?

answered Jul 15 at 8:02

2 votes

What is the type-in-type problem in idris2 and can it be avoided?

answered Aug 26 at 8:28

2 votes

Accepted

problem with unification

answered Nov 18 at 9:20

2 votes

Accepted

New types in higher order logic

answered Aug 5 at 9:29

2 votes

Coq: can `tauto` be used to prove classical tautologies?

answered Aug 20, 2022 at 21:26

Stack Exchange Network

101 Answers

Partitioning a list with 2 elements in the middle in coq

Pattern matching from `Prop` to `Type` in Lean

Is there a most flexible type theory or proof assistant?

How to abstract over function arity in Lean and Coq?

Weird use of equality in Coq

Auxiliary Typeclasses in Lean

Reasoning about non reflexive equalities & type conversions

Feferman's universes for proof assistants?

Is there a multiway system which is equivalent to taking ZFC as axioms?

Data constructors and universe constraints

How to convince Agda that definition is terminating in the presence of unapplied recursion?

What is a 'truncation'?

Creating a proof assistant for first order logic in Haskell

Is there a tactic in Coq to make a hypothesis from applying two hypotheses?

How to elaborate with dependent records present?

(Dis)Advantages of basing a proof assistant on CH correspondence?

How to reason about and extract code for inductive types with negative occurrences in Coq?

Can we prove every provable statement with Lean?

Can alg be used for the formal semantics of a language?

How does one show termination of a function that is structurally recursive over a type T with subterms of type List T?

How to encode and manipulate (parallel) substitutions?

How does Z3 "exhaustively search" real numbers?

Abstracting over large types in type theory

Recursive definition of a sum of squares

State-of-the-art constructive encodings of Reals in a (constructive) type theory that supports quotient-types

What if identity type in extensional type theory were possibly non-deterministic?

What is the type-in-type problem in idris2 and can it be avoided?

problem with unification

New types in higher order logic

Coq: can `tauto` be used to prove classical tautologies?