A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs | Zendy

Abhik Roychoudhury | Zendy; K. Narayan Kumar | Zendy; C. R. Ramakrishnan | Zendy; I. V. Ramakrishnan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs

Author(s) -

Abhik Roychoudhury,

K. Narayan Kumar,

C. R. Ramakrishnan,

I. V. Ramakrishnan

Publication year - 1999

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-66540-4

DOI - 10.1007/10704567_24

Subject(s) - parameterized complexity , mathematical proof , transformation (genetics) , computer science , program transformation , sequence (biology) , fold (higher order function) , folding (dsp implementation) , theoretical computer science , algorithm , programming language , mathematics , engineering , chemistry , biochemistry , geometry , electrical engineering , gene

. Given a program P , an unfold/fold program transformationsystem derives a sequence of programs P = P0 , P1 , : : : , Pn , such thatP i+1 is derived from P i by application of either an unfolding or a foldingstep. Existing unfold/fold transformation systems for definite logic programsdiffer from one another mainly in the kind of folding transformationsthey permit at each step. Some allow folding using a single (possiblyrecursive) clause while others permit folding using multiple...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research