Interpreting higher computations as types with totality

DOI10.1007/BF01270624zbMath0830.03019OpenAlexW1965724811MaRDI QIDQ1337495

Dag Normann, Lill Kristiansen

Publication date: 6 November 1994

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01270624

zbMATH Keywords

mollificationrecursive functionalsqualitative domainstotality domains

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Higher-type and set recursion theory (03D65)

Related Items (2)

Equational theories for inductive types ⋮ Can partial indexings be totalized?

Cites Work

• Unnamed Item
• The system \({\mathcal F}\) of variable types, fifteen years later
• Total sets and objects in domain theory
• Total objects in inductively defined types
• Recursive Functionals and Quantifiers of Finite Types I
• Π12-logic, Part 1: Dilators

This page was built for publication: Interpreting higher computations as types with totality