日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

会議論文

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
(出版社版)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
フルテキスト (公開)
公開されているフルテキストはありません
付随資料 (公開)
There is no public supplementary material available
引用

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.


引用: https://hdl.handle.net/11858/00-001M-0000-0014-ABE2-D
要旨
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.