77 search results - page 4 / 16 » Building BSP Programs Using the Refinement Calculus |
189
click to vote
PEPM
2009
ACM
15 years 11 months ago
2009
ACM
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...
217
click to vote
UM
2005
Springer
16 years 23 days ago
2005
Springer
We present further developments in our work on using data from real users to build a probabilistic model of user affect based on Dynamic Bayesian Networks (DBNs) and designed to de...
192
Voted
ICFP
1999
ACM
15 years 11 months ago
1999
ACM
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
184
click to vote
LOPSTR
2004
Springer
16 years 19 days ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
194
Voted
LFP
1992
15 years 8 months ago
1992
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...