Sciweavers

226 search results - page 13 / 46
» Extensional Theories and Rewriting
Sort
View
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 7 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
CADE
2006
Springer
14 years 8 months ago
Cut-Simulation in Impredicative Logics
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
Christoph Benzmüller, Chad E. Brown, Michael ...
JSYML
2006
87views more  JSYML 2006»
13 years 7 months ago
Permutations and wellfoundedness: the true meaning of the bizarre arithmetic of Quine's NF
It is shown that, according to NF, many of the assertions of ordinal arithmetic involving the T-function which is peculiar to NF turn out to be equivalent to the truth-in-certain-...
Thomas Forster
MSCS
2008
119views more  MSCS 2008»
13 years 7 months ago
Structural subtyping for inductive types with functorial equality rules
Subtyping for inductive types in dependent type theories is studied in the framework of coercive subtyping. General structural subtyping rules for parameterised inductive types ar...
Zhaohui Luo, Robin Adams