Synthetic domain theory in type theory: another logic of computable functions

DOI10.1007/BFB0105416MaRDI QIDQ6567725zbMATH OpenFDO

Authors Bernhard Reus

Publication date 5 July 2024

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

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• scientific article; zbMATH DE number 1005001
• Formalizing synthetic domain theory. The basic definitions
• General synthetic domain theory – a logical approach
• scientific article; zbMATH DE number 1086725
• Extensional -spaces in type theory

Cites work

• Extensional PERs
• scientific article; zbMATH DE number 3730851 (Why is no real title available?)
• scientific article; zbMATH DE number 19484 (Why is no real title available?)
• scientific article; zbMATH DE number 19486 (Why is no real title available?)
• scientific article; zbMATH DE number 591911 (Why is no real title available?)
• scientific article; zbMATH DE number 1005001 (Why is no real title available?)
• scientific article; zbMATH DE number 226803 (Why is no real title available?)
• Logic and Computation

This page was built for publication: Synthetic domain theory in type theory: another logic of computable functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567725)