Domain-Theoretic Foundations of Functional Programming
From MaRDI portal
Publication:3415205
DOI10.1142/6284zbMath1111.68020MaRDI QIDQ3415205
Publication date: 16 January 2007
Full work available at URL: https://semanticscholar.org/paper/730a2c4fe57e22dfcf62179795d877708c176280
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68N18: Functional programming and lambda calculus
68Q55: Semantics in the theory of computing
68-02: Research exposition (monographs, survey articles) pertaining to computer science
06B35: Continuous lattices and posets, applications
Related Items
Unnamed Item, Denotational semantics of recursive types in synthetic guarded domain theory, Unnamed Item, A Functional Algorithm for Exact Real Integration with Invariant Measures, Denotational Semantics with Nominal Scott Domains, A stream calculus of bottomed sequences for real number computation, A universal Krull-Lindenbaum theorem, Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases, Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language, Non-determinism in Gödel's system \(T\), The extensional ordering of the sequential functionals, 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, A note on the Knaster-Tarski fixpoint 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
