Sciweavers

1073 search results - page 110 / 215
» Formal Program Development with Approximations
Sort
View
COORDINATION
2009
Springer
16 years 2 months ago
Exceptionally Safe Futures
A future is a well-known programming construct used to introduce concurrency to sequential programs. Computations annotated as futures are executed asynchronously and run concurren...
Armand Navabi, Suresh Jagannathan
CHI
2007
ACM
16 years 2 months ago
Koala: capture, share, automate, personalize business processes on the web
We present Koala, a system that enables users to capture, share, automate, and personalize business processes on the web. Koala is a collaborative programming-bydemonstration syst...
Greg Little, Tessa A. Lau, Allen Cypher, James Lin...
ICFP
2002
ACM
16 years 2 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
POPL
2011
ACM
14 years 5 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
COMGEO
2004
ACM
15 years 2 months ago
On simplifying dot maps
Dot maps--drawings of point sets--are a well known cartographic method to visualize density functions over an area. We study the problem of simplifying a given dot map: given a se...
Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat ...