Sciweavers

1410 search results - page 137 / 282
» Proving theorems by reuse
Sort
View
ENTCS
2002
109views more  ENTCS 2002»
15 years 5 months ago
Induction, Coinduction, and Adjoints
We investigate the reasons for which the existence of certain right adjoints implies the existence of some final coalgebras, and vice-versa. In particular we prove and discuss the...
J. Robin B. Cockett, Luigi Santocanale
ENTCS
2002
121views more  ENTCS 2002»
15 years 5 months ago
Modal Predicates and Co-equations
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...
Alexander Kurz, Jirí Rosický
JCT
2000
81views more  JCT 2000»
15 years 5 months ago
Generalized Rook Polynomials
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are establishedwith absolu...
Jay Goldman, James Haglund
SIAMCO
2000
111views more  SIAMCO 2000»
15 years 5 months ago
Superreplication Under Gamma Constraints
In a financial market consisting of a nonrisky asset and a risky one, we study the minimal initial capital needed in order to superreplicate a given contingent claim under a gamma ...
H. Mete Soner, Nizar Touzi
JCSS
2010
102views more  JCSS 2010»
15 years 4 months ago
Matching and alpha-equivalence check for nominal terms
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
Christophe Calvès, Maribel Fernández