Sciweavers

985 search results - page 97 / 197
» Piercing Convex Sets
Sort
View
FOCS
2009
IEEE
15 years 11 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
ICFP
2008
ACM
16 years 4 months ago
Quotient lenses
There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reve...
J. Nathan Foster, Alexandre Pilkiewicz, Benjamin C...
VSTTE
2005
Springer
15 years 10 months ago
It Is Time to Mechanize Programming Language Metatheory
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
Benjamin C. Pierce, Peter Sewell, Stephanie Weiric...
DBPL
1999
Springer
102views Database» more  DBPL 1999»
15 years 8 months ago
Union Types for Semistructured Data
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
Peter Buneman, Benjamin C. Pierce
ICFP
2010
ACM
15 years 5 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...