Holcf=hol+lcf
نویسندگان
چکیده
HOLCF is the de nitional 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 exible setup for reasoning about functional programs HOLCF supports stan dard domain theory in particular xpoint reasoning and recursive domain equations but also coinductive arguments about lazy datatypes This paper describes in detail how do main theory is embedded in HOL and presents applications from functional programming concurrency and denotational semantics
منابع مشابه
HOLCF: Higher Order Logic of Computable Functions
This paper presents a survey of HOLCF a higher order logic of computable functions The logic HOLCF is based on HOLC a variant of the well known higher order logic HOL which o ers the additional concept of type classes HOLCF extends HOLC with concepts of domain theory such as complete partial orders continuous functions and a xed point operator With the help of type classes the extension can be ...
متن کاملTraces of I/O-Automata in Isabelle/HOLCF
This paper presents a formalization of nite and in nite se quences in domain theory carried out in the theorem prover Isabelle The results are used to model the metatheory of I O automata they are however applicable to any trace based model of parallelism which distinguishes internal and external actions We make use of the logic HOLCF an extension of HOL with domain theory and show how to move ...
متن کاملTraces of I / O - Automata in Isabelle / HOLCFOlaf
This paper presents a formalization of nite and innnite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheory of I/O automata; they are, however, applicable to any trace based model of parallelism which distinguishes internal and external actions. We make use of the logic HOLCF, an extension of HOL with domain theory and show how to ...
متن کاملRefinements in HOLCF: implementation of interactive systems
In this thesis re nement relations for the logic HOLCF are de ned We compare re ne ment relations de ned by theory interpretations and by model inclusion We use these re nements to implement abstract data types ADTs with LCF domains and continuous functions Therefore the implementation of ADTs may be applied to the implementation of interactive and distributed systems speci ed in HOLCF The impl...
متن کاملFrom LCF to HOL: a short history
The original LCF system was a proof-checking program developed at Stanford University by Robin Milner in 1972. Descendents of LCF now form a thriving paradigm in computer assisted reasoning. Many of the developments of the last 25 years have been due to Robin Milner, whose influence on the field of automated reasoning has been diverse and profound. One of the descendents of LCF is HOL, a proof ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Funct. Program.
دوره 9 شماره
صفحات -
تاریخ انتشار 1999