Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: LCF theorem prover | Statement: [Robin Milner, knownFor, LCF theorem prover]

Target entity: LCF theorem prover
Context triple: [Robin Milner, knownFor, LCF theorem prover]

• A. Hoare logic
  Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
• B. Knuth–Bendix completion algorithm
  The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
• C. Gilles Dowek
  Gilles Dowek is a French logician and computer scientist known for his influential work in proof theory, type systems, and automated deduction.
• D. LambdaProlog
  LambdaProlog is a logic programming language that extends Prolog with higher-order features, polymorphism, and strong support for reasoning about formal systems and syntax with bindings.
• E. Church–Rosser property
  The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: LCF theorem prover
Triple: [Robin Milner, knownFor, LCF theorem prover]

The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.

Target entity: LCF theorem prover
Target entity description: The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.

• A. Hoare logic
  Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
• B. Knuth–Bendix completion algorithm
  The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
• C. Gilles Dowek
  Gilles Dowek is a French logician and computer scientist known for his influential work in proof theory, type systems, and automated deduction.
• D. LambdaProlog
  LambdaProlog is a logic programming language that extends Prolog with higher-order features, polymorphism, and strong support for reasoning about formal systems and syntax with bindings.
• E. Church–Rosser property
  The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
• F. None of above. chosen