Holcf=hol+lcf

@article{Mller1999Holcfhollcf,
  title={Holcf=hol+lcf},
  author={Olaf M{\"u}ller and Tobias Nipkow and David von Oheimb and Oscar Slotosch},
  journal={J. Funct. Program.},
  year={1999},
  volume={9},
  pages={191-223}
}
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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 60 CITATIONS

Short note: Strict unwraps make worker/wrapper fusion totally correct

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Code generation from specifications in higher-order logic

VIEW 32 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Structured Formal Development in Isabelle

VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Tactic-Based Optimized Compilation of Functional Programs

VIEW 9 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Recursive Function Definition over Coinductive Types

VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Formal verification of monad transformers

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Theorem proving support in programming language semantics

  • Thème SYM
  • 2007
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Theorem proving support in programming language semantics

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1999
2018

CITATION STATISTICS

  • 11 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 32 REFERENCES

A veri cation environment for I/O-automata based on

  • uller, Olaf
  • 1998

Admissibility of xpoint induction over partial types

  • Crary, Karl
  • Pages
  • 1998

Possibly in nite sequences

  • uller, Olaf
  • 1997

Re nements in HOLCF: Implementation of interactive systems

  • Slotosch, Oskar
  • Lect . Notes in Comp . Sci .
  • 1997

Function de nition in higher order logic. Pages 381{397

  • Slind, Konrad
  • 1996