Skip to primary content
Skip to secondary content

Thoughts on Computing

英雄无岁,江湖无辈

Thoughts on Computing

Main menu

  • Home
  • Archives
  • Publications
  • Projects
  • Talks
  • Quotes
  • Gallery
  • About

Category Archives: coq

Prove determinacy for a small language

Posted on July 13, 2017 by kainwenlv
Reply

Recently I started reading the book Types and Programming Languages. And I found it interesting to proof the lemmas in the book using Coq.

Continue reading →

Posted in coq, tapl | Leave a reply

Navigation

  • Home
  • Archives
  • Publications
  • Projects
  • Talks
  • Quotes
  • Gallery
  • About
Powered by WordPress.com.
 

Loading Comments...