A mathematical semantics for a nondeterministic typed lambda-calculus (Q1152949): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fixpoint approach to the theory of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully abstract models of typed \(\lambda\)-calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Powerdomain Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195918 / 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: Q4130957 / rank
 
Normal rank

Latest revision as of 11:27, 13 June 2024

scientific article
Language Label Description Also known as
English
A mathematical semantics for a nondeterministic typed lambda-calculus
scientific article

    Statements

    A mathematical semantics for a nondeterministic typed lambda-calculus (English)
    0 references
    0 references
    0 references
    1980
    0 references
    lambda calculus
    0 references
    semantics of nondeterministic algorithms
    0 references

    Identifiers