Poly/ML
E807596
Poly/ML is a high-performance, open-source implementation of the Standard ML programming language, often used in theorem proving and formal methods.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Poly/ML canonical | 1 |
| Poly/ML (runtime) | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9566690 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Poly/ML Context triple: [Standard ML, hasImplementation, Poly/ML]
-
A.
Standard ML
Standard ML is a statically typed functional programming language with type inference and a formal semantics, widely used in programming language research and teaching.
-
B.
The Definition of Standard ML
The Definition of Standard ML is the formal language specification that rigorously defines the syntax and semantics of the Standard ML functional programming language.
-
C.
OCaml
OCaml is a statically typed functional programming language from the ML family, known for its powerful type system, pattern matching, and efficient native code compilation.
-
D.
ReasonML
ReasonML is a syntax and toolchain for the OCaml language that offers a JavaScript-friendly, type-safe alternative for building web and native applications.
-
E.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Poly/ML Target entity description: Poly/ML is a high-performance, open-source implementation of the Standard ML programming language, often used in theorem proving and formal methods.
-
A.
Standard ML
Standard ML is a statically typed functional programming language with type inference and a formal semantics, widely used in programming language research and teaching.
-
B.
The Definition of Standard ML
The Definition of Standard ML is the formal language specification that rigorously defines the syntax and semantics of the Standard ML functional programming language.
-
C.
OCaml
OCaml is a statically typed functional programming language from the ML family, known for its powerful type system, pattern matching, and efficient native code compilation.
-
D.
ReasonML
ReasonML is a syntax and toolchain for the OCaml language that offers a JavaScript-friendly, type-safe alternative for building web and native applications.
-
E.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
Standard ML implementation
ⓘ
compiler ⓘ open-source software ⓘ runtime system ⓘ |
| category | ML-family language implementation ⓘ |
| conformsTo | Standard ML language definition NERFINISHED ⓘ |
| focus |
performance
ⓘ
robustness for large proof developments ⓘ |
| hasComponent |
compiler
ⓘ
interactive top-level environment ⓘ runtime system ⓘ |
| hasFeature |
debugger
ⓘ
foreign function interface ⓘ incremental compilation ⓘ profiling tools ⓘ runtime system with garbage collector ⓘ |
| hasGarbageCollector | true ⓘ |
| hasInteractiveREPL | true ⓘ |
| hasWebsite | https://www.polyml.org/ ⓘ |
| implementationLanguage |
C
ⓘ
C++ ⓘ |
| isHighPerformance | true ⓘ |
| isMaintained | true ⓘ |
| isOpenSource | true ⓘ |
| isUsedBy |
HOL-based theorem provers
ⓘ
Isabelle proof assistant NERFINISHED ⓘ |
| isUsedFor |
formal methods
ⓘ
theorem proving ⓘ |
| license | LGPL NERFINISHED ⓘ |
| optimizedFor |
interactive theorem proving workloads
ⓘ
large formal developments ⓘ |
| programmingLanguage | Standard ML NERFINISHED ⓘ |
| repository | https://github.com/polyml/polyml ⓘ |
| supports |
bytecode compilation
ⓘ
garbage collection ⓘ interactive top-level ⓘ multi-threading ⓘ native code compilation ⓘ |
| supportsLanguage | Standard ML NERFINISHED ⓘ |
| supportsStandard | Standard ML Basis Library (substantial subset) NERFINISHED ⓘ |
| targetPlatform |
Linux
NERFINISHED
ⓘ
Windows NERFINISHED ⓘ macOS NERFINISHED ⓘ various Unix-like systems ⓘ |
| usedIn |
Isabelle/HOL
NERFINISHED
ⓘ
formal verification research ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Poly/ML Description of subject: Poly/ML is a high-performance, open-source implementation of the Standard ML programming language, often used in theorem proving and formal methods.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Isabelle
this entity surface form:
Poly/ML (runtime)