Custom query (522 matches)

Filters
 
or
 
  
 
Columns

Show under each result:


Results (401 - 500 of 522)

1 2 3 4 5 6

Status: closed (35 matches)

Ticket Summary Owner Type Priority Version Severity
#15879 While one sided ckunz enhancement 3 pre-1.x
#15880 Constant propagation with module variable Pierre-Yves Strub enhancement 3 pre-1.x
#15881 Complete path for local variable in printer Pierre-Yves Strub defect 3 pre-1.x
#15891 Instantiating axioms and sub-theories when cloning theories Pierre-Yves Strub enhancement 4 pre-1.x
#15893 Call in adversary call is not working properly Benjamin Grégoire defect 4 pre-1.x
#15906 (local) opening of modules Pierre-Yves Strub enhancement 2 pre-1.x
#15907 clone import and clone export Pierre-Yves Strub enhancement 3 pre-1.x
#15912 Be able to inline only one side after an equiv Pierre-Yves Strub enhancement 2 pre-1.x
#15917 Proving "a = b => f a = f b" should not require a call to SMT Pierre-Yves Strub enhancement 3 pre-1.x
#15918 Tactic for proving an equiv/hoare/bd_hoare goal when the pre-condition is contradictory Santiago Zanella-Béguelin enhancement 3 pre-1.x
#15919 [case] tactic for bd_hoare is useless Benjamin Grégoire defect 3 pre-1.x
#15920 [conseq (_ : pre => _)] tactic for bd_hoare doesn't work Santiago Zanella-Béguelin defect 3 pre-1.x
#15921 A strongest post-condition tactic [sp n m], like in trunk ckunz enhancement 3 pre-1.x
#15930 Clear all Pierre-Yves Strub enhancement 2 pre-1.x
#15974 The following example generates an anomaly Benjamin Grégoire defect 3 pre-1.x
#15981 "delta cpEq" causes an untypable goal to be produced Benjamin Grégoire defect 3 pre-1.x
#15982 Printer bug for partially applied infix operators in prefix form Benjamin Grégoire defect 3 pre-1.x
#16082 move * for adversary function outside { ... } Pierre-Yves Strub enhancement 3 pre-1.x
#16087 New view for apply: !a -> (a => false) Pierre-Yves Strub enhancement 2 pre-1.x
#16253 Non-local modules and abstract restrictions. defect 3 pre-1.x
#16292 Side-conditions for the rnd rule in pHL should be proved under some precondition ckunz defect 3 pre-1.x
#16362 Assertion failure when cloning a theory with let expressions Benjamin Grégoire defect 3 pre-1.x
#16456 allow expression, formula in cloning Pierre-Yves Strub enhancement 3 pre-1.x
#16560 Non-relational 'bypr' for probabilistic Hoare statements ckunz enhancement 3 pre-1.x
#16622 Functor-level "lambdas" Benjamin Grégoire enhancement 2 pre-1.x
#16657 Pattern-matching on records Pierre-Yves Strub enhancement 3 pre-1.x
#16723 Subtyping for abstract modules and functors Benjamin Grégoire enhancement 3 pre-1.x
#16732 Problem with functor aliases when outermost module is a parameter Benjamin Grégoire defect 3 pre-1.x
#16746 Losslessness annotations Pierre-Yves Strub enhancement 2 pre-1.x
#16749 link between hoare bdhoare equiv Benjamin Grégoire enhancement 3 pre-1.x
#16763 Simplification should discriminate datatype constructors Pierre-Yves Strub enhancement 3 pre-1.x
#16780 Change the test script so the test suites can be run in weak check mode Pierre-Yves Strub enhancement 3 pre-1.x
#16789 Pattern matching should to some top-level delta-unfolding Pierre-Yves Strub enhancement 3 pre-1.x
#16885 Support for type annotations in let expressions Pierre-Yves Strub enhancement 1 pre-1.x
#16918 selection tactical "all n" Pierre-Yves Strub enhancement 3 pre-1.x

Status: new (65 matches)

