Paper Info
Title
Combinatory foundation of functional programming
Abstract
A proposal is described for embedding FP and a part of FFP into a system C(IN)V of Combinatory Logic generated by the 6-tuple of combinators (A,B,C*,O,L,D) under the operation of application. At the same time C(IN)V is viewed as an algebraic extension of elementary arithmetic, including addition multiplication and exponentiation, leading to a non commutative semi-ring with an infinity of zero (infinite)-like elements. Two interesting submonoids have been selected: Lº able to represent the set of FP-Sequences and L+ able to represent the set of FP-Constructions. All basic objects forming operators like Composition, Apply To All Condition and Insert Right are then efficiently expressed inside C(IN)V. The same is done for some operators belonging to FFP as Lifting and the APPLY of LISP establishing a basis for a future reduction (operational) semantics of FP.
Year
DOI
Venue
1982
10.1145/800068.802132
Symposium on LISP and Functional Programming
Keywords
Field
DocType
basic object,elementary arithmetic,future reduction,algebraic extension,time c,addition multiplication,functional programming,combinatory logic,system c,interesting submonoids,combinatory foundation,embedding fp,operational semantics
Programming language,Functional programming,Commutative property,Computer science,Combinatory logic,Multiplication,Elementary arithmetic,Algebraic extension,Operator (computer programming),Exponentiation
Conference
ISBN
Citations 
PageRank 
0-89791-082-6
5
0.82
References 
Authors
6
1
Name
Order
Citations
PageRank
Corrado Böhm1487413.44