Theorem Proving for All
Theorem Proving for All Equational Reasoning in Liquid Haskell Niki Vazou, Joachim Breitner, Will Kunkel, David Van Horn, and Graham Hutton [PDF] 1.Introduction 2.Reasoning about Programs 2.1. Lightweight Reasoning 2.2. Induction on Lists 2.3. Proof Automation 3.Totality and Termination 3.1. Totality Checking 3.2. Termination Checking 3.3. Uncaught termination 4.Function Optimization 4.1. Example:
一人Computer Scienceのカレンダー | Advent Calendar 2017 - Qiita
The Qiita Advent Calendar 2017 is supported by the following companies, organizations, and services.
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Sandy Maguire: A New Kind of Programming: Tactic Metaprogramming in Haskell @ZuriHac21
Towards Tactic Metaprogramming in Haskell :: Reasonably Polymorphic
Reddit - Dive into anything
