A package for inductive relation definitions in HOL (1991) [30 citations — 2 self]
by T. F. Melham
in Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications
ftp://ftp.dcs.gla.ac.uk/pub/users/tfm/Pubs/IndDef.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Melham91apackage,author = {T. F. Melham},
title = {A package for inductive relation definitions in HOL},
booktitle = {in Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications},
year = {1991},
pages = {350--357},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Abstract:
This paper describes a set of theorem proving tools based on a new derived principle of definition in HOL, namely the introduction of relations inductively defined by a set of rules. Such inductive definitions abound in computer science. Example application areas include reasoning about structured operational semantics, type judgements, transition relations for process algebras, reduction relations, and compositional proof systems. The package described in this paper automates the derivation of certain inductive definitions involved in these applications and provides the basic tools needed for reasoning about the relations introduced by them. 1
Citations
| 62 | Automating Recursive Type Definitions in Higher-Order Logic – Melham - 1989 |
| 3 | Introduction to the Formal Semantics of Programming Languages ', unpublished lecture notes – Winskel - 1985 |
| 2 | Semantics of Programming Languages ', unpublished lecture notes – Pitts - 1989 |
