منابع مشابه
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 ...
متن کاملLCF Examples in HOL
The LCF system provides a logic of xed point theory and is useful to reason about nontermination, recursive deenitions and innnite-valued types such as lazy lists. Because of continual presence of bottom elements, it is clumsy for reasoning about nite-valued types and strict functions. The HOL system provides set theory and supports reasoning about nite-valued types and total functions well. In...
متن کاملStructured Theories in LCF
Abs t rac t : An extension to the Edinburgh LCF interactive theorem-proving system is described which provides new ways of constructing theories, drawing upon ideas from the Clear specification language. A new theory can be built from an existing theory in two new ways: by renaming its types and constants, or by abstraction (forgetting some types and constants and perhaps renaming the rest]. A ...
متن کاملBootstrapping LCF Declarative Proofs
Suppose we have been sold on the idea that formalised proofs in an LCF system should resemble their written counterparts, and so consist of formulas that only provide signposts for a fully verified proof. To be practical, most of the fully elaborated verification must then be done by way of general purpose proof procedures. Now if these are the only procedures we implement outside the kernel of...
متن کامل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 p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2019
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s00165-019-00492-1