Sciweavers

2436 search results - page 48 / 488
» Comonadic Notions of Computation
Sort
View
118
Voted
NIPS
2007
15 years 5 months ago
Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria
We study the relation between notions of game-theoretic equilibria which are based on stability under a set of deviations, and empirical equilibria which are reached by rational p...
Elad Hazan, Satyen Kale
153
Voted
LPAR
2010
Springer
15 years 1 months ago
Logic and Computation in a Lambda Calculus with Intersection and Union Types
We present an explicitly typed lambda calculus "`a la Church" based on the union and intersection types discipline; this system is the counterpart of the standard type a...
Daniel J. Dougherty, Luigi Liquori
CIE
2010
Springer
15 years 8 months ago
What Is the Problem with Proof Nets for Classical Logic?
This paper is an informal (and nonexhaustive) overview over some existing notions of proof nets for classical logic, and gives some hints why they might be considered to be unsatis...
Lutz Straßburger
125
Voted
RTA
1999
Springer
15 years 7 months ago
On the Strong Normalisation of Natural Deduction with Permutation-Conversions
We present a modular proof of the strong normalisation of intuitionistic logic with permutation-conversions. This proof is based on the notions of negative translation and CPS-simu...
Philippe de Groote
111
Voted
DCC
2010
IEEE
15 years 3 months ago
Equidistant frequency permutation arrays and related constant composition codes
This paper introduces and studies the notion of an equidistant frequency permutation array (EFPA). An EFPA of length n = m, distance d and size v is defined to be a v
Sophie Huczynska