Sciweavers

544 search results - page 16 / 109
» The Algebra of Equality Proofs
Sort
View
LICS
2010
IEEE
13 years 6 months ago
Equality Is Typable in Semi-full Pure Type Systems
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
Vincent Siles, Hugo Herbelin
ENTCS
2006
113views more  ENTCS 2006»
13 years 8 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
FUIN
2007
100views more  FUIN 2007»
13 years 7 months ago
An Algebraic Characterization of the Halting Probability
Using 1947 work of Post showing that the word problem for semigroups is unsolvable, we explicitly exhibit an algebraic characterization of the bits of the halting probability Ω....
Gregory J. Chaitin
COMBINATORICS
2007
67views more  COMBINATORICS 2007»
13 years 8 months ago
Non-Commutative Sylvester's Determinantal Identity
Sylvester’s identity is a classical determinantal identity with a straightforward linear algebra proof. We present combinatorial proofs of several non-commutative extensions, an...
Matjaz Konvalinka
CADE
2000
Springer
14 years 8 days ago
System Description: ARA - An Automatic Theorem Prover for Relation Algebras
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
Carsten Sinz