A Temporal Linear Logic Programming Language and its Compiler System
Hideo Yoshikawa, and
Last modified: Wed Oct 31 18:19:24 2001 JST
The TLLP language is a logic programming language based on
intuitionistic temporal linear logic, an integration of intuitionistic
linear logic and temporal logic.
TLLP is a superset of Prolog and
and it covers a significant fragment of (first-order)
TLLP can be seem as an extension of LLP with various temporal
TLLP allows the use of modal operators '@'(next) and '#'(always ) in
addition to '!'(bang).
The intuitive meaning of these operators is as follows:
- The assumption @R means that R can be used exactly once at the
next moment in time,
- The assumption #R means that R can be used exactly once any
- The assumption !R means R can be used arbitrarily many times
(including zero many times) at any time,
- The goal @G adjusts time one clock ahead and then executes G.
TLLP is distributed as free software for non-profit use.
Any comments and suggestions are welcome!
- [Mar. 30 2001] TLLP version 0.13 is released.
- [Feb. 14 2001] TLLP version 0.12 is released.
- The newest package is
(257KB, Released on March 30 2001).
- To find out more about this application, please read:
You need the following systems to use TLLP compiler.
- ANSI C compiler
TLLP abstract machine emulator is written in ANSI C.
We are using GNU C compiler version egcs-2.91.66.
- Prolog system
Prolog system is used to compile TLLP program into abstract
We are using
- Targeted Platforms
Unix systems including Linux and Sun SPARC.