Sciweavers

1569 search results - page 130 / 314
» Programming contest strategy
Sort
View
87
Voted
ICFP
2003
ACM
16 years 16 days ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
ESOP
2008
Springer
15 years 2 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
94
Voted
ICFP
2010
ACM
15 years 1 months ago
Matching lenses: alignment and view update
Bidirectional programming languages are a practical approach to the view update problem. Programs in these languages, called lenses, define both a view and an update policy--i.e.,...
Davi M. J. Barbosa, Julien Cretin, Nate Foster, Mi...
189
Voted
ICDE
2008
IEEE
167views Database» more  ICDE 2008»
16 years 1 months ago
Towards Declarative Queries on Adaptive Data Structures
In this work we look at combining emerging technologies in programming languages with traditional query processing techniques to provide support for efficient execution of declarat...
Nicolas Bruno, Pablo Castro
ICFP
2009
ACM
16 years 1 months ago
A theory of typed coercions and its applications
A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and ...
Nikhil Swamy, Michael W. Hicks, Gavin M. Bierman