TY - JOUR AU - Goldberg, Mayer PY - 1995/06/19 Y2 - 2024/03/29 TI - Solving Equations in the lambda-Calculus using Syntactic Encapsulation JF - BRICS Report Series JA - BRICS VL - 2 IS - 49 SE - Articles DO - 10.7146/brics.v2i49.19950 UR - https://tidsskrift.dk/brics/article/view/19950 SP - AB - <p>Syntactic encapsulation is a relation between an expression and one of<br />its sub-expressions, that constraints how the given sub-expression can<br />be used throughout the reduction of the expression. In this paper, we<br />present a class of systems of equations, in which the right-hand side of<br />each equation is syntactically encapsulated in the left-hand side. This<br />class is general enough to allow equations to contain self-application,<br />and to allow unknowns to appear on both sides of the equation. Yet<br />such a system is simple enough to be solvable, and for a solution<br />(though of course not its normal form) to be obtainable in constant<br />time.</p><p><br />Keywords: lambda-calculus, programming calculi.</p> ER -