Sciweavers

5415 search results - page 95 / 1083
» The Implementation of Functional Programming Languages
Sort
View
PLDI
2012
ACM
11 years 11 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
ICFP
2008
ACM
14 years 9 months ago
Experience report: playing the DSL card
This paper describes our experience using a functional language, Haskell, to build an embedded, domain-specific language (DSL) for component configuration in large-scale, real-tim...
Mark P. Jones
PEPM
1992
ACM
14 years 1 months ago
Self-applicable C Program Specialization
A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evalu...
Lars Ole Andersen
COMPSEC
2007
52views more  COMPSEC 2007»
13 years 9 months ago
Privacy-preserving programming using sython
— Programmers often have access to confidential data that are not strictly needed for program development. Broad priveleges from accounts given to programmers allow them to view...
Michael Gaiman, Rahul Simha, Bhagirath Narahari
ML
2006
ACM
14 years 3 months ago
ML grid programming with ConCert
Grid computing has become increasingly popular with the growth of the Internet, especially in large-scale scientific computation. Computational Grids are characterized by their s...
Tom Murphy VII