Aubin, R. Strategies for Mechanizing Structural Induction. Proc. 5th Int. Joint Conf. on Artificial Intelligence, Cambridge, Massachusetts, August, 1977, pp. 363-369. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Hope: An Experimental Applicative Language - Burstall, MacQueen, Sannella (1980) (89 citations) (Correct)
....by a pattern (see section 3.2) on the left hand side of the equation. For example: reverse(nil) nil (1) reverse(a: l) reverse(l) a] 2) the symbol is infix append ) This defines the (top level) reverse of a list; for example: reverse(l: 2: nil) reverse(2: nil) [1] = reverse(nil) 2] 1] nil [2] 1] So reverse [1,2] 2,1] by two applications of equation 2 followed by a single application of equation 1) The left hand side patterns will normally be disjoint and be related to the structure of the tyDe definition: 138 data list alpha ....
....on the left hand side of the equation. For example: reverse(nil) nil (1) reverse(a: l) reverse(l) a] 2) the symbol is infix append ) This defines the (top level) reverse of a list; for example: reverse(l: 2: nil) reverse(2: nil) 1] reverse(nil) 2] [1] : nil [2] 1] So reverse [1,2] 2,1] by two applications of equation 2 followed by a single application of equation 1) The left hand side patterns will normally be disjoint and be related to the structure of the tyDe definition: 138 data list alpha = nil alpha : list alpha ....
[Article contains additional citation context not shown here]
Aubin, R. Strategies for Mechanizing Structural Induction. Proc. 5th Int. Joint Conf. on Artificial Intelligence, Cambridge, Massachusetts, August, 1977, pp. 363-369.
A Verified Implementation of an Applicative Language with Dynamic .. - Flatau (1992) (5 citations) (Correct)
....the same expression compiler as McCarthy and Painter. Milner and Weyhrauch [22] give a machine checked proof of an expression compiler similar to that of McCarthy and Painter. This is part of a larger compiler that includes assignment, conditional, and while statements. Cartwright [8] and Aubin [1] also prove versions of the McCarthy Painter compiler. Boyer and Moore [4] prove mechanically the correctness of a compiler similar to that of McCarthy and Painter. Their target machine has an unbounded stack, infinite precision, an unbounded number of registers and the operations of the target ....
....Expression: APP (CONS X (CHANGE ELEMENTS Y) 1 TRUE . 1 FALSE) Variable Alist: LIST (CONS X F) CONS Y (CONS T (CONS T F) DEFINITION (APP X Y) IF (LISTP X) CONS (CAR X) APP (CDR X) Y) Y) DEFINITION (CHANGE ELEMENTS LIST) IF (LISTP LIST) 0] IF (TRUEP (CAR LIST) [1] (CONS F (CHANGE ELEMENTS (CDR LIST) 2] CONS T ; 3] CHANGE ELEMENTS (CDR LIST) 4] IF (TRUEP LIST) F T) 5] Figure 3.1: An example program cost is infinite. A nonconstructive axiomatization of V C is part of the standard Nqthm Logic. Figure 3.1 shows a simple expression and a ....
[Article contains additional citation context not shown here]
Raymond Aubin. Strategies for mechanizing structural induction. In International Joint Conference on Artificial Intelligence, 1977.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC