サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
今年の「#文学」
www.cis.upenn.edu/~plclub
Defunctionalize the Continuation Tags: haskell May 15 2020 By Li-yao Xia This post details a little example of refactoring a program using defunctionalization. Defunctionalization Defunctionalization is a programming technique that emulates higher-order functions using only first-order language features. A higher-order function (HOF) can be defunctionalized in two steps: for every location where t
A streamlined interactive tutorial on fundamentals of Coq, focusing on a minimal set of features needed for developing programming language metatheory. Mostly developed by Aaron Bohannon, with help from Benjamin Pierce, Dimitrios Vytiniotis, and Steve Zdancewic. Contents Getting Started Definitions Proofs Working with Implication and Universal Quantification Working with Definitions Working with C
Getting started: You will need the following software. Coq: Version 8.1 or a later release. Binary and source packages are available from the Coq homepage. Either CoqIDE (comes with Coq) or Proof General. Both provide interactive environments for developing proofs and are easier to work with than Coq's toploop. coq-tutorial.zip, which contains all the Coq files and documentation for this tutorial.
Using Proof Assistants for Programming Language Research or, How to write your next POPL paper in Coq San Francisco, CA January 8th, 2008 A tutorial on the use of the Coq proof assistant in formalizing programming language metatheory. This tutorial will be tailored to people who are familiar with syntactic proofs of programming language metatheory, such as type soundness, but have never used a pro
このページを最初にブックマークしてみませんか?
『Programming Languages @ Penn』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く