A Purely Definitional Universal Domain

DOI10.1007/978-3-642-03359-9_19zbMath1252.68065OpenAlexW1837914593MaRDI QIDQ3183534

Brian Huffman

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03359-9_19

Mathematics Subject Classification ID

Related Items (1)

Partiality and recursion in interactive theorem provers – an overview

Uses Software

• HOL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal profinite domains
• Some Domain Theory and Denotational Semantics in Coq
• A Powerdomain Construction
• HOLCF = HOL + LCF
• Mechanizing coinduction and corecursion in higher-order logic
• Theorem Proving in Higher Order Logics

This page was built for publication: A Purely Definitional Universal Domain