Verifying the unification algorithm in LCF
Science of Computer Programming - Ellis Horwood series in artificial intelligence
Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Logic and computation: interactive proof with Cambridge LCF
Logic and computation: interactive proof with Cambridge LCF
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Order-sorted polymorphism in Isabelle
Papers presented at the second annual Workshop on Logical environments
Automated reasoning and its applications
HOLCF: Higher Order Logic of Computable Functions
Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
Function Definition in Higher-Order Logic
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Higher Order Quotients and their Implementation in Isabelle HOL
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Possibly Infinite Sequences in Theorem Provers: A Comparative Study
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
I/O Automata and Beyond: Temporal Logic and Abstraction in Isabelle
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
Traces of I/O-Automata in Isabelle/HOLCF
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Winskel is (Almost) Right: Towards a Mechanized Semantics Textbook
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Admissibility of Fixpoint Induction over Partial Types
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
From I/O Automata to Timed I/O Automata
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Recursive Function Definition over Coinductive Types
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Structured formal development in Isabelle
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Fixed point semantics and partial recursion in Coq
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
A Hoare Logic for Call-by-Value Functional Programs
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Extensible Universes for Object-Oriented Data Models
ECOOP '08 Proceedings of the 22nd European conference on Object-Oriented Programming
Higher-Order Separation Logic in Isabelle/HOLCF
Electronic Notes in Theoretical Computer Science (ENTCS)
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Imperative Functional Programming with Isabelle/HOL
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Adapting functional programs to higher order logic
Higher-Order and Symbolic Computation
A Formal Language for Cryptographic Pseudocode
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
An Extensible Encoding of Object-oriented Data Models in hol
Journal of Automated Reasoning
Some Domain Theory and Denotational Semantics in Coq
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A Purely Definitional Universal Domain
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A theory of indirection via approximation
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Subtyping, declaratively: an exercise in mixed induction and coinduction
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Representing model theory in a type-theoretical logical framework
Theoretical Computer Science
Axiomatic constructor classes in Isabelle/HOLCF
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Tactic-based optimized compilation of functional programs
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
A mechanized translation from higher-order logic to set theory
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Formal verification of monad transformers
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
HOLCF is the definitional extension of Church's Higher-Order Logic with Scott's Logic for Computable Functions that has been implemented in the theorem prover Isabelle. This results in a flexible setup for reasoning about functional programs. HOLCF supports standard domain theory (in particular fixpoint reasoning and recursive domain equations), but also coinductive arguments about lazy datatypes. This paper describes in detail how domain theory is embedded in HOL, and presents applications from functional programming, concurrency and denotational semantics.