Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Weyl’s predicative classical mathematics as a logic-enriched type theory
Adams R., Luo Z. ACM Transactions on Computational Logic11 (2):1-29,2010.Type:Article
Date Reviewed: May 28 2010

Given proof-assistant builders’ renewed interest in foundational issues, revisiting Hermann Weyl’s classic text [1] is a worthy endeavor. Unfortunately, this paper greatly disappoints.

First, the rather cursory introduction might mislead unwary readers into thinking that the paper is comprehensive. For example, it is strange that the authors don’t mention The seventeen provers of the world [2] in their list of proof assistants. Also, the references are generally incomplete.

An appealing part of Adams and Luo’s framework is the separation between data types and propositions. However, once separated, in order for them to be useful, they have to be linked to each other--this link is never made clear. The authors document some anomalies in their system, which is to be commended, but they do not adequately justify why they made such design choices.

Perhaps the biggest divergence is that Weyl’s system is fundamentally based on relations, while the work in this paper is fundamentally functional. This is a nontrivial difference that casts doubt on the whole enterprise. While much of the paper describes logic-enriched type theory (LTT), the description of what the authors have actually formalized from Weyl’s book is rather short, even though it is supposed to be the main topic of the paper.

Despite the paper’s flaws, it seems as though the authors have done some rather interesting work. Unfortunately, their description of this work leaves much to be desired.

Reviewer:  Jacques Carette Review #: CR138049 (1010-1041)
1) Weyl, H.; Pollard, S. (Trans.); Bole, T. (Trans.) The continuum: a critical examination of the foundation of analysis. Thomas Jefferson University Press, Kirksville, MO, 1987.
2) Wiedijk, F. (Ed.) The seventeen provers of the world. Springer, New York, NY, 2006.
Bookmark and Share
  Featured Reviewer  
 
Lambda Calculus And Related Systems (F.4.1 ... )
 
 
Data Types And Structures (D.3.3 ... )
 
 
Mechanical Theorem Proving (F.4.1 ... )
 
 
Applicative (Functional) Programming (D.1.1 )
 
 
Formal Definitions And Theory (D.3.1 )
 
 
General (I.1.0 )
 
  more  
Would you recommend this review?
yes
no
Other reviews under "Lambda Calculus And Related Systems": Date
Polymorphic rewriting conserves algebraic strong normalization
Breazu-Tannen V., Gallier J. Theoretical Computer Science 83(1): 3-28, 1991. Type: Article
Aug 1 1992
Metacircularity in the polymorphic &lgr;-calculus
Pfenning F. (ed), Lee P. (ed) Theoretical Computer Science 89(1): 137-159, 1991. Type: Article
Nov 1 1992
Quantitative domains and infinitary algebras
Lamarche F. Theoretical Computer Science 94(1): 37-62, 1992. Type: Article
Dec 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy