Open AccessThe Fixpoint Combinator in Combinatory Logic – A Step towards Autonomous Real-time Testing of Software?
Author(s) -
Thomas Fehlmann,
Eberhard Kranich
Publication year - 2022
Publication title -
athens journal of sciences
Language(s) - English
Resource type - Journals
ISSN - 2241-8466
DOI - 10.30958/ajs.9-1-3
Subject(s) - combinatory logic , computer science , curry–howard correspondence , theoretical computer science , programming language , algebra over a field , mathematics , algorithm , lambda calculus , pure mathematics
Combinatory Logic is an elegant and powerful logical theory that is used in computer science as a theoretical model for computation. Its algebraic structure supports self-application and is Turing-complete. However, contrary to Lambda Calculus, it untangles the problem of substitution, because bound variables are eliminated by inserting specific terms called Combinators. It was introduced by Schönfinkel (1924) and Curry (1930). Combinatory Logic uses just one algebraic operation, namely combining two terms, yielding another valid term of Combinatory Logic. Terms in models of Combinatory Logic look like some sort of assembly language for mathematical logic. A Neural Algebra, modeling the way we think, constitutes an interesting model of Combinatory Logic. There are other models, also based on the Graph Model (Engeler 1981), such as software testing. This paper investigates what Combinatory Logic contributes to modern software testing. Keywords: combinatory logic, combinatory algebra, autonomous real-time testing, recursion, software testing, artificial intelligence