A COMPILER SYSTEM OF
A LINEAR LOGIC PROGRAMMING LANGUAGE

NAOYUKI TAMURA and YUKIO KANEDA
{tamura,kaneda}@seg.kobe-u.ac.jp
Department of Computer and Systems Engineering,
Faculty of Engineering, Kobe University
1-1 Rokkodai, Nada, Kobe 657 Japan
 
Abstract

Linear logic developed by J.-Y. Girard can be described as a logic of resources. There have been several proposals for logic programming language based on linear logic: LO, LinLog, ACL, Lolli, Lygon, and Forum. Lolli and Lygon are implemented as interpreter systems (on SML and Prolog for Lolli, on Prolog for Lygon). But, none of them have been implemented as a compiler system.
This paper describes a compiler system of a linear logic programming language called LLP. New features of LLP with various example programs are also shown. LLP is a superset of Prolog and a subset of Lolli. LLP programs are compiled into LLPAM (LLP Abstract Machine) code, which is an extended WAM (Warren Abstract Machine) designed for LLP.
Keywords: Logic programming, Linear logic, Warren Abstract Machine

• INTRODUCTION
• SYNTAX
• RESOURCE HANDLING
  • Resource Addition
  • Resource Consumption
• EXAMPLES
  • List Reverse
  • Knight Tour
  • Kirkman's School Girl Problem
  • Cryptarithmetic Puzzles
  • N-Queens
• LLP COMPILER SYSTEM
• CONCLUSION
• References
• About this document ...