The sequentially realizable functionals
type: Item
instance of: scholarly article
title: The sequentially realizable functionals
zbMATH Open document ID: 1022.03023
DOI: 10.1016/S0168-0072(01)00110-5
author: John Longley
published in: Annals of Pure and Applied Logic
publication date: 2002-12-02T00:00:00Z
review text: 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\).
Mathematics Subject Classification ID: 03D65
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 1838858
zbMATH Keywords: higher-type computability
zbMATH Keywords: sequentiality
zbMATH Keywords: finite type structures
zbMATH Keywords: PCF
zbMATH Keywords: realizability
zbMATH Keywords: strong stability
reviewed by: Leon Harkleroad
describes a project that uses: ML
MaRDI profile type: Publication
cites work: Full abstraction for PCF
cites work: Q4222034
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Q4160405
cites work: Sequential algorithms on concrete data structures
cites work: Q3741042
cites work: Q4936141
cites work: Sequentiality in an extensional framework
cites work: Fully abstract semantics for observably sequential languages
cites work: Q5287527
cites work: Localisation and interaction in one dimension
cites work: Projecting sequential algorithms on strongly stable functions
cites work: A relative PCF-definability result for strongly stable functions and some corollaries
cites work: Q4945250
cites work: A small complete category
cites work: Q3978973
cites work: Q4281473
cites work: On full abstraction for PCF: I, II and III
cites work: Concrete domains
cites work: Q3689176
cites work: Q5343325
cites work: Q5344164
cites work: Finitary PCF is not decidable
cites work: When is a functional program not a functional program?
cites work: Q5316371
cites work: Q4511324
cites work: A uniform approach to domain theory in realizability models
cites work: Sheaves in geometry and logic: a first introduction to topos theory
cites work: Fully abstract models of typed \(\lambda\)-calculi
cites work: Generalized Banach-Mazur functionals in the topos of recursive sets
cites work: Q4501156
cites work: Kripke logical relations and PCF
cites work: Q4938567
cites work: The modified realizability topos
cites work: LCF considered as a programming language
cites work: Full abstraction, totality and PCF
cites work: Q4335371
cites work: Q4362975
cites work: Fully abstract translations between functional languages
cites work: On the computational complexity of Longley's \(H\) functional
cites work: Q4108313
cites work: Data Types as Lattices
cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY
cites work: Q3976061
cites work: Q4263806
cites work: Q4094390
full work available at URL: s0168-0072(01)00110-5
OpenAlex ID: W1985955425
description: scientific article; zbMATH DE number 1838858