Sciweavers

272 search results - page 23 / 55
» Programming languages capturing complexity classes
Sort
View
97
Voted
LICS
2002
IEEE
15 years 5 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
14 years 11 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
90
Voted
ICFP
2010
ACM
15 years 1 months ago
Distance makes the types grow stronger: a calculus for differential privacy
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
Jason Reed, Benjamin C. Pierce
101
Voted
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 7 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
ENTCS
2006
140views more  ENTCS 2006»
15 years 22 days ago
An Aspect-Oriented Approach to Modular Behavioral Specification
Behavioral interface specification languages, such as Java Modeling Language (JML), can be used to specify the behavior of program modules. We have developed a behavioral interfac...
Kiyoshi Yamada, Takuo Watanabe