The sequentially realizable functionals
From MaRDI portal
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\).
Recommendations
- On sequential functionals of type 3
- The extensional ordering of the sequential functionals
- The sequential functionals of type \((\iota \rightarrow \iota)^n \rightarrow \iota\) form a \textit{dcpo} for all \(n \in \mathbb N\)
- scientific article; zbMATH DE number 1531372
- scientific article; zbMATH DE number 1405588
Cites work
- A relative PCF-definability result for strongly stable functions and some corollaries
- A small complete category
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- A uniform approach to domain theory in realizability models
- Concrete domains
- Data Types as Lattices
- Finitary PCF is not decidable
- Full abstraction for PCF
- Full abstraction, totality and PCF
- Fully abstract models of typed \(\lambda\)-calculi
- Fully abstract semantics for observably sequential languages
- Fully abstract translations between functional languages
- Generalized Banach-Mazur functionals in the topos of recursive sets
- scientific article; zbMATH DE number 3912368 (Why is no real title available?)
- scientific article; zbMATH DE number 3976319 (Why is no real title available?)
- scientific article; zbMATH DE number 18655 (Why is no real title available?)
- scientific article; zbMATH DE number 19486 (Why is no real title available?)
- scientific article; zbMATH DE number 3514981 (Why is no real title available?)
- scientific article; zbMATH DE number 3531367 (Why is no real title available?)
- scientific article; zbMATH DE number 3594646 (Why is no real title available?)
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 1342221 (Why is no real title available?)
- scientific article; zbMATH DE number 512780 (Why is no real title available?)
- scientific article; zbMATH DE number 1005001 (Why is no real title available?)
- scientific article; zbMATH DE number 1086725 (Why is no real title available?)
- scientific article; zbMATH DE number 1499102 (Why is no real title available?)
- scientific article; zbMATH DE number 1523049 (Why is no real title available?)
- scientific article; zbMATH DE number 1392302 (Why is no real title available?)
- scientific article; zbMATH DE number 1405588 (Why is no real title available?)
- scientific article; zbMATH DE number 1424059 (Why is no real title available?)
- scientific article; zbMATH DE number 234028 (Why is no real title available?)
- scientific article; zbMATH DE number 2204752 (Why is no real title available?)
- scientific article; zbMATH DE number 3216177 (Why is no real title available?)
- scientific article; zbMATH DE number 3216998 (Why is no real title available?)
- Kripke logical relations and PCF
- LCF considered as a programming language
- Localisation and interaction in one dimension
- On full abstraction for PCF: I, II and III
- On the computational complexity of Longley's \(H\) functional
- Projecting sequential algorithms on strongly stable functions
- Sequential algorithms on concrete data structures
- Sequentiality in an extensional framework
- Sheaves in geometry and logic: a first introduction to topos theory
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The modified realizability topos
- When is a functional program not a functional program?
Cited in
(25)- Axioms and (counter)examples in synthetic domain theory
- Parallel and serial hypercoherences
- On the computational complexity of Longley's \(H\) functional
- A relative PCF-definability result for strongly stable functions and some corollaries
- Comparing hierarchies of types in models of linear logic
- A stable programming language
- Sequential algorithms and strongly stable functions
- Some programming languages suggested by game models (extended abstract)
- Non-uniform hypercoherences
- Sequentiality and piecewise-affinity in segments of Real-PCF
- On the ubiquity of certain total type structures (extended abstract)
- Definability and full abstraction
- Non-uniform (hyper/multi)coherence spaces
- A synthetic theory of sequential domains
- scientific article; zbMATH DE number 1499102 (Why is no real title available?)
- scientific article; zbMATH DE number 1531361 (Why is no real title available?)
- The recursion hierarchy for PCF is strict
- The sequential functionals of type \((\iota \rightarrow \iota)^n \rightarrow \iota\) form a \textit{dcpo} for all \(n \in \mathbb N\)
- scientific article; zbMATH DE number 1405588 (Why is no real title available?)
- Continuous and monotone machines
- On the ubiquity of certain total type structures
- Computing with Functionals—Computability Theory or Computer Science?
- On sequential functionals of type 3
- On the reification of semantic linearity
- The extensional ordering of the sequential functionals
This page was built for publication: The sequentially realizable functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849853)
