Olaf Muller, Tobias Nipkow, David von Oheimb, and Oskar Slotosch. HOLCF = HOL + LCF. Submitted for publication, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Winskel is (almost) Right - Towards a Mechanized Semantics Textbook - Nipkow (1998) (1 citation) Self-citation (Nipkow) (Correct)
....surface not much changes. Logically, however, it implies leaving the safe haven of HOL s total functions and venturing into the sea of continuity and undefinedness. The purpose of this section is to demonstrate that, given the right infrastructure (HOLCF ) this step need not be painful. HOLCF [Reg94, Reg95, MNOS98] is a conservative extension of HOL with the notions of domain theory [Pau87] employing Isabelle s axiomatic type classes [Wen97] which extend Haskell s type classes [HPJW92] with axioms. In particular, HOLCF provides ffl a class cpo of types which come equipped with a complete partial order v. ....
....oo (D c1) instead of dlift(D c2) oo (D c1) However, the fixpoint induction described below became tricky because one needed to adjoin a strictness statement to the theorem in order for the induction to go through. Hence we abandoned this design. It was only after the introduction of class pcpo [MNOS98] that the above improved semantics became possible. The HOLCF semantics above vindicates Winskel s decision to spend hardly more than a page of prose on a domain theoretic semantics of IMP. The essence of the semantics is lost a little in the domain theoretic noise. Although the formalism stays ....
Olaf Muller, Tobias Nipkow, David von Oheimb, and Oskar Slotosch. HOLCF = HOL + LCF. Submitted for publication, 1998.
Isabelle HOL - The Tutorial - Nipkow (1998) (2 citations) Self-citation (Nipkow) (Correct)
.... of what kinds of datatypes are feasible in HOL see, for example, 2] There are alternatives to pure HOL: LCF [7] is a logic where types like datatype t = C (t t) do indeed make sense (note the intentionally different arrow ) There is even a version of LCF on top of HOL, called HOLCF [4]. 3.4.4 Case study: Tries Tries are a classic search tree data structure [3] for fast indexing with strings. Figure 3.1 gives a graphical example of a trie containing the words all , an , ape , can , car and cat . When searching a string in a trie, the letters of the string are examined ....
Olaf Muller, Tobias Nipkow, David von Oheimb, and Oskar Slotosch. HOLCF = HOL + LCF. Submitted for publication, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC