python (65.2k questions)
javascript (44.3k questions)
reactjs (22.7k questions)
java (20.8k questions)
c# (17.4k questions)
html (16.3k questions)
r (13.7k questions)
android (13k questions)
Applying known proofs in Idris 1 interactive elaborator
I am trying to get some familiarity with theorem proving in Idris1 by exercise and am running into trouble.
Suppose I have the following definition for naturals and the following theorems that I want ...

Andrii Kozytskyi
Votes: 0
Answers: 1
Solving for all valid inputs with an ATS
Let's say you have a system of pure expressions, like,
(bi0, bi1, bi2, ai0, ai1, ai2) := inputs
b0 := bi0 && bi1
a1 := b0 ? ai0 : cbrt(ai0)
a2 := bi2 ? a1 : ai1
output := a2 > ai2
# prove:...
alexchandel
Votes: 0
Answers: 1
Haskell theorem proving tactics as indexed functors and monads
I am trying to follow along with this blog post to make a simple intuitionistic theorem proving language in Haskell. Mr. van Bakel suggests using indexed monads for proof state manipulation; here are ...

Andrii Kozytskyi
Votes: 0
Answers: 1
How does one define dependent type with named arguments in Coq without issues in unification in the constructors?
I want to defined a lenghted list but I like arguments with names at the top of the inductive definition. Whenever I try that I get unification errors with things I hoped worked and was forced to do a...

Charlie Parker
Votes: 0
Answers: 1