Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1017/S095679689900341X | Journal of Functional Programming |
Keywords | Field | DocType |
domain theory,recursive domain equation,standard domain theory,Higher-Order Logic,functional program,functional programming,particular fixpoint reasoning,Computable Functions,coinductive argument,definitional extension | HOL,Programming language,Functional programming,Logic for Computable Functions,Concurrency,Computer science,Automated theorem proving,Denotational semantics,Domain theory,Theoretical computer science,Recursion | Journal |
Volume | Issue | Citations |
9 | 2 | 10 |
PageRank | References | Authors |
0.65 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olaf Müller | 1 | 10 | 0.65 |
| Tobias Nipkow | 2 | 3056 | 232.28 |
| David Von Oheimb | 3 | 153 | 13.28 |
| Oscar Slotosch | 4 | 173 | 19.28 |