Implementing FS0 in Isabelle: Adding Structure at the Metalevel

Often the theoretical virtue of simplicity in a theory does not fit with the practical necessities of use. An example of this is Feferman's FS0, a theory of inductive definitions which is very simple, but seems to lack all practical facilities. We present an implementation in the Isabelle generic theorem prover. We show that we can use the facilities available there to provide all the complex structuring facilities we need without compromising the simplicity of the original theory. The result is a thoroughly practical implementation. We further argue that it is unlikely that a custom implementation would be as effective.

[1]  F. Dick A survey of the project Automath , 1980 .

[2]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[3]  Alan Bundy,et al.  A framework for program development based on schematic proof , 1993, Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design.

[4]  Mehdi T. Harandi,et al.  Workshop on software specification and design , 1988, SOEN.

[5]  Robert Pollack,et al.  On Extensibility of Proof Checkers , 1994, TYPES.

[6]  Carolyn L. Talcott,et al.  A Theory of Binding Structures and Applications to Rewriting , 1993, Theor. Comput. Sci..

[7]  de Ng Dick Bruijn,et al.  A survey of the project Automath , 1980 .

[8]  David A. Basin,et al.  Logic Frameworks for Logic Programs , 1994, LOPSTR.