## Library Reference †

In the following, arguments with the plus ( + ) sign are those consumed upon reaction with the library atoms, while arguments with the minus ( - ) sign are those generated by the library API. The slash ( / ) notation is used to indicate the arity of atoms.

The term notation of LMNtal allows array.new(10,"Thanks",S) to be written also in a functional form as S = array.new(10,"Thanks"). Accordingly, the the template array.new(+N, +InitialValue, -NewArray) below could be written also as NewArray = array.new(+N, +InitialValue).

Note: This page describes the API of the develop branch of SLIM, which is up-to-date, relatively stable, and routinely used by the development team.

### Library array †

This library supports arrays whose elements are integers, floating-point numbers, strings, or hyperlinks. All elements of an array must be of the same type; e.g., integer elements and string elements cannot be mixed. A runtime error will be reported if the above restrictions are violated.

array.new(+N, +InitialValue, -NewArray)
Creates an array with N elements and returns it to NewArray. All the elements are initialized to InitialValue.
array.new(+List, -NewArray)
Creates an array with the elements in List and returns it to NewArray.
array.free(+Array)
Frees Array.
array.size(+Array, -N, -NewArray)
Returns the size of Array to N and the array itself to NewArray.
array.get(+Array, +I, -Old, -NewArray)
Returns the Ith element of Array to Old and the array itself to NewArray.
array.put(+Array, +I, +New, -NewArray)
Returns an array with the Ith element of Array replaced by New to NewArray.

### Library array2D †

This library supports two-dimensional arrays whose elements are integers, floating-point numbers, strings, or hyperlinks. All elements of an array must be of the same type; e.g., integer elements and string elements cannot be mixed. A runtime error will be reported if the above restrictions are violated.

array2D.new(+M, +N, +InitialValue, -NewArray)
Creates a 2D array with M x N elements and returns it to NewArray. All the elements are initialized to InitialValue.
array2D.free(+Array)
Frees Array.
array2D.size(+Array, -Size, -NewArray)
Returns the size (M,N) of Array to Size and the array itself to NewArray.
array2D.get(+Array, +I, +J, -Old, -NewArray)
Returns the (I,J)-th element of Array to Old and the array itself to NewArray.
array2D.put(+Array, +I, +J, +New, -NewArray)
Returns Array with the (I,J)-th element replaced by New to NewArray.

### Library atom †

atom.new(+F, +N, -A)
Creates an N (<128)-ary symbol atom with the functor F specified as a string. If N>0, the first N-1 arguments are set to 0, while the last argument is connected to the binary atom 'some' connected to the created atom and A.
For instance, A=atom.new("pq",3) creates A=some(pq(0,0)).
If N=0, A=atom.new("pq",0) creates A=none and an independent atom pq.
atom.new(+F, +L, -A)
Creates a symbol atom with the functor F (specified as a string) and the arguments in the list L and the final argument A.
For instance, atom.new("pq",[X,Y,Z],A) creates A = pq(X,Y,Z).
atom.new(+F, +L)
Creates a symbol atom with the functor F (specified as a string) and the arguments in the list L.
For instance, atom.new("pq",[X,Y,Z]) creates pq(X,Y,Z).
atom.functor(+A0, -F, -N, -A)
F is bound to the string representation of the functor of A0, N is bount to the arity of A0, and A is bound to A0 (for later use). Works only when A0 is a symbol atom.
atom.swap(+A0, +I, +NewAi, -OldAi, -A)
A is bound to the atom A0 whose Ith argument is changed to NewAi. The original Ith argument is bound to OldAi. Works only when A0 and OldAi are symbol atoms.

### Library boolean †

This library provides operations on boolean values (true and false) for the 'functional' and 'if' libraries.

boolean.use
Enables the following API.
not(+P, -Res)
Res is bound to the negation of P.
and(+P, +Q, -Res)
Res is bound to the conjunction of P and Q.
or(+P, +Q, -Res)
Res is bound to the disjunction of P and Q.
xor(+P, +Q, -Res)
Res is bound to the exclusive OR of P and Q.

### Library deque †

Deque (Double-ended queue) implemented as a difference list.

new(-Q)
Creates Creates an empty queue and binds it to Q.
is_empty(+Q0, -Res, -Q)
Checks if Q0 is empty and returns true/false to Res and the queue itself to Q.
deque.push_front(+Q0, +X, -Q)
Insert X at the front of Q0 and returns it to Q.
deque.pop_front(+Q0, -X, -Q)
Remove the first element of an non-empty deque Q0 and returns it to X and the rest of the deque to Q.
deque.push_back(+Q0, +X, -Q)
nsert X at the back of Q0 and returns it to Q.
deque.pop_back(+Q0, -X, -Q)
Remove the last element of an non-empty deque Q0 and returns it to X and the rest of the deque to Q.
deque.of_list(+List, -Q)
Returns a deque consisting of the elements in List to Q.

### Libraty float †

float.of_str(+S, -N)
N is bound to a floating-point number whose string representation is S.

### Library functional †

This experimental library provides limited functionalities of functional programming for list processing with higher-order functions. This is not an implementation of the full lambda calculus which can be found in the demo folder of the distribution of LaViT.

functional.use
Enables the following API.
RET = apply(+LAMBDA, +ARG)
Applies the argument ARG to the lambda expression LAMBDA which is an atom LAMBDA=lambda(X, F), where X is the argument and F is the function body. F must contain exactly one link X.
Example: ret = apply(lambda(X, [X]), 0) becomes ret = [0].

For notational convenience of binary functions (for fold functions etc.), the notation RET = lambda(X,Y,F) is provided as a shorthand of RET = lambda(X, lambda(Y, F)), and RET = apply(LAMBDA, ARG1, ARG2) is a shorthand of RET = apply(apply(LAMBDA, ARG1), ARG2).
copyarg(+ARG, +LIST)
Each element in LIST is bound to a copy of the ground process (= graph) ARG. This is useful when a lambda expression uses its argument several times or ignores its argument.
Example: ret = apply(lambda(X, X0+X1), 3), copyarg(X, [X0,X1]) becomes ret = 6 ;
Example: ret = apply(lambda(X, 0), 3), copyarg(X, []) becomes ret = 0.
RET = let(+VAR, +ARG, +EXPR)
Binds the variable VAR to the argument ARG, then returns EXPR which may contain VAR as a free variable. You can use copyarg when EXPR refers to VAR multiple times.
Example: ret = let(X, 1, X+1) becomes ret = 2 ;
Example: ret = let(X, 1, X1+X2), copyarg(X, [X1,X2]) becomes ret = 2.
RET = map(+LAMBDA, +LIST)
Applies the unary lambda expression LAMBDA to all elements of LIST, and returns the resulting list.
Example: ret = map(lambda(X, X+1), [0,1,2]) becomes ret = [1,2,3].
RET = fold_left(+LAMBDA, +INIT, +LIST)
Applies the binary lambda expression LAMBDA to INIT and the head of LIST. Repeats that iteratively, and returns the resulting value.
Example: ret = fold_left(lambda(X,Y, X-Y), 100, [1,2,3,4,5]) becomes ret = 85.
RET = fold_right(+LAMBDA, +LIST, +INIT)
Folds with right associativity.
Example: ret = fold_right(lambda(X,Y, [X|Y]), [1,2,3], [4,5,6]) becomes ret = [1,2,3,4,5,6].
RET = filter(+LAMBDA, +LIST)
From LIST, extracts all elements which satisfy the predicate LAMBDA (i.e., for which the unary lambda expression LAMBDA evaluates to true).
Example ret = filter(lambda(X, X>0), [-1,1,-2,2]) becomes ret = [1,2].
RET = exists(+LAMBDA, +LIST)
Returns true if LIST contains at least one element which satisfies the predicate LAMBDA. Otherwise, returns false.
Example: ret = exists(lambda(X, X>2), [1,2,3,4] becomes ret = true.
Example: ret = exists(lambda(X, X>2), [1,2]) becomes ret = false.
RET = for_all(+LAMBDA, +LIST)
Returns true if all elements of LIST satisfy the predicate LAMBDA. Otherwise, returns false.
Example: ret = for_all(lambda(X, X>2), [3,4]) becomes ret = true.
Example: ret = for_all(lambda(X, X>2), [1,2,3,4]) becomes ret = false.
RET = count(+LAMBDA, +LIST)
Returns how many elements of LIST satisfy the predicate LAMBDA.
Example ret = count(lambda(X, X>2), [1,2,3,4,5]) becomes ret = 3.
RET = find(+LAMBDA, +LIST)
Returns some(X) where X is the first element which satisfies the predicate LAMBDA. If no element satisfies LAMBDA, returns 'none'.
Example: ret = find(lambda(X, X>5), [1,2,10,3,20]) becomes ret = some(10).
Example: ret = find(lambda(X, X>5), [1,2,3,4,5]) becomes ret = none.
RET = partition(+LAMBDA, +LIST)
Decompose LIST into two lists. The first list LT consists of all elements in LIST which satisfy the predicate LAMBDA. The second list LF is the rest. Finally, returns the pair (LT,LF).
Example ret = partition(lambda(X, X>0), [1,2,-1,3,-2]) becomes ret = ([1,2,3], [-1,-2]).

### Library if †

This library provides convenient (but not necessarily efficient) means for expressing conditionals.

if.use
Enables the following API and also the library boolean.
if(+Bool, +Then, +Else, -H)
Unwraps Then part or Else part, both wrapped by membranes, depending upon the Bool value and connects its sole free link to H. The other alternative is discarded.
'?'(+Bool, +Then, +Else, -H)
Chooses Then or Else (both ground terms) depending on the Bool value and connects it to H. The other alternative is discarded. Note that this is an eager conditional and the two alternatives may start evaluation before Bool has been evaluated.

### Library integer †

integer.rnd(+N, -H)
H is bound to a random number between 0 and N-1.
integer.srnd(+N)
Initialize the random number generator using N as the new seed of random numbers.
integer.of_str(+S, -N)
N is bound to an integer whose string representation is S.
integer.set(+M, +N, +G)
Assume $m[M] and$n[N] are of type int (i.e., M and N are connected to integer atoms $m and$n, respectively) and $g[G] is of type ground. Then creates a multiset$g[$m],$g[$m+1], ...,$g[$n]. For instance, n=integer.set(1,100) will be reduced to n=1, ..., n=100. ### Library io † Input/output in SLIM is done through ports. An operation on a port will return a new port to be used exactly once for future operations on the port. For instance, the "Hello, World!" program can be written as: io.print_line(io.stdout,"Hello, World!",io.free_port). and a program that prints a single line from the standard input can be written as: io.print_line(io.stdout,io.read_line(io.stdin,io.free_port),io.free_port). A program that copies stdin to stdout can be written as: main. main :- io.read_token(io.stdin, I, S), loop(S, eof, I, io.stdout). loop(S, EOF, I, O) :- S == EOF | io.free_port(I), io.free_port(O). loop(S0, EOF, I0, O0) :- S0 \== EOF | io.print_line(O0, S0, O), io.read_token(I0, I, S), loop(S, EOF, I, O). io.stdin(-RetRort) Returns a standard input port. io.stdout(-RetRort) Returns a standard output port. io.stderr(-RetRort) Returns a standard error port. io.read_byte(+Port, -RetRort, -N) Read a character from the input port Port and returns its code N and a new port RetRort. Returns -1 instead of N if the end of file is encountered. io.read_char(+Port, -RetRort, -C) Read a character C from the input port Port and returns it as a unary atom with the name C a new port RetRort. Returns a unary atom 'eof' if the end of file is encountered. io.read_token(+Port, -RetRort, -Str) Read a token Str separated by a space or a tab or a newline from the input port Port and returns the token and a new port RetRort. Returns a unary atom 'eof' if the end of file is encountered. io.read_line(+Port, -RetRort, -Str) Read a single line Str from the input port Port and returns a new port RetRort. io.close_port(+Port, -RetRort) Close Port and returns it as RetRort. Further operations on the port will cause an error. io.free_port(+Port) Frees Port. io.print_byte(+Port, +N, -RetRort) Print the character with the code N to Port and return a new port RetRort. io.print_unary(+Port, +C, -RetRort) Print the name of a unary atom C to Port and return a new port RetRort. io.print_char(+Port, +C, -RetRort) Print the name of an atom C to Port and return a new port RetRort. The atom name need not necessarily be a single character. io.print(+Port, +Str, -RetRort) Print a string Str to Port and return a new port RetRort. io.print_line(+Port, +Str, -RetRort) Print a string Str and a newline to Port and return a new port RetRort. io.print_newline(+Port, -RetRort) Print a newline to Port and return a new port RetRort. io.print_mem(+Port, +M, -RetRort) Print the content of the membrane M to Port and return a new port RetRort. The membrane must not have free links other than that linked to this API. io.open_output_string(-SRetRort) Creates a new string output port SRetRort. io.open_input_string(+Str, -SRetRort) Creates a new string input port SRetRort consisting of the characters in the string Str. io.output_string(+Port, -RetRort, -Str) Dumps the current content of the string port Port to Str and returns the port as RetRort (without flushing it). ### Library list † list.append(+List1, +List2, -Res) Appends List1 and List2 and binds the result to Res. list.choose_k(+List, +K, -Res) Generates a list of all ways of choosing K elements from List and binds it to Res. list.split(+List, +N, -Tail, -Head) Trims List after the first N element and binds it to Head and the rest to Tail. list.reverse(+List, -ReversedList) Reverse List and binds it to ReversedList. list.flatten(+List, -Res) Concatenates all the element lists of List and binds the result to Res. For instance, r = list.flatten([[a,b,c],[d,e],[],[[f,g] ] ]) becomes r = list.flatten([a,b,c,d,e,[f,g]]). ### Library membrane † membrane.eq(+M0, +M1, -R0, -R1, -Res) Checks if the contents of the membrane M0 and M1 are isomorphic or not, and returns true or false to Res. The two checked cells are returned through R0 and R1, respectively. Example: res=membrane.eq({a(X,Y),b(Y,X),c},{c,b(A,B),a(B,A)},r1,r2) becomes res=true (and two returned cells). membrane.hash(+M, -R, -Res) Returns the hash value of the content of the membrane M through Res. The cell itself is returned through R. ### Library nlmem † The library nlmem (nonlinear membrane) is used when coping or removing a cell with free links (i.e., links connected to atoms outside the membrane). When copying such cells, the free links should be split by inserting ternary atoms; when removing such cells, the free links should be terminated by a unary atom. The library nlmem contains an implementation of the following rule schemes that use aggregates: R=nlmem.copy(X,a), {$p[X|*Z]} :-
R=copied(X1,X2),
{$p[X1|*Z1]}, {$p[X2|*Z2]},
a(*Z1,*Z2,*Z).
nlmem.kill(X,b), {\$p[X|*Z]} :- b(*Z).

They are rule schemes in the sense that a and b are metasymbols to be replaced by any symbolic names.

nlmem.copy(+{P}, +a, -R)
An abbreviated form of (nlmem.copy(R0,a,R), {+R0,P}). Creates two copies of the cell {+R0,P} with all its free links renamed, and connects R and the two fresh copies of R0 using a ternary atom with the name a. Furthermore, for each free link L of the original cell {+R0, P} (except R0 that will disappear together with the '+'), nlmem.copy connects the two fresh copies of L and the original L via the ternary atom a.
Example: r = nlmem.copy({a(X),b(X,Y)}, cp), d(Y) becomes r = cp({a(L5),b(L5,L1)}, {a(L4),b(L4,L3)}), d = cp(L1,L3).
nlmem.copy(+{P}, -R)
Same as {nlmem.copy({P},copied,R).
nlmem.kill(+{P}, +b)
An abbreviated form of (nlmem.kill(R0,b), {+R0,P}). Connects each free link L of the cell {+R0, P} (except R0 that will disappear together with the '+') to the unary atom b.
Example: nlmem.kill({a(X),b(X,Y)}, rm), d(Y) becomes d(rm).
nlmem.kill(+{P})
Same as nlmem.kill({P},killed).

### Library seq †

Library seq is to apply sets of rules $R_1,\dots,R_n$ sequentially to a graph G, that is, rules $R_{n+1}$ are applied only after rules in $R_n$ becomes non-applicable.

Each set of rules $R_k$ is specified as a cell containing rules, while the initial graph G is specified as a cell containing G.
For instance, r = seq.run({a}, [{a:-b}, {b:-c. a:-never.}, {c:-d. b:-never.}]) becomes r = {d}.

r=seq.run(+M, +Rs)
M is a cell (called a data cell) and Rs is a list of cells (called rull cells) each containing rules. Applies rules in Rs to the data cell M sequentially from left to right. When reaction terminates for the rules in some rule cell, these rules are removed and the rules in the next rule cell are inserted into the data cell. Stops execution when stop_seq/0 appears in the cell.

### Library string †

string.from(+Atom, -Res)
Returns the name of the atom Atom as a string and returns it to Res.
string.concat(+Str1, +Str2, -Res)
Concatenates two strings Str1 and Str2 and returns it to Res.
string.substr(+Str, +K, -Res)
Res is bound to the substring of Str starting from the Kth character.
For instance, H = string.substr("abc",1) becomes H = "bc".
string.substr(+Str, +B, +E, -Res)
Res is bound to the substring of Str from the Bth up to (but not including) the Eth characters.
For instance, H = string.substr("abc",1,2) becomes H = "b".
string.reverse(+Str, -ReversedStr)
Reverses the string Str and returns it to ReversedStr.
string.compress(+List, -String)
Converts List of character codes and returns it to String.
For instance, H = string.compress([65,66,67]) becomes H = "ABC".
string.explode(+String, -List)
Convers String to a list of character codes and returns it to List.
For instance, H = string.explode("ABCDE") becomes H = [65,66,67,68,69].
string.times(+Str, +N, -Res)
Res is bound to a string that concatenates N copies of Str.
string.join(+Glue, +StrList, -Res)
Res is bound to a string that concatenates the elements of the string list StrList with the string Glue.
For instance, H =join("_", ["1","2","3"]) becomes H = "1_2_3".

### Library time †

H = time.gettime
H is bound to the CPU time consumed by the current thread.

Last-modified: 2019-05-26 (Sun) 07:03:28 (238d)