Name
Abstract | ||
|---|---|---|
Solutions of the equations X = ZX and X = XZ are found and discussed for Z, X normal terms of the lambda-calculus. Obviously fixed point combinators are of no help. Solutions will be independent from any kind of gödelization or coding of data structures, they will be provided by typeless self-application. Different approaches will be shown: algebraic properties, one side invertibility and idempotency. Certain subsets of proper combinators and Church algebras between them will be proved to be domains consisting only of fixed points of combinators. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.3233/FI-1999-37401 | Fundam. Inform. |
Keywords | Field | DocType |
x normal term,equations x,normal forms,normal form,certain subsets,data structure,church algebra,fixed point,algebraic property,point combinators,different approach,fixed point equation,proper combinators,fixed point equations,lambda calculus | Discrete mathematics,Data structure,Lambda calculus,Algebra,Combinatory logic,Least fixed point,Fixed point,Algebraic properties,Fixed point equation,Idempotence,Mathematics | Journal |
Volume | Issue | Citations |
37 | 4 | 1 |
PageRank | References | Authors |
0.36 | 8 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Corrado Böhm | 1 | 487 | 413.44 |