Computing with Functionals—Computability Theory or Computer Science? (Q5479568): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1063590
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dag Normann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2178/bsl/1140640943 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2110195431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable functionals of finite types / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abstract data type for real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real number computability and domain theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Unsolvable Problem of Elementary Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability over the partial continuous functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The continuous functionals; computations, recursions and degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computations in higher types / 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: The sequentially realizable functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitary PCF is not decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary PCF is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On full abstraction for PCF: I, II and III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal and everywhere-defined functionals / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:58, 24 June 2024

scientific article; zbMATH DE number 5039657
Language Label Description Also known as
English
Computing with Functionals—Computability Theory or Computer Science?
scientific article; zbMATH DE number 5039657

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references