ROOT.ML
author Christian Urban <christian dot urban at kcl dot ac dot uk>
Wed, 30 Jan 2013 02:26:56 +0000
changeset 97 d6f04e3e9894
parent 71 8c7f10b3da7b
child 101 06db15939b7c
permissions -rw-r--r--
updated paper

(*
	turing_basic.thy : The basic definitions of Turing Machine.
	uncomputable.thy : The existence of Turing uncomputable functions.
	abacus.thy : The basic definitions of Abacus machine (An intermediate langauge underneath recursive functions) and
	             the compilation of Abacus machines into Turing Machines.
	rec_def.thy: The basic definitions of Recursive Functions.
	recursive.thy : The compilation of Recursive Functions into
		     Abacus machines.
	UF.thy : The construction of Universal Function, named "rec_F" and the proof of its correctness.
	UTM.thy: Obtaining Uinversal Turing Machine by scarfolding the Turing Machine compiled from "rec_F" with some 
	         initialization and termination processing Turing Machines.
*)
  
no_document 
use_thys ["thys/turing_basic",
          "thys/turing_hoare", 
	  "thys/uncomputable"(*, 
	  "thys/abacus", 
	  "thys/rec_def", 
	  "thys/recursive",
          "thys/UF"*)]