Result 1 to 20 from 95 total
Evolving choice structures for genetic programming. (English)
Inf. Process. Lett. 110, No. 20, 871-876 (2010).
1
Pearls of functional algorithm design. (English)
Cambridge: Cambridge University Press (ISBN 978-0-521-51338-8/hbk; 978-0-511-79588-6/ebook). xii, 277~p. \sterling~35.00; \$~60.00/hbk; \$~48.00/ebook (2010).
2
Designing an algorithmic proof of the two-squares theorem. (English)
Bolduc, Claude (ed.) et al., Mathematics of program construction. 10th international conference, MPC 2010, Québec City, Canada, June 21‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13320-6/pbk). Lecture Notes in Computer Science 6120, 140-156 (2010).
3
On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion. (English)
Inf. Process. Lett. 106, No. 3, 100-109 (2008).
4
Streamlining progress-based derivations of concurrent programs. (English)
Formal Asp. Comput. 20, No. 2, 141-160 (2008).
5
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation. (English)
Inf. Process. Lett. 99, No. 4, 158-162 (2006).
6
CPS transformation of beta-redexes. (English)
Inf. Process. Lett. 94, No. 5, 217-224 (2005).
7
Maximum marking problems with accumulative weight functions. (English)
Dang Van Hung (ed.) et al., Theoretical aspects of computing ‒ ICTAC 2005. Second international colloquium, Hanoi, Vietnam, October 17‒21, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29107-5/pbk). Lecture Notes in Computer Science 3722, 562-578 (2005).
8
Derivation of efficient logic programs by specialization and reduction of nondeterminism. (English)
High.-Order Symb. Comput. 18, No. 1-2, 121-210 (2005).
9
An algorithm for multiple-precision floating-point multiplication. (English)
Appl. Math. Comput. 166, No. 2, 291-298 (2005).
10
A functional correspondence between call-by-need evaluators and lazy abstract machines. (English)
Inf. Process. Lett. 90, No. 5, 223-232 (2004).
11
Deterministic second-order patterns. (English)
Inf. Process. Lett. 89, No. 6, 309-314 (2004).
12
Deterministic higher-order patterns for program transformation. (English)
Bruynooghe, Maurice (ed.), Logic based program synthesis and transformation. 13th international symposium, LOPSTR 2003, Uppsala, Sweden, August 25‒27, 2003. Revised selected papers. Berlin: Springer (ISBN 3-540-22174-3/pbk). Lecture Notes in Computer Science 3018, 128-142 (2004).
13
Static composition of refactorings. (English)
Sci. Comput. Program. 52, No. 1-3, 9-51 (2004).
14
On the design of correct and optimal dynamical systems and games. (English)
Inf. Process. Lett. 88, No. 1-2, 59-65 (2003).
15
Disjunctive partial deduction of a right-to-left string-matching algorithm. (English)
Inf. Process. Lett. 87, No. 5, 235-241 (2003).
16
On computing the semi-sum of two integers. (English)
Inf. Process. Lett. 87, No. 2, 67-71 (2003).
17
The list introduction strategy for the derivation of logic programs. (English)
Formal Asp. Comput. 13, No.3-5, 233-251 (2002).
18
On computing a longest path in a tree. (English)
Inf. Process. Lett. 81, No.2, 93-96 (2002).
19
A fully symbolic model of multibody systems containing flexible plates. (English)
Nonlinear Dyn. 18, No.4, 357-382 (1999).
20
Result 1 to 20 from 95 total
Start
Contact
Print
General Help
