We represent a theory of (a fragment of) Isabelle/HOL in Isabelle/HOL. The purpose of this exercise is to write packages for domain-specific specifications such as class models, B-machines,..., and generally any languages that can be described with a sequence of “datatype ” in HOL itself; the Isabelle code-generator can then be used to generate tactic code. Consequently the package is geared towards parsing, printing and code-generation to the Isabelle API. It is at the moment not sufficiently rich for doing meta theory on Isabelle itself. Extensions in this direction are possible though. Moreover, the chosen fragment is fairly rudimentary. However it should be easily adapted to one’s needs if a package is written on top of it. The supporte...
We present partial translations of Haskell programs to Isabelle that have been imple-mented as part ...
Datatypes freely generated by their constructors are well supported in mainstream proof assistants. ...
Isabelle is a generic theorem prover. Object-logics are formalized within higher-order logic, which ...
We represent a theory of (a fragment of) Isabelle/HOL in Isabelle/HOL. The purpose of this exercise ...
Abstract We present the generic system framework of Isabelle/Isar underlying recent versions of Isab...
Modern programming languages offer a lot of guarantees (no or few memory leaks, safe parallel progra...
We present the generic system framework of Isabelle/Isar underlying recent versions of Isabelle. Amo...
Abstract We show how modern proof environments comprising code generators and reflection facilities ...
This development provides an efficient, extensible, machine checked collections framework for use in...
Abstract. Datatypes freely generated by their constructors are well supported in mainstream proof as...
Isabelle [Pau94] is a generic theorem proving environment. It is written in ML, and is part of the L...
Isabelle features a Haskell-like type system with ordered type classes al-ready since 1991 (see [Nip...
Isabelle/UTP is a mechanised theory engineering toolkit based on Hoare and He’s Unifying Theories of...
In Isabelle, there are several possibilities when one wants to support partial functions. One could ...
This tutorial describes the new package for defining datatypes and codatatypes in Isabelle/HOL. The ...
We present partial translations of Haskell programs to Isabelle that have been imple-mented as part ...
Datatypes freely generated by their constructors are well supported in mainstream proof assistants. ...
Isabelle is a generic theorem prover. Object-logics are formalized within higher-order logic, which ...
We represent a theory of (a fragment of) Isabelle/HOL in Isabelle/HOL. The purpose of this exercise ...
Abstract We present the generic system framework of Isabelle/Isar underlying recent versions of Isab...
Modern programming languages offer a lot of guarantees (no or few memory leaks, safe parallel progra...
We present the generic system framework of Isabelle/Isar underlying recent versions of Isabelle. Amo...
Abstract We show how modern proof environments comprising code generators and reflection facilities ...
This development provides an efficient, extensible, machine checked collections framework for use in...
Abstract. Datatypes freely generated by their constructors are well supported in mainstream proof as...
Isabelle [Pau94] is a generic theorem proving environment. It is written in ML, and is part of the L...
Isabelle features a Haskell-like type system with ordered type classes al-ready since 1991 (see [Nip...
Isabelle/UTP is a mechanised theory engineering toolkit based on Hoare and He’s Unifying Theories of...
In Isabelle, there are several possibilities when one wants to support partial functions. One could ...
This tutorial describes the new package for defining datatypes and codatatypes in Isabelle/HOL. The ...
We present partial translations of Haskell programs to Isabelle that have been imple-mented as part ...
Datatypes freely generated by their constructors are well supported in mainstream proof assistants. ...
Isabelle is a generic theorem prover. Object-logics are formalized within higher-order logic, which ...