Modular structures as dependent types in isabelle

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes a method of representing algebraic structures in the theorem prover Isabelle. We use Isabelle’s higher order logic extended with set theoretic constructions. Dependent types, constructed as HOL sets, are used to represent modular structures by semantical embedding. The modules remain first class citizen of the logic. Hence, they enable adequate formalization of abstract algebraic structures and a natural proof style. Application examples drawn from abstract algebra and lattice theory — the full version of Tarski’s fixpoint theorem — validate the concept.

Cite

CITATION STYLE

APA

Kammüller, F. (1999). Modular structures as dependent types in isabelle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1657, pp. 121–133). Springer Verlag. https://doi.org/10.1007/3-540-48167-2_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free