Defines a new call-by-silly calculus mirroring call-by-need, proves it shares contextual equivalence with call-by-value, and shows its strategy computes maximal-length sequences via multi types and rewriting.
On the relations between the syntactic theories of lambda-mu-calculi
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
citing papers explorer
-
Mirroring Call-by-Need, or Values Acting Silly
Defines a new call-by-silly calculus mirroring call-by-need, proves it shares contextual equivalence with call-by-value, and shows its strategy computes maximal-length sequences via multi types and rewriting.
-
Equilibria in Multiplayer Graph Games: An Algorithmic Study
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.