Skip to main content
Conference Proceedings

Towards a proof theory of parameterized specifications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1984) 173 LNCS 375-391
DOI: 10.1007/3-540-13346-1_19
6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It is shown that certain parameterized data types have a "typical" initial algebra which captures the equational theory of the data type. Hence the characteristic of initial algebras, namely that term induction and rewriting provide a proof method for equational theorems, also applies to parameterized data types.

Cite

CITATION STYLE

APA

Padawitz, P. (1984). Towards a proof theory of parameterized specifications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 173 LNCS, pp. 375–391). Springer Verlag. https://doi.org/10.1007/3-540-13346-1_19

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