Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree

Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree (1993)

by Robert Glück , Andrei V. Klimov

Citations:

63 - 14 self

User correction supplied by saromanenko

Datum	Value	Source
TITLE	Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree	INFERENCE
AUTHOR NAME	Robert Glück	user correction
AUTHOR AFFIL	Institut für Computersprachen; University of Technology Vienna	user correction
AUTHOR ADDR	A-1040 Vienna, Austria	user correction
AUTHOR NAME	Andrei V. Klimov	user correction
AUTHOR AFFIL	Keldysh Institute of Applied Mathematics;	user correction
AUTHOR ADDR	125047 Moscow, Russia	user correction
ABSTRACT	We introduce the notion of a perfect process tree as a model for the full propagation of in forma tion in metacomputation. Starting with constant propagation we construct step-by-step the driving mechanism used in supercompilation which ensures the perfect propagation of information. The concept of a simple supercompiler based on perfect driving coupled with a simple folding strategy is explained. As an example we demonstrate that specializing a naive pattern matcher with respect to a fixed pattern obtains the efficiency of a matcher generated by the Knuth, Morris & Pratt al gorithm.	user correction
YEAR	1993	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	112--123	INFERENCE
VOLUME	724	INFERENCE
CITATIONS	23 found	ParsCit 1.0