Switch to: Citations

Add references

You must login to add references.
  1. Typing untyped λ-terms, or reducibility strikes again!Jean Gallier - 1998 - Annals of Pure and Applied Logic 91 (2-3):231-270.
    It was observed by Curry that when λ-terms can be assigned types, for example, simple types, these terms have nice properties . Coppo, Dezani, and Veneri, introduced type systems using conjunctive types, and showed that several important classes of terms can be characterized according to the shape of the types that can be assigned to these terms. For example, the strongly normalizable terms, the normalizable terms, and the terms having head-normal forms, can be characterized in some systems and Ω. The (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Functional Characters of Solvable Terms.M. Coppo, M. Dezani-Ciancaglini & B. Venneri - 1981 - Mathematical Logic Quarterly 27 (2-6):45-58.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Functional Characters of Solvable Terms.M. Coppo, M. Dezani-Ciancaglini & B. Venneri - 1981 - Mathematical Logic Quarterly 27 (2‐6):45-58.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • A new type assignment for λ-terms.M. Coppo & M. Dezani-Ciancaglini - 1978 - Archive for Mathematical Logic 19 (1):139-156.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • A Filter lambda model and the completeness of type assignment.Henk Barendregt, Mario Coppo & Mariangiola Dezani-Ciancaglini - 1983 - Journal of Symbolic Logic 48 (4):931-940.
    Download  
     
    Export citation  
     
    Bookmark   24 citations