A Purely Definitional Universal Domain

Authors:
Brian Huffman
Affiliations:
Portland State University,
Venue:
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Year:
2009

Citing 11
Cited 2

Universal profinite domains

Information and Computation
Automating recursive type definitions in higher order logic

Current trends in hardware verification and automated theorem proving
Semantics of programming languages: structures and techniques

Semantics of programming languages: structures and techniques
Domains and lambda-calculi

Domains and lambda-calculi
Inductive Datatypes in HOL - Lessons Learned in Formal-Logic Engineering

TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Nested Datatypes

MPC '98 Proceedings of the Mathematics of Program Construction
A Broader Class of Trees for Recursive Type Definitions for HOL

HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
HOLCF = HOL + LCF

Journal of Functional Programming
System F with type equality coercions

TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
Some Domain Theory and Denotational Semantics in Coq

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Axiomatic constructor classes in Isabelle/HOLCF

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics

Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Formal verification of monad transformers

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing theorem prover tools do not adequately support reasoning about general recursive datatypes. Better support for such datatypes would facilitate reasoning about a wide variety of real-world programs, including those written in continuation-passing style, that are beyond the scope of current tools. This paper introduces a new formalization of a universal domain that is suitable for modeling general recursive datatypes. The construction is purely definitional, introducing no new axioms. Defining recursive types in terms of this universal domain will allow a theorem prover to derive strong reasoning principles, with soundness ensured by construction.