A Purely Definitional Universal Domain

DOI10.1007/978-3-642-03359-9_19MaRDI QIDQ3183534zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Formalized, effective domain theory in Coq
• Another look at function domains
• scientific article; zbMATH DE number 1424012
• Recursive Functions on Lazy Lists via Domains and Topologies
• Partiality and recursion in interactive theorem provers -- an overview

Cites work

• A Powerdomain Construction
• HOLCF = HOL + LCF
• scientific article; zbMATH DE number 1229489 (Why is no real title available?)
• scientific article; zbMATH DE number 555217 (Why is no real title available?)
• scientific article; zbMATH DE number 1424012 (Why is no real title available?)
• Mechanizing coinduction and corecursion in higher-order logic
• Some Domain Theory and Denotational Semantics in Coq
• Theorem Proving in Higher Order Logics
• Universal profinite domains

Cited in

(5)

• The Undefined Domain: Precise Relational Information for Entities That Do Not Exist
• scientific article; zbMATH DE number 1538024 (Why is no real title available?)
• Partiality and recursion in interactive theorem provers -- an overview
• The Worker/Wrapper Transformation
• Putting the `K' into Bird's derivation of Knuth-Morris-Pratt string matching

Describes a project that uses

Uses Software

• HOL

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

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