Fully abstract models of typed \(\lambda\)-calculi (Q1249567): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4101793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic colloquium '73. Proceedings of the logic colloquium, Bristol, July 1973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinators, \(\lambda\)-terms and proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus / rank
 
Normal rank

Latest revision as of 00:09, 13 June 2024

scientific article
Language Label Description Also known as
English
Fully abstract models of typed \(\lambda\)-calculi
scientific article

    Statements