Quantcast
Channel: How do I express a fixpoint of a decreasing argument that is not a subterm of the function's argument? - Proof Assistants Stack Exchange
Browsing latest articles
Browse All 4 View Live

Answer by Pietro Braione for How do I express a fixpoint of a decreasing...

It turns out that using Program Fixpoint is much easier than I thought:From Coq Require Import Program.Wf....Inductive height (e : expression) : nat match e with | Get e1 => height e1 + 1 |...

View Article



Answer by Andrej Bauer for How do I express a fixpoint of a decreasing...

I find your definition of eval a bit odd. You are implementing something like large-step evaluation, which should be defined by structural recursion on the expression being evaluated.I would expect...

View Article

Answer by Lolo for How do I express a fixpoint of a decreasing argument that...

Maybe you could have a fixpoint dedicated to Get to avoid rebuilding terms.Fixpoint eval_get (M : memory) (e : expression) (var_name : identifier) : value := match e with | IfThenElse cond e1 e2 var...

View Article

How do I express a fixpoint of a decreasing argument that is not a subterm of...

I have a recursively defined function in Coq whose arguments in the recursive invocations are surely decreasing, but Coq cannot understand this fact since they are not subterms of the function's...

View Article
Browsing latest articles
Browse All 4 View Live




Latest Images