Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A canonical locally named representation of binding
Pollack R., Sato M., Ricciotti W. Journal of Automated Reasoning49 (2):185-207,2012.Type:Article
Date Reviewed: Dec 18 2012

Variables underpin mathematics and logic, appearing in algebraic equations, integrals, and quantified formulas, to give three examples. In an algebraic equation, there is usually implicit universal quantification. The variables range over all (suitable) values. In the integral expression, and in quantified formulas, the variables will be bound by the quantifier or the integral symbol. More strictly, some of the variables will be bound, and others free. A problem occurs when we substitute an expression for a free variable. Some of the free variables in the expression may become captured by the binding construct (that is, a quantifier or integral), and it is folklore in the lambda calculus community that the first published definition of formal substitution was incorrect.

This might be an interesting intellectual curiosity, except for the fact that the representation of variables in computer systems, such as theorem provers, inherits these problems. One way out is to use “nameless dummies” for variables, an approach pioneered by de Bruijn; while this notation is perfectly good for machines, it is horrible to read. So there is a question of how to devise a practical canonical system for dealing with variables, and one answer is provided by this paper, which also presents a brief review of some of the authors’ previous work, as well as nominal approaches pioneered by Pitts.

The authors’ system is based on using distinct syntactic classes for bound variables and free variables, an approach that was first used by Frege in his formulation of formal logic. The work in the paper builds on earlier work, but takes a more abstract view. It is shown that the approach gives a representation isomorphic with the nominal approach implemented in Isabelle, and indeed the meta-theoretical results are formally proved in Isabelle (and the proof scripts are available for download).

This is a well-written paper that presents a new solution to a long-standing problem and places that work squarely in context. It will be of value to the growing community of those involved in formalizing systems meta-theory, as well as to implementers of logics and other formal systems.

Reviewer:  Simon Thompson Review #: CR140759 (1303-0251)
Bookmark and Share
  Featured Reviewer  
 
Mathematical Logic (F.4.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Mathematical Logic": Date
Fundamentals of computing for software engineers
Tanik M. (ed), Chan E., Van Nostrand Reinhold Co., New York, NY, 1991. Type: Book (9780442005252)
Aug 1 1992
Fuzzy sets and fuzzy logic
Gottwald S., Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Wiesbaden, Germany, 1993. Type: Book (9783528053116)
Apr 1 1994
Logics of time and computation
Goldblatt R., Center for Study of Lang. and Info., Stanford, CA, 1987. Type: Book (9789780937073124)
Feb 1 1988
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