We　design　an　axiomatization　for　reversible　computation　called　reversible　ACP　(RACP).　It　has　four　extendible　modules:　basic　reversible　processes　algebra,　algebra　of　reversible　communicating　processes,　recursion　and　abstraction.　Just　like　process　algebra　ACP　in　classical　computing,　RACP　can　be　treated　as　an　axiomatization　foundation　for　reversible　computation.