Paper Info
Title
Surjectivity for Finite Sets of Combinators by Weak Reduction
Abstract
A set F ≡ {F1,...Ft} of closed λ-terms in β-η-normal form (combinators) is s-t-surjective iff the system of equations FiX1...Xs = yi (i=1,...,t), where the yi's are arbitrary variables, is solvable using only weak (β) reduction. It is well known that F is s-t surjective if s is sufficiently large.
Year
DOI
Venue
1987
10.1007/3-540-50241-6_27
CSL
Keywords
Field
DocType
weak reduction,finite sets,system of equations,normal form
Discrete mathematics,Finite set,System of linear equations,Computer science,Combinatory logic,Surjective function
Conference
ISBN
Citations 
PageRank 
3-540-50241-6
0
0.34
References 
Authors
4
2
Name
Order
Citations
PageRank
Corrado Böhm1487413.44
Adolfo Piperno232922.64