Computability and totality in domains

DOI10.1017/S0960129502003638zbMath1005.68040OpenAlexW2165266811MaRDI QIDQ3146243

Ulrich Berger

Publication date: 31 October 2002

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129502003638

zbMATH Keywords

functional programming languagesScott-Eršov-domains

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Related Items (3)

Nonflatness and totality ⋮ On the ubiquity of certain total type structures ⋮ Operational domain theory and topology of sequential programming languages

This page was built for publication: Computability and totality in domains