Switch to: References

Add citations

You must login to add citations.
  1. A Decidable Theory of Type Assignment.William R. Stirton - 2013 - Archive for Mathematical Logic 52 (5-6):631-658.
    This article investigates a theory of type assignment (assigning types to lambda terms) called ETA which is intermediate in strength between the simple theory of type assignment and strong polymorphic theories like Girard’s F (Proofs and types. Cambridge University Press, Cambridge, 1989). It is like the simple theory and unlike F in that the typability and type-checking problems are solvable with respect to ETA. This is proved in the article along with three other main results: (1) all primitive recursive functionals (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark