The semantics and the recursive execution model of Prolog make it very natural to express language interpreters in form of AST (Abstract Syntax Tree) interpreters where the execution follows the tree representation of a program. An alternative implementation technique is that of bytecode interpreters. These interpreters transform the program into a compact and linear representation before evaluating it and are generally considered to be faster and to make better use of resources.
Description
On the Performance of Bytecode Interpreters in Prolog | SpringerLink
%0 Conference Paper
%1 Korner:2021:PrologAstBc
%A Körner, Philipp
%A Schneider, David
%A Leuschel, Michael
%B Functional and Constraint Logic Programming
%D 2021
%E Hanus, Michael
%E Sacerdoti Coen, Claudio
%I Springer
%K AST Bytecode Interpreters Performance Prolog
%P 41--56
%R 10.1007/978-3-030-75333-7_3
%T On the Performance of Bytecode Interpreters in Prolog
%X The semantics and the recursive execution model of Prolog make it very natural to express language interpreters in form of AST (Abstract Syntax Tree) interpreters where the execution follows the tree representation of a program. An alternative implementation technique is that of bytecode interpreters. These interpreters transform the program into a compact and linear representation before evaluating it and are generally considered to be faster and to make better use of resources.
%@ 978-3-030-75333-7
@inproceedings{Korner:2021:PrologAstBc,
abstract = {The semantics and the recursive execution model of Prolog make it very natural to express language interpreters in form of AST (Abstract Syntax Tree) interpreters where the execution follows the tree representation of a program. An alternative implementation technique is that of bytecode interpreters. These interpreters transform the program into a compact and linear representation before evaluating it and are generally considered to be faster and to make better use of resources.},
added-at = {2023-04-14T22:08:56.000+0200},
author = {K{\"o}rner, Philipp and Schneider, David and Leuschel, Michael},
biburl = {https://www.bibsonomy.org/bibtex/21ddb86fc3f361ce7549d5e48b5223b3b/gron},
booktitle = {Functional and Constraint Logic Programming},
description = {On the Performance of Bytecode Interpreters in Prolog | SpringerLink},
doi = {10.1007/978-3-030-75333-7_3},
editor = {Hanus, Michael and Sacerdoti Coen, Claudio},
interhash = {4cc3da8c525c6b2c592f448157fc6742},
intrahash = {1ddb86fc3f361ce7549d5e48b5223b3b},
isbn = {978-3-030-75333-7},
keywords = {AST Bytecode Interpreters Performance Prolog},
pages = {41--56},
publisher = {Springer},
series = {WFLP'20},
timestamp = {2023-04-14T22:08:56.000+0200},
title = {{On the Performance of Bytecode Interpreters in Prolog}},
year = 2021
}