3179 search results - page 169 / 636 » Applications of PCF Theory |
ICSE
2010
IEEE-ACM
14 years 2 months ago
2010
IEEE-ACM
We present a novel approach to automatic synthesis of loopfree programs. The approach is based on a combination of oracle-guided learning from examples, and constraint-based synth...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
ThispaperpresentsatheoreticalframeworkbasedonBayesian decision theory for analyzing recently reported results on implicit coscheduling of parallel applications on clusters of work...
POPL
1998
ACM
14 years 2 months ago
1998
ACM
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
CASC
2006
Springer
14 years 1 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
FOMI
2008
13 years 11 months ago
2008
I develop a few suggestions how formal ontology can meet industry and practice. This is not just a matter of useful ontology-based applications. That is a necessary but also rather...