Sequential algorithms on concrete data structures
From MaRDI portal
Cites work
- An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
- Fully abstract models of typed \(\lambda\)-calculi
- scientific article; zbMATH DE number 3646849 (Why is no real title available?)
- scientific article; zbMATH DE number 3735771 (Why is no real title available?)
- scientific article; zbMATH DE number 3518773 (Why is no real title available?)
- scientific article; zbMATH DE number 3557184 (Why is no real title available?)
- scientific article; zbMATH DE number 3566181 (Why is no real title available?)
- scientific article; zbMATH DE number 3594646 (Why is no real title available?)
- scientific article; zbMATH DE number 195199 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
- scientific article; zbMATH DE number 3423547 (Why is no real title available?)
- LCF considered as a programming language
- Minimal and Optimal Computations of Recursive Programs
- Petri nets, event structures and domains. I
- Sequential algorithms on concrete data structures
- The Category-Theoretic Solution of Recursive Domain Equations
- The lambda calculus, its syntax and semantics
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
Cited in
(60)- On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
- Event structures and domains
- Sequential algorithms on concrete data structures
- Universal homogeneous event structures and domains
- Towards a theory of parallel algorithms on concrete data structures
- Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin
- Information categories
- Synchronization trees
- Decidability results for primitive recursive algorithms
- Recursive domain equations for concrete data structure
- On the logic of unification
- The sequentially realizable functionals
- Full abstraction for PCF
- Comparing hierarchies of types in models of linear logic
- Projecting sequential algorithms on strongly stable functions
- Game-theoretic analysis of call-by-value computation
- Axiomatization and characterization of BSP algorithms
- On dialogue games and graph games
- A game-semantic model of computation
- A stable programming language
- Locally Boolean domains
- Sequential algorithms and strongly stable functions
- Some programming languages suggested by game models (extended abstract)
- An algebraic account of references in game semantics
- Non-uniform hypercoherences
- Processes and games
- Definability and full abstraction
- Probabilistic -calculus and event structures
- From qualitative to quantitative semantics. By change of base
- Non-uniform (hyper/multi)coherence spaces
- Interpreting Localized Computational Effects Using Operators of Higher Type
- Nondeterminism and Observable Sequentiality
- Universal domains and the amalgamation property
- scientific article; zbMATH DE number 1531380 (Why is no real title available?)
- Game theoretic analysis of call-by-value computation
- What is a universal higher-order programming language?
- Symmetry and Interactivity in Programming
- Extensional and intensional semantics of bounded and unbounded nondeterminism
- Full abstraction and the Context Lemma (preliminary report)
- Stable bistructure models of PCF (preliminary draft)
- Redexes are stable in the -calculus
- Preface to the special volume
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- On the reification of semantic linearity
- On the symmetry of sequentiality
- Sequential functions on indexed domains and full abstraction for a sub-language of PCF
- Another approach to sequentiality: Kleene's unimonotone functions
- Domains via graphs
- On the asymptotic behaviour of primitive recursive algorithms
- Sequential algorithms for unbounded nondeterminism
- Continuous functions and parallel algorithms on concrete data structures
- Game semantics of Martin-Löf type theory
- Resource modalities in tensor logic
- A tale of additives and concurrency in game semantics
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
- I-categories as a framework for solving domain equations
- Prime algebraicity
- Non-deterministic information systems and their domains
- An algebraic approach to stable domains
- Typed event structures and the linear \(\pi \)-calculus
This page was built for publication: Sequential algorithms on concrete data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1170880)
