The sequentially realizable functionals (Q1849853): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full abstraction for PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential algorithms on concrete data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequentiality in an extensional framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully abstract semantics for observably sequential languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Localisation and interaction in one dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projecting sequential algorithms on strongly stable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relative PCF-definability result for strongly stable functions and some corollaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A small complete category / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3978973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281473 / 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: Concrete domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5343325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5344164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitary PCF is not decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is a functional program not a functional program? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5316371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach to domain theory in realizability models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sheaves in geometry and logic: a first introduction to topos theory / 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: Generalized Banach-Mazur functionals in the topos of recursive sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kripke logical relations and PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modified realizability topos / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full abstraction, totality and PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully abstract translations between functional languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of Longley's \(H\) functional / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4108313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Types as Lattices / 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: Q3976061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094390 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0168-0072(01)00110-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985955425 / rank
 
Normal rank

Latest revision as of 09:56, 30 July 2024

scientific article
Language Label Description Also known as
English
The sequentially realizable functionals
scientific article

    Statements

    The sequentially realizable functionals (English)
    0 references
    0 references
    2 December 2002
    0 references
    An in-depth look at a notion of higher-type sequential functional that extends the standard PCF version. This notion first arose in work of Bucciarelli and Ehrhard. The author provides various characterizations of the type structures that result and proves that each finite type is a retract of the pure type \(\overline 2\).
    0 references
    higher-type computability
    0 references
    sequentiality
    0 references
    finite type structures
    0 references
    PCF
    0 references
    realizability
    0 references
    strong stability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references