F*: A Proof-Oriented Programming Language
Introduction F* (pronounced F star) is a general-purpose proof-oriented programming language, supporting both purely functional and effectful programming. It combines the expressive power of dependent types with proof automation based on SMT solving and tactic-based interactive theorem proving. F* programs compile, by default, to OCaml. Various fragments of F* can also be extracted to F#, to C or
CakeML
About CakeML is a functional programming language and an ecosystem of proofs and tools built around the language. The ecosystem includes a proven-correct compiler that can bootstrap itself. The CakeML project consists of the following components, all of which are free software. Language definition. The CakeML language is based on a substantial subset of Standard ML. Its formal semantics is specifi
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
A university unlike any other.
Amazon.com: Type Theory and Formal Proof: An Introduction: Nederpelt, Rob, Geuvers, Herman: Books
Amazon.com: The Little Prover (Mit Press): Friedman, Daniel P. (Author), Eastlund, Carl (Author), Bibby, Duane (Illustrator): Books
Tutorial Materials for Programming Language Research
{{#tags}}- {{label}}
{{/tags}}