Sciweavers

1071 search results - page 23 / 215
» The Calculus of Algebraic Constructions
Sort
View
TCS
2008
13 years 9 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 9 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
EJC
2006
13 years 9 months ago
Hadamard ideals and Hadamard matrices with two circulant cores
We apply Computational Algebra methods to the construction of Hadamard matrices with two circulant cores, given by Fletcher, Gysin and Seberry. We introduce the concept of Hadamar...
Ilias S. Kotsireas, Christos Koukouvinos, Jennifer...
AAECC
2007
Springer
143views Algorithms» more  AAECC 2007»
14 years 3 months ago
Constructions of Orthonormal Lattices and Quaternion Division Algebras for Totally Real Number Fields
Abstract. We describe some constructions of orthonormal lattices in totally real subfields of cyclotomic fields, obtained by endowing their ring of integers with a trace form. We...
B. A. Sethuraman, Frédérique E. Oggi...
CSL
2010
Springer
13 years 10 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter