A Compiler System of a Linear Logic Programming Language
نویسندگان
چکیده
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.
منابع مشابه
Linear and Temporal Logic Programming Language
Recent logic calculi open new possibilities for logic programming. Apparently the most important of them is a linear logic which makes possible to solve problems by resources treatment. The linear logic has already been used for several proposals of logic programming language. But authors of these languages mostly focused on the proposal of language and somewhat turned aside its efficient imple...
متن کاملResource Management Method for a Compiler System of a Linear Logic Programming Language (Poster Abstract)
Linear logic developed by J.-Y. Girard [3] is expected to be applied for various elds in computer science. Linear logic is called \resource-conscious" because consumed hypotheses can never be used again. Therefore, a resource can be represented as a formula in linear logic rather than represented as a term. There have been several proposals for logic programming language based on linear logic: ...
متن کاملDependently Typed Web Client Applications - FRP in Agda in HTML5
In this paper, we describe a compiler back end and library for web client application development in Agda, a dependently typed functional programming language. The compiler back end targets ECMAScript (also known as JavaScript), and so is executable in a browser. The library is an implementation of Functional Reactive Programming (FRP) using a constructive variant of Linear-time Temporal Logic ...
متن کاملProof-Theoretic Foundation of Compilation in Logic Programming Languages
Commercial implementations of logic programming languages are engineered Appeared in the Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming — JICSLP’98 (J. Jaffar editor), pp ??–??, MIT Press, Manchester, UK, 16–19 June 1998. around a compiler based on Warren’s Abstract Machine (WAM) or a variant of it. In spite of various correctness proofs, the logical m...
متن کاملSimple and Flexible Stack Types
Typed intermediate languages and typed assembly languages for optimizing compilers require types to describe stack-allocated data. Previous type systems for stack data were either undecidable or did not treat arguments passed by reference. This paper presents a simple, sound, decidable type system expressive enough to support the Micro-CLI source language, including by-reference arguments. This...
متن کامل