Skip to content


Here are 15 public repositories matching this topic...

tahina-pro commented Oct 23, 2019

With some help from @nikswamy , I am trying to write mutually recursive functions with decreases clauses.

Consider the following example: variable-arity trees with a label on each edge.

module L = FStar.List.Tot
noeq type tree =
| Leaf
| Node:
  (labels: list nat) -> // I should probably add a `L.noRepeats` refinement here, but this is irrelevant here
  (children: ((x: nat {x 

Improve this page

Add a description, image, and links to the fstar topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the fstar topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.