Ticket Summary Owner Type Priority Version Severity
#17298 Super rnd enhancement 4 phl blocker
#17002 Better section && cloning support Pierre-Yves Strub task 3 pre-1.x major
#17163 Check that `phoare` tactics are forcing the input bounds to be in [0..1]. task 4 pre-1.x major
#17202 Add seq* tactic enhancement 3 pre-1.x major
#16648 Make notations and tactics on distributions and functions a bit more uniform. enhancement 3 pre-1.x normal
#16912 Lifting the "collection update" statements to tuples enhancement 1 pre-1.x normal
#16987 Move facts from precondition to context enhancement 3 pre-1.x normal
#17022 Pattern-matching on variables in judgments and probability expressions enhancement 3 pre-1.x normal
#17036 Instantiating abstract modules: warnings and interactive justification enhancement 1 pre-1.x normal
#17045 Rewriting procedures in probability expressions directly from an equivalence enhancement 1 pre-1.x normal
#17082 SMT tactic should be interruptable. Pierre-Yves Strub enhancement 4 pre-1.x normal
#17085 Generic Notations Pierre-Yves Strub enhancement 3 pre-1.x normal
#17086 Generalize [rewrite Pr] enhancement 3 pre-1.x normal
#17088 `case !a` should reduce to proving `a` Pierre-Yves Strub enhancement 2 pre-1.x normal
#17090 Selecting procedure(s) to [inline] by position enhancement 2 pre-1.x normal
#17105 [transitivity] for phoare and hoare enhancement 3 pre-1.x normal
#17113 Decide what to do on rewrite with defined head symbols enhancement 3 pre-1.x normal
#17136 variant of seq to deal with large preconditions enhancement 3 pre-1.x normal
#17140 Pattern matching should make use of simplification rules. enhancement 3 pre-1.x normal
#17149 Expand glob A for concrete module enhancement 3 pre-1.x normal
#17156 New vernacular command: `print axiom` enhancement 3 pre-1.x normal
#17164 behavior of -check-all enhancement 3 pre-1.x normal
#17169 Anonymous functor arguments: passing procedures to functors directly enhancement 3 pre-1.x normal
#17175 Direct intro on negative goals enhancement 3 pre-1.x normal
#17183 Variant of `sim` that works modulo inlining. enhancement 1 pre-1.x normal
#17192 Problem with `glob` and type inference defect 3 pre-1.x normal
#17197 Asserts in equivalence proofs enhancement 3 pre-1.x normal
#17210 Pattern-matching for pairs in operator arguments enhancement 3 pre-1.x normal
#17215 Issues with module typing when functor parameters are themselves functors defect 3 pre-1.x normal
#17217 need better error message when attempting to apply lemma to goal that isn't a judgment enhancement 3 pre-1.x normal
#17218 proposal for expressing goal of two-sided PRHL rnd tactic using isomorphism of bijections predicate enhancement 3 pre-1.x normal
#17225 Explore reproducible smt calls enhancement 3 pre-1.x normal
#17239 Mutual inductive types. enhancement 3 pre-1.x normal
#17245 Formula manipulation commands (for `conseq` and `seq`) enhancement 3 pre-1.x normal
#17246 `rewrite`, apply, ... in contracts defect 3 pre-1.x normal
#17251 print Self enhancement 3 pre-1.x normal
#17257 `/=` is too weak. defect 3 pre-1.x normal
#17267 `auto` with `call` enhancement 3 pre-1.x normal
#17279 Improve `invalid goal shape` error messages for variants of `byequiv` enhancement 3 pre-1.x normal
#17281 Several problems with `apply` in program logics enhancement 3 pre-1.x normal
#17282 call should not work task 3 phl normal
#17283 pattern matching complexity problem defect 3 pre-1.x normal
#17285 Transitivity on procedures should support inferring contracts from `equiv` lemmas. enhancement 3 pre-1.x normal
#17286 pRHL `apply` should have a framing variant enhancement 3 pre-1.x normal
#17287 Program transformation tactics should not `anomaly` without a side in pRHL defect 3 pre-1.x normal
#17288 EasyCrypt crashes when printing required abstract theory IterProc defect 3 pre-1.x normal
#17290 `n!->>` should work enhancement 3 pre-1.x normal
#17295 local ops enhancement 3 pre-1.x normal
#17297 Allow the optional use of undeclared variables in procedures enhancement 1 pre-1.x normal
#17301 Applicative view for `if then else` enhancement 3 pre-1.x normal
#17305 proc* in eager case needlessly assigns result of procedures returning unit to variables enhancement 3 pre-1.x normal
#17311 `smt (@Self)` enhancement 3 pre-1.x normal
#17316 [smt (@Theory)] should force the use of axioms marked as `nosmt` defect 3 pre-1.x normal
#17317 `search` should work somewhat better with abbreviations enhancement 3 pre-1.x normal
#17322 use of side with HL version of while tactic should be syntax error defect 3 pre-1.x normal
#17325 syntax marking end of cloning realization enhancement 3 pre-1.x normal
#17337 substitutions should complain when substituting a locally defined variable enhancement 3 pre-1.x normal
#17340 cfold should support variables (and more general terms). enhancement 3 pre-1.x normal
#17341 for loops enhancement 3 pre-1.x normal
#17342 Better support for rewriting with equivalences enhancement 3 pre-1.x normal
#17344 Trees and polynomials enhancement 3 pre-1.x normal
#17346 have access to notation in ml defect 3 pre-1.x normal
#17348 Intro-pattern `|>` might transform a provable goal to a non-provable one defect 3 pre-1.x normal
#17349 call tactic for aequiv conclusions enhancement 3 pre-1.x normal
#17351 sp for aqeuiv goals enhancement 3 pre-1.x normal
(more results for this group on next page)
1 2 3 4 5 6
Note: See TracQuery for help on using queries.