Switch to: References

Add citations

You must login to add citations.
  1. Normal Forms in Combinatory Logic.Patricia Johann - 1994 - Notre Dame Journal of Formal Logic 35 (4):573-594.
    Let $R$ be a convergent term rewriting system, and let $CR$-equality on combinatory logic terms be the equality induced by $\beta \eta R$-equality on terms of the lambda calculus under any of the standard translations between these two frameworks for higher-order reasoning. We generalize the classical notion of strong reduction to a reduction relation which generates $CR$-equality and whose irreducibles are exactly the translates of long $\beta R$-normal forms. The classical notion of strong normal form in combinatory logic is also (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations