Sciweavers

5096 search results - page 606 / 1020
» Associations as a Language Construct
Sort
View
172
Voted
ECCC
2006
116views more  ECCC 2006»
15 years 6 months ago
Uniform Hardness Amplification in NP via Monotone Codes
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul...
POPL
2008
ACM
16 years 7 months ago
Automatic inference of stationary fields: a generalization of java's final fields
Java programmers can document that the relationship between two objects is unchanging by declaring the field that encodes that relationship to be final. This information can be us...
Christopher Unkel, Monica S. Lam
311
Voted
POPL
2005
ACM
16 years 7 months ago
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
John Field, Carlos A. Varela
179
Voted
ICFP
2006
ACM
16 years 6 months ago
Recursive modules for programming
d abstract) Keiko Nakata1 Jacques Garrigue2 1 Kyoto University Research Institute for Mathematical Sciences 2 Graduate School of Mathematics, Nagoya University The ML module syste...
Keiko Nakata, Jacques Garrigue
ICFP
2005
ACM
16 years 6 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska