Switch to: References

Add citations

You must login to add citations.
  1. Combinatory logic with polymorphic types.William R. Stirton - 2022 - Archive for Mathematical Logic 61 (3):317-343.
    Sections 1 through 4 define, in the usual inductive style, various classes of object including one which is called the “combinatory terms of polymorphic type”. Section 5 defines a reduction relation on these terms. Section 6 shows that the weak normalizability of the combinatory terms of polymorphic type entails the weak normalizability of the lambda terms of polymorphic type. The entailment is not vacuous, because the combinatory terms of polymorphic type are indeed weakly normalizable, as is proven in Sect. 7 (...)
    Download  
     
    Export citation  
     
    Bookmark