Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence (Q2988360): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exact bounds for lengths of reductions in typed <i>λ</i>-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically almost all \lambda-terms are strongly normalizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and generating lambda terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Natural Counting of Lambda Terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saturation-Based Model Checking of Higher-Order Recursion Schemes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A type-directed abstraction refinement approach to higher-order model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types and higher-order recursion schemes for verification of higher-order programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying higher-order functional programs with pattern-matching algebraic data types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank

Latest revision as of 19:53, 13 July 2024

scientific article
Language Label Description Also known as
English
Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence
scientific article

    Statements

    Identifiers