19 search results - page 2 / 4 » On Jones-Optimal Specialization for Strongly Typed Languages |
PAMI
1998
13 years 6 months ago
1998
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
ICFP
2010
ACM
13 years 8 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...
AFP
2004
Springer
14 years 15 days ago
2004
Springer
Abstract. Esther is the interactive shell of Famke, a prototype implementation of a strongly typed operating system written in the functional programming language Clean. As usual, ...
ML
2006
ACM
13 years 7 months ago
2006
ACM
Higher-order typed languages, such as ML, provide strong support for data and type abn. While such abstraction is often viewed as costing performance, there are situations where i...