pghs975uc
/
infer_clone
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'cbfb9612e5'
${ noResults }
infer_clone/sledge/nonstdlib/qset.mli

15 lines
388 B
Raw Normal View History Unescape

[sledge] Reimplement arithmetic and congruence closure Summary: - Add nary expressions implemented using a form of multisets which support any integer multiplicity - Reimplement polynomials using new nary expressions - Move the decomposition of exps into "base plus offset" form into Exp, to enforce simplification invariants - Revise expression simplification to cooperate with congruence closure (mainly: simplification should not invent new subexpressions) - Reimplement congruence closure plus integer offsets to + cope with new representation of polynomials using nary expression forms + be diligent about maintaining which expressions are in the relation + add lots of invariant checking for the correlations between the componnents of the congruence closure data structures Reviewed By: jvillard Differential Revision: D14075512 fbshipit-source-id: 2dbaf3d11
6 years ago
(*
[copyright] Remove years Reviewed By: jvillard Differential Revision: D15771884 fbshipit-source-id: e2997e3a3
6 years ago
* Copyright (c) Facebook, Inc. and its affiliates.
[sledge] Reimplement arithmetic and congruence closure Summary: - Add nary expressions implemented using a form of multisets which support any integer multiplicity - Reimplement polynomials using new nary expressions - Move the decomposition of exps into "base plus offset" form into Exp, to enforce simplification invariants - Revise expression simplification to cooperate with congruence closure (mainly: simplification should not invent new subexpressions) - Reimplement congruence closure plus integer offsets to + cope with new representation of polynomials using nary expression forms + be diligent about maintaining which expressions are in the relation + add lots of invariant checking for the correlations between the componnents of the congruence closure data structures Reviewed By: jvillard Differential Revision: D14075512 fbshipit-source-id: 2dbaf3d11
6 years ago
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*)
[sledge] Change polynomial coefficients and powers to rationals Summary: Rational coefficients enable solving equations via Gaussian elimination, and rational powers enable some normalization of multiplication and division. Reviewed By: ngorogiannis Differential Revision: D14233213 fbshipit-source-id: acecb7f16
6 years ago
(** Qset - Set with (signed) rational multiplicity for each element *)
[sledge] Reimplement arithmetic and congruence closure Summary: - Add nary expressions implemented using a form of multisets which support any integer multiplicity - Reimplement polynomials using new nary expressions - Move the decomposition of exps into "base plus offset" form into Exp, to enforce simplification invariants - Revise expression simplification to cooperate with congruence closure (mainly: simplification should not invent new subexpressions) - Reimplement congruence closure plus integer offsets to + cope with new representation of polynomials using nary expression forms + be diligent about maintaining which expressions are in the relation + add lots of invariant checking for the correlations between the componnents of the congruence closure data structures Reviewed By: jvillard Differential Revision: D14075512 fbshipit-source-id: 2dbaf3d11
6 years ago
[sledge] Dedup Qset interface Reviewed By: ngorogiannis Differential Revision: D20482755 fbshipit-source-id: dd075d68f
5 years ago
include module type of Qset_intf
[sledge] Implement Qset using Import.Map Reviewed By: ngorogiannis Differential Revision: D20583759 fbshipit-source-id: d39b13508
5 years ago
module Make (Elt : sig
type t [@@deriving compare, sexp_of]
end) : S with type elt = Elt.t