Summary: 145
Class Notes for CS 818A4 - Spring 2004
SEPARATION LOGIC
6. Trees and Dags
John C. Reynolds
Department of Computer Science
Carnegie Mellon University
April 12, 2004
c
2004 John C. Reynolds

146
S-expressions (a la LISP)
 2 S-exps i
 2 Atoms
or  = ( 1
 2 ) where  1 ;  2 2 S-exps:
Representing S-expressions by Trees
For  2 S-exps, we dene the assertion
tree  (i)
by structural induction:

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

Collections: Mathematics