Abstract Machine Approach to Operational Semantics of Prolog

スポンサーリンク

概要

• 論文の詳細を見る

• Operational semantics of Prolog based on abstract Prolog machines is studied. We start from the SLD-resolution calculus and a simple abstract Prolog machine to realize the SLD-resolution calculus. We then systematically refine the abstract Prolog machine in three stages; by (1) introduction of continuation, (2) realization of substitutions on a stack, and (3) speed-up of a backtrack. The result of the refinement is the abstract machine that is amenable to the procedural realization of Prolog. From the refined abstract machine it is straightforward to develop an algorithm which transforms a Prolog program to all equivalent Scheme program. The Scheme program hides certain details of the computation mechanism of Prolog, but clearly exhibits essential control and data structure for Prolog. Our study has another positive result in that Prolog programs can be run in Scheme environment

• 1992-12-31

著者

• Ida Tetsuo

  Institute Of Information Sciences And Electronics University Of Tsukuba

• Suzuki T

  Doctoral Program In Engineering University Of Tsukuba

• NAKAMURA ATSUSHI

  Doctoral program in Engineering, University of Tsukuba

• SUZUKI TARO

  Doctoral program in Engineering, University of Tsukuba

• NAKAGAWA KOJI

  College of Information Sciences, University of Tsukuba

• Nakagawa Koji

  College Of Information Sciences University Of Tsukuba

関連論文

• Deterministic and Non-deterministic Lazy Conditional Narrowing and their Implementations
• Abstract Machine Approach to Operational Semantics of Prolog
• Collaborative Constraint Functional Logic Programming System in an Open Environment(Regular Section)
• Overflow Free and Variable Precision Computing in FLATS
• Overview of MC/LISP System
• Outside-In Conditional Narrowing
• Parallel Hash Algorithms for Virtual Key Index Tables
• Analysis of Parallel Hashing Algorithms with Key Deletion

スポンサーリンク