Logic for Computable Functions

E1971543 UNEXPLORED

Logic for Computable Functions is a formal system and framework for interactive theorem proving that pioneered the LCF approach, influencing later proof assistants such as HOL and Isabelle.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Logic for Computable Functions canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

LCF → fullName → Logic for Computable Functions ⓘ