The language features and architecture of B-Prolog
| Autor: | Neng-Fa Zhou |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Programming Languages LOOP (programming language) Programming language Computer science Event (computing) Frame (networking) Predicate (mathematical logic) computer.software_genre Abstract machine Hash table Warren Abstract Machine Theoretical Computer Science Prolog TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Computational Theory and Mathematics Artificial Intelligence Hardware and Architecture computer Software Programming Languages (cs.PL) computer.programming_language |
| Zdroj: | Theory and Practice of Logic Programming. 12:189-218 |
| ISSN: | 1475-3081 1471-0684 |
| DOI: | 10.1017/s1471068411000445 |
| Popis: | B-Prolog is a high-performance implementation of the standard Prolog language with several extensions including matching clauses, action rules for event handling, finite-domain constraint solving, arrays and hash tables, declarative loop constructs, and tabling. The B-Prolog system is based on the TOAM architecture which differs from the WAM mainly in that (1) arguments are passed old-fashionedly through the stack, (2) only one frame is used for each predicate call, and (3) instructions are provided for encoding matching trees. The most recent architecture, called TOAM Jr., departs further from the WAM in that it employs no registers for arguments or temporary variables, and provides variable-size instructions for encoding predicate calls. This paper gives an overview of the language features and a detailed description of the TOAM Jr. architecture, including architectural support for action rules and tabling. Comment: 30 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|