Typing untyped \(\lambda\)-terms, or reducibility strikes again! (Q1295368): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A new type assignment for λ-terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of basic functionality theory for \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Characters of Solvable Terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church-Rosser theorem for typed functional systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of strong normalization for \(F_ 2\), \(F_ \omega\), and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensional interpretations of functionals of finite type I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093416 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0168-0072(97)00047-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1520157111 / rank
 
Normal rank

Latest revision as of 11:54, 30 July 2024

scientific article
Language Label Description Also known as
English
Typing untyped \(\lambda\)-terms, or reducibility strikes again!
scientific article

    Statements

    Typing untyped \(\lambda\)-terms, or reducibility strikes again! (English)
    0 references
    15 February 2000
    0 references
    type assignment
    0 references
    lambda calculus
    0 references
    conjunctive types
    0 references
    normalizable terms
    0 references
    meta-theorems relating properties of \(\lambda\)-terms and their typability
    0 references
    reducibility
    0 references
    weak head-normal forms
    0 references
    realizability method
    0 references
    0 references

    Identifiers