1226 search results - page 39 / 246 » Proofs, Programs and Abstract Complexity |
109
Voted
ECOOP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. A properly encapsulated data representation can be revised for refactoring or other purposes without affecting the correctness of client programs and extensions of a clas...
127
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This proof of concept study examines the possibility of specifying the construction of programs using a Particle Swarm algorithm, and represents a new form of automatic p...
138
Voted
ICFP
1999
ACM
15 years 7 months ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
149
Voted
SYNASC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
121
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...