Titlebook: Logic Program Synthesis and Transformation; Proceedings of LOPST Kung-Kiu Lau,Timothy Paul Clement Conference proceedings 1993 Springer-Ver

一窩小鳥

迷住

Mechanics

On the Transformation of a Prolog Program to a more efficient binary Program,tomatic transformation from a general program to its binary equivalent makes it most often less efficient. Still, sometimes a binary program can solve a problem more efficiently. It is shown that partial evaluation of the alternative binary program, together with the deletion of unnecessary variable

大都市

蕁麻

復(fù)習(xí)

Best-first Strategies for Incremental Transformations of Logic Programs,rmation process..The core of our technique is a procedure, called ., which is a generalization of the procedure for eliminating unnecessary variables introduced in [13]. The generalization basically consists in the fact that we have parametrized our transformation procedure w.r.t. the property Φ whi

Obituary

新鮮

諷刺

枕墊

Conference proceedings 1993ribed at the workshop, all of which promise to revolutionize the software industry once they become standard practise. These include techniques for the transformation of an inefficient program into an equivalent, efficient one, and the synthesis of a program from a formal specification of its requir