General synthetic domain theory – a logical approach
From MaRDI portal
(Redirected from Publication:4248542)
Recommendations
Cited in
(18)- Computational adequacy for recursive types in models of intuitionistic set theory
- Formalizing synthetic domain theory. The basic definitions
- A convenient category of domains
- Some reasons for generalising domain theory
- scientific article; zbMATH DE number 19486 (Why is no real title available?)
- A synthetic theory of sequential domains
- scientific article; zbMATH DE number 1005001 (Why is no real title available?)
- scientific article; zbMATH DE number 1086664 (Why is no real title available?)
- scientific article; zbMATH DE number 1086725 (Why is no real title available?)
- scientific article; zbMATH DE number 1531373 (Why is no real title available?)
- The Scott model of PCF in univalent type theory
- Continuous domains in formal concept analysis
- scientific article; zbMATH DE number 956835 (Why is no real title available?)
- scientific article; zbMATH DE number 956836 (Why is no real title available?)
- Synthetic domain theory in type theory: another logic of computable functions
- Cost-sensitive computational adequacy of higher-order recursion in synthetic domain theory
- Continuous and algebraic domains in univalent foundations
- Comparing free algebras in topological and classical domain theory
This page was built for publication: General synthetic domain theory – a logical approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248542)