Cited in
(26)- Nusschecker
- The verified CakeML compiler backend
- A revision of the proof of the Kepler conjecture
- Refinement to Imperative/HOL
- Netsoft
- CompCertTSO
- Poly/ML
- Camlp4
- Dijkstra Shortest Path
- Collections
- Flow Networks
- Separation Logic
- Imperative Refinement
- petBoss
- PolyCleaner
- Prpu_Maxflow
- scientific article; zbMATH DE number 1948402 (Why is no real title available?)
- AMulet
- A verified proof checker for higher-order logic
- Pacheck
- Refinement to imperative HOL
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
- Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
- Lightweight checkpointing for concurrent ML
- Producing all ideals of a forest, functionally
- Hierarchical memory management for parallel programs
This page was built for software: MLton
