A note on the speed of Prolog
Jukka Paakki
Abstract
Jukka Paakki
Abstract
Based on an experiment in compiler writing methods, we discuss the speed of Prolog programs of modest size when compared with operationally equivalent Pascal programs. We have produced three versions of a compiler for the programming language Edison using three different tools: Pascal, Prolog, and a compiler writing system (GAG). The Prolog and Pascal programs analyzed in this case are the semantic analysis and the code transformation phases of the Edison compiler. Our analysis shows that it is possible to write Prolog programs that are able to compete in speed with the corresponding programs written in Pascal.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Based on an experiment in compiler writing methods, we discuss the speed of Prolog programs of modest size when compared with operationally equivalent Pascal programs. We have produced three versions of a compiler for the programming language Edison using three different tools: Pascal, Prolog, and a compiler writing system (GAG). The Prolog and Pascal programs analyzed in this case are the semantic analysis and the code transformation phases of the Edison compiler. Our analysis shows that it is possible to write Prolog programs that are able to compete in speed with the corresponding programs written in Pascal.
Key concepts: Pascal (unit), Programming language, Computer science, Compiler, Prolog, Optimizing compiler, Compiler correctness, Parallel computing