关闭

Equations: a dependent pattern-matching compiler

236人阅读 评论(0) 收藏 举报

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都说自己不太能够理解,让我这个云山雾罩的感觉能好点,呵呵~~

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:26219次
    • 积分:593
    • 等级:
    • 排名:千里之外
    • 原创:41篇
    • 转载:1篇
    • 译文:0篇
    • 评论:0条