Sciweavers

2373 search results - page 143 / 475
» On the Theory of Structural Subtyping
Sort
View
CORR
2004
Springer
110views Education» more  CORR 2004»
15 years 6 months ago
Shannon Information and Kolmogorov Complexity
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
Peter Grünwald, Paul M. B. Vitányi
CADE
2011
Springer
14 years 6 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
CIE
2007
Springer
16 years 23 days ago
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
Andrej Bauer, Christopher A. Stone
ENTCS
2006
101views more  ENTCS 2006»
15 years 6 months ago
Towards "Dynamic Domains": Totally Continuous Cocomplete Q-categories
It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the d...
Isar Stubbe
ACS
2002
15 years 6 months ago
Azumaya Categories
We define the notions of Azumaya category and Brauer group in category theory enriched over some very general base category V. We prove the equivalence of various definitions, in ...
Francis Borceux, Enrico Vitale