Domain-Theoretic Foundations of Functional Programming
From MaRDI portal
Publication:3415205
DOI10.1142/6284zbMath1111.68020OpenAlexW1507860656MaRDI QIDQ3415205
Publication date: 16 January 2007
Full work available at URL: https://semanticscholar.org/paper/730a2c4fe57e22dfcf62179795d877708c176280
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Continuous lattices and posets, applications (06B35)
Related Items (24)
A stream calculus of bottomed sequences for real number computation ⋮ A universal Krull-Lindenbaum theorem ⋮ Modular Relaxed Dependencies in Weak Memory Concurrency ⋮ The Scott model of PCF in univalent type theory ⋮ A Nonstandard Functional Programming Language ⋮ Unnamed Item ⋮ A Denotational Semantics for Total Correctness of Sequential Exact Real Programs ⋮ Recursion in Higher Types and Resource Bounded Turing Machines ⋮ The order-K-ification monads ⋮ A note on the Knaster-Tarski fixpoint theorem ⋮ Denotational semantics of recursive types in synthetic guarded domain theory ⋮ Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases ⋮ Galois Connections for Recursive Types ⋮ A Functional Algorithm for Exact Real Integration with Invariant Measures ⋮ Non-determinism in Gödel's system \(T\) ⋮ Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language ⋮ Semantical proofs of correctness for programs performing non-deterministic tests on real numbers ⋮ Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting ⋮ Unnamed Item ⋮ 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 ⋮ Nested Hoare Triples and Frame Rules for Higher-Order Store ⋮ The extensional ordering of the sequential functionals ⋮ Denotational Semantics with Nominal Scott Domains
This page was built for publication: Domain-Theoretic Foundations of Functional Programming
