SCSS 2016. 7th International Symposium on Symbolic Computation in Software Science14 articles•182 pages•Published: March 27, 2016 PapersPages 1-13 | Pages 14-28 | Pages 29-41 | Pages 42-54 | Pages 55-67 | Pages 68-80 | Pages 81-94 | Pages 95-106 | Pages 107-116 | Pages 117-129 | Pages 130-142 | Pages 143-155 | Pages 156-168 | Pages 169-182 |
Keyphrasesalpha-equivalence, arithmetization, automated reasoning, binding-time analysis, bit-size, Compass and straightedge construction, completeness, component-based software engineering, computational origami, confluence, Conformal Geometric Algebra, congruence closure, Coq3, critical pairs, cross-stage persistence, data structure, decision procedure, delimited continuations, Expression Compatibility Problem, expression problem, expression simplification, formal semantics, formalization, formalized mathematics, functional logic programming, geometry2, interactive theorem proving, Lagrange interpolation, lexicographic Groebner bases, Lightweight Family Polymorphism, Mathematica, multiplicity, narrowing, network monitors, Nominal rewriting, partial evaluation, planarity, PLCA, predicate logic, program verification, proof assistant, qualitative spatial reasoning, shift and reset, soundness, space complexity, staging, stepper, strategies, symbolic computation, Tarski's system of geometry, term equivalence, theory of equality, Triangular Sets, Wang tiling |
|