English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Implementing FS0 in Isabelle: Adding Structure at the Metalevel

MPS-Authors
/persons/resource/persons45002

Matthews,  Seán
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dt9vd
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Matthews, S. (1996). Implementing FS0 in Isabelle: Adding Structure at the Metalevel. In L. C. Paulson (Ed.), Design and Implementation of Symbolic Computation Systems (pp. 228-239). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ABE2-D
Abstract
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.