Summary: 141
Class Notes for BRICS Minicourse - Fall 2003
SEPARATION LOGIC
6. Trees and Dags
John C. Reynolds
Department of Computer Science
Carnegie Mellon University
and
BRICS
Aarhus University
Revised December 3, 2003
c
2003 John C. Reynolds
142
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