LCF
Edinburgh LCF. A mechanized logic of computation. 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 in°uence on the ¯eld of automated reasoning has been diverse and profound. One of the descendents of LCF is HOL, a proof assistant for higher order logic originally developed for reasoning about hardware.2 The multi-faceted contribution of Robin Milner to the development of HOL is remarkable. Not only did he invent the LCF-approach to theorem proving, but he also designed the ML programming language underlying it and the innovative polymorphic type system used both by ML and the LCF and HOL logics. Code Milner wrote is still in use today, and the design of the hardware veri¯cation system LCF LSM (a now obsolete stepping stone from LCF to HOL) was inspired by Milner’s Calculus of Communicating Systems (CCS)
Keywords for this software
References in zbMATH (referenced in 122 articles , 1 standard article )
Showing results 1 to 20 of 122.
Sorted by year (- Hales, Thomas; Adams, Mark; Bauer, Gertrud; Dang, Tat Dat; Harrison, John; Hoang, Le Truong; Kaliszyk, Cezary; Magron, Victor; McLaughlin, Sean; Nguyen, Tat Thang; Nguyen, Quang Truong; Nipkow, Tobias; Obua, Steven; Pleso, Joseph; Rute, Jason; Solovyev, Alexey; Ta, Thi Hoai An; Tran, Nam Trung; Trieu, Thi Diep; Urban, Josef; Vu, Ky; Zumkeller, Roland: A formal proof of the Kepler conjecture (2017)
- Adams, Mark: HOL zero’s solutions for Pollack-inconsistency (2016)
- Bettini, Lorenzo: Implementing type systems for the IDE with Xsemantics (2016)
- Calude, Cristian S.; Thompson, Declan: Incompleteness, undecidability and automated proofs (invited talk) (2016)
- Kumar, Ramana; Arthan, Rob; Myreen, Magnus O.; Owens, Scott: Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation (2016)
- Matichuk, Daniel; Murray, Toby; Wenzel, Makarius: Eisbach: a proof method language for Isabelle (2016)
- Sternagel, Christian; Thiemann, René: A framework for developing stand-alone certifiers (2015)
- AbdelGawad, Moez A.: A domain-theoretic model of nominally-typed object-oriented programming (2014)
- Constable, Robert; Bickford, Mark: Intuitionistic completeness of first-order logic (2014)
- Moszkowski, Ben (ed.); Guelev, Dimitar (ed.); Leucker, Martin (ed.): Guest editors’ preface to special issue on interval temporal logics (2014)
- Butler, Michael; Maamria, Issam: Practical theory extension in event-B (2013)
- de Moura, Leonardo; Passmore, Grant Olney: The strategy challenge in SMT solving (2013)
- Geuvers, Herman; Nederpelt, Rob: N. G. de Bruijn’s contribution to the formalization of mathematics (2013)
- Khadim, U.; Cuijpers, P.J.L.: Repairing time-determinism in the process algebra for hybrid systems (2012)
- Kumar, Ramana; Hurd, Joe: Standalone tactics using OpenTheory (2012)
- Bernardy, Jean-Philippe; Lasson, Marc: Realizability and parametricity in pure type systems (2011)
- Krauss, Alexander; Sternagel, Christian; Thiemann, René; Fuhs, Carsten; Giesl, Jürgen: Termination of Isabelle functions via termination of rewriting (2011)
- Kumar, Ramana; Weber, Tjark: Validating QBF validity in HOL4 (2011)
- Kunčar, Ondřej: Proving valid quantified Boolean formulas in HOL Light (2011)
- Asperti, Andrea; Sacerdoti Coen, Claudio: Some considerations on the usability of interactive provers (2010)