FP trivia
Interpreter and Library for Pointfree Programming
The programming language for the interpreter is based on function-level programming by John Backus.
The data are kept immutable, but object-oriented programming should be enabled in addition to functional programming.
The interpreter uses a dynamic data structure made up of three-element cells that serve as the basis for
the construction of dictionaries or lists.
( value0 key0 value1 key1 value2 key2 value3 key3 ... ... )
dictionary form
( element0 ; element1 ; element2 ; element3 ; ... ... )
list form
Functions and operators are used for the active part.
func ° x
x opr y
Many combinators are supported from the Backus FP systems.
Constant
' x
Composition
func ° x
Condition
x -> y | z
Construction
x , y , z , ... ,
while-Loop
x ->* y
Apply-to-All
(x aa) : y
Insert
(x \) : y
Apply
x app y
"Binary-to-Unary" for Infix
x ee y
Application
func : x
Definition of names.
name == term
... Infix notation, objects and much more ...
Impressum & Datenschutz
Punktfreie Programmiersprache