Domain-Theoretic Foundations of Functional Programming
From MaRDI portal
Continuous lattices and posets, applications (06B35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Recommendations
Cited in
(31)- Operational domain theory and topology of sequential programming languages
- A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
- From operational semantics to domain theory
- A note on the Knaster-Tarski fixpoint theorem
- A stream calculus of bottomed sequences for real number computation
- A universal Krull-Lindenbaum theorem
- Semi-decidability of may, must and probabilistic testing in a higher-type setting
- Semantical proofs of correctness for programs performing non-deterministic tests on real numbers
- Galois Connections for Recursive Types
- A Denotational Semantics for Total Correctness of Sequential Exact Real Programs
- Recursion in Higher Types and Resource Bounded Turing Machines
- Nested Hoare Triples and Frame Rules for Higher-Order Store
- scientific article; zbMATH DE number 555217 (Why is no real title available?)
- scientific article; zbMATH DE number 6917933 (Why is no real title available?)
- Denotational semantics of recursive types in synthetic guarded domain theory
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
- The symmetric monoidal closed category of cpo M-sets
- Modular relaxed dependencies in weak memory concurrency
- The Scott model of PCF in univalent type theory
- A Nonstandard Functional Programming Language
- Computability theory in admissible domains
- Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language
- A functional algorithm for exact real integration with invariant measures
- Denotational semantics with nominal Scott domains
- The order-K-ification monads
- Separating continuous domains from algebraic domains
- Infinitary refinement types for temporal properties in Scott domains
- Non-determinism in Gödel's system \(T\)
- A domain-theoretic approach to statistical programming languages
- Countable quasicontinuous domains are quasialgebraic
- The extensional ordering of the sequential functionals
This page was built for publication: Domain-Theoretic Foundations of Functional Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415205)
