ICFP
2010
ACM
13 years 7 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
We present a case-study of using OCaml within a large product development project, focussing on both the technical and nontechnical issues that arose as a result. We draw comparis...
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
Matsuda et al. [2007, ICFP] and Voigtl
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
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...
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
In 1995, my team and I decided to create an outreach project that would use our research on functional programming to change the K-12 computer science curriculum. We had two diffe...
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
A student learning how to program learns best when the programming language and programming environment cater to her specific needs. These needs are different from the requirement...
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
We present a closed dependent type theory whose inductive types are given not by a scheme for generative declarations, but by encoding in a universe. Each inductive datatype arise...