User Ms. Molly Stewart-Gallus

6 votes

Are some proof assistants better suited for given areas of math than others?

answered Feb 27, 2022 at 21:31

6 votes

Why are impredicative constructions used less in type theory than in material set theory?

answered Sep 22, 2022 at 19:20

5 votes

Is there any example of a dependent product that makes sense in a non-type-theory context?

answered Mar 19, 2022 at 22:33

3 votes

Can the language of proof assistants be used for general purpose programming?

answered Mar 25, 2022 at 18:54

3 votes

How to represent mathematical partial functions in a type-theory based proof assistant?

answered May 3, 2022 at 18:25

2 votes

Is there any example of a dependent product that makes sense in a non-type-theory context?

answered May 13, 2022 at 0:31

2 votes

What axioms have a computational interpretation?

answered Mar 12, 2022 at 1:56

2 votes

Problem proving a binary add function

answered Apr 16, 2022 at 19:20

2 votes

Bringing OOP features into proof assistants?

answered Apr 22, 2022 at 23:31

2 votes

Creating a proof assistant for first order logic in Haskell

answered Jun 18, 2022 at 18:30

2 votes

Are eliminators useful in practice, or are they only useful in the metatheory?

answered Feb 12, 2022 at 16:01

1 vote

How to extract the witness from exists in Coq in function notation/without destructing?

answered May 1, 2022 at 23:00

1 vote

Replacing (strict) positivity with monotonicity on propositions

answered Apr 4, 2022 at 17:21

1 vote

Do you need a Hilbert style Epsilon operator for definitions in set theory?

answered May 24, 2022 at 22:12

1 vote

Coq defining a hierarchy of collections of integers with infinitely many "levels"

answered May 24, 2022 at 23:11

1 vote

How to evaluate proof terms through opaque definitions?

answered May 30, 2022 at 15:49

1 vote

How to deal with Binders?

answered Jun 3, 2022 at 15:45

1 vote

Coq inductive type with vector parameter lacks sufficient inductive principle

answered Jun 11, 2022 at 16:39

0 votes

Uses of first-class implicit function types

answered Dec 5, 2022 at 19:16

0 votes

Are there any ergonomic ways to deal with finite types in Coq?

answered Jan 20, 2023 at 21:28

0 votes

Why use records for non-empty lists rather than inductively defined non-empty lists?

answered Jul 4, 2022 at 18:30

0 votes

Is coercion to a higher universe injective?

answered Jul 25, 2022 at 20:23

0 votes

Defining essentially unique objects with typeclasses

answered Aug 4, 2022 at 18:09

Stack Exchange Network

23 Answers

Are some proof assistants better suited for given areas of math than others?

Why are impredicative constructions used less in type theory than in material set theory?

Is there any example of a dependent product that makes sense in a non-type-theory context?

Can the language of proof assistants be used for general purpose programming?

How to represent mathematical partial functions in a type-theory based proof assistant?

Is there any example of a dependent product that makes sense in a non-type-theory context?

What axioms have a computational interpretation?

Problem proving a binary add function

Bringing OOP features into proof assistants?

Creating a proof assistant for first order logic in Haskell

Are eliminators useful in practice, or are they only useful in the metatheory?

How to extract the witness from exists in Coq in function notation/without destructing?

Replacing (strict) positivity with monotonicity on propositions

Do you need a Hilbert style Epsilon operator for definitions in set theory?

Coq defining a hierarchy of collections of integers with infinitely many "levels"

How to evaluate proof terms through opaque definitions?

How to deal with Binders?

Coq inductive type with vector parameter lacks sufficient inductive principle

Uses of first-class implicit function types

Are there any ergonomic ways to deal with finite types in Coq?

Why use records for non-empty lists rather than inductively defined non-empty lists?

Is coercion to a higher universe injective?

Defining essentially unique objects with typeclasses