Equations: a dependent pattern-matching compiler

原创 2011年01月20日 00:27:00

Lecturer Matthieu Sozeau

 

Abstract (from calender page)

"We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functions, automatically find their realization in the core type theory and generate proofs to ease reasoning on them. The high-level interface allows to write dependently-typed functions on inductive families in a style close to Agda or Epigram, while their low-level implementation is accepted by the vanilla core type theory of Coq. This setup uses the smallest trusted code base possible and additional tools are provided to maintain a high-level view of definitions. The compiler makes heavy use of type classes and the high-level tactic language of Coq for greater genericity and extensibility."

 

今天参加的人应该是意料之外的多,peter(老爷子大半时间在低调的睡),TC(全程头脑清醒的唯一一个吧大概是),Ana(很nice的小老太太),剩下的一个老头子不认识,此外多半是PostDoc之类,还有4个小master~~

 

基本上是关于一些type理论和Agda应用的,使用所谓的Equation关键字和pattern matching来定义和生成agda code。研究重点貌似是论证了这个生成过程的正确性。最后的问题集中在用户在使用时需要了解哪部分,可以信任什么,从中反映基本上大家都没有听明白其中的细节,特别是在中间的时候连TC都说自己不太能够理解,让我这个云山雾罩的感觉能好点,呵呵~~

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

pattern matching

  • 2013-12-18 19:48
  • 818KB
  • 下载

Pattern Matching

1. Values, Variables, and Types in Matches(1) BasicLet’s cover several kinds of matches. The followi...

Scala新手指南中文版 - 第四篇 Pattern Matching Anonymous Functions(模式匹配匿名函数)

译者注:原文出处http://danielwestheide.com/blog/2012/12/12/the-neophytes-guide-to-scala-part-4-pattern-match...

WEEK3-Lists and pattern matching

1. Lists informally

SQL Server: Is Replication Recovery Model dependent ?

There is a myth that for replication to work properly the databases always have to be in Full recove...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)