FP trivia

is a point-free programming language with instance variables

FP trivia is a pure functional programming language inspired by the FP-Systems of John Backus, APL, Smalltalk and Lisp. It is intended to remedy the problematic fact that FP is viewed as free of variables, which is also true in terms of lambda variables, but not in terms of the instance variables that are used by FP trivia. The main data type is therefore a table that the instance variables can access and also enables the infix notation..

Syntax

A table is a linear arrangement of key-value pairs similar to a list.

  ( value0 key0 value1 key1 value2 key2 ... ... valuen keyn )  

An instance variable can then access a certain key and pick out the associated value.

  #key1 : (value0 key0 value1 key1 value2 key2 ... ... valuen keyn)
   --> value1  

External resource:

• Link to FP trivia strict Repo and FP trivia as download (Reference in german)
• Website of FP trivia