diff options
| author | Morgan Deters <mdeters@gmail.com> | 2011-04-25 23:44:00 +0000 |
|---|---|---|
| committer | Morgan Deters <mdeters@gmail.com> | 2011-04-25 23:44:00 +0000 |
| commit | 97111ecb8681838f2d201420cda12ca9fc7184ed (patch) | |
| tree | eee78a3ff75c1c9535b1db89ed273116a6ef3542 /src/theory/uf/kinds | |
| parent | de164c9308f6461472b95c23aae68d9d9686d8ae (diff) | |
Monday tasks:
* new "well-foundedness" type property (like cardinality) specified in
Theory kinds files; specifies well-foundedness and a ground term
* well-foundedness / finite checks in Datatypes now superseded by type
system isFinite(), isWellFounded(), mkGroundTerm().
* new "RecursionBreaker" template class, a convenient class that keeps
a "seen" trail without you having to pass it around (which is
difficult in cases of mutual recursion) of the idea of passing
around a "seen" trail
Diffstat (limited to 'src/theory/uf/kinds')
| -rw-r--r-- | src/theory/uf/kinds | 6 |
1 files changed, 5 insertions, 1 deletions
diff --git a/src/theory/uf/kinds b/src/theory/uf/kinds index d7f542038..9498fa6fb 100644 --- a/src/theory/uf/kinds +++ b/src/theory/uf/kinds @@ -13,7 +13,10 @@ rewriter ::CVC4::theory::uf::TheoryUfRewriter "theory/uf/theory_uf_rewriter.h" # Justified because we can have an unbounded-but-finite number of # sorts. Assuming we have |Z| is probably ok for now.. -sort KIND_TYPE Cardinality::INTEGERS "Uninterpreted Sort" +sort KIND_TYPE \ + Cardinality::INTEGERS \ + not-well-founded \ + "Uninterpreted Sort" parameterized APPLY_UF VARIABLE 1: "uninterpreted function application" @@ -23,5 +26,6 @@ parameterized SORT_TYPE SORT_TAG 0: "sort type" # enough (for now) ? Once we support quantifiers, maybe reconsider # this.. cardinality SORT_TYPE "Cardinality(Cardinality::INTEGERS)" +well-founded SORT_TYPE false endtheory |