Executing higher order logic (2002)
Cached
Download Links
| Venue: | In Proc. TYPES Working Group Annual Meeting 2000, LNCS |
| Citations: | 41 - 16 self |
BibTeX
@INPROCEEDINGS{Berghofer02executinghigher,
author = {Stefan Berghofer and Tobias Nipkow and Technische Universität München},
title = {Executing higher order logic},
booktitle = {In Proc. TYPES Working Group Annual Meeting 2000, LNCS},
year = {2002},
pages = {24--40},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are compiled into a functional program. Functions and inductively defined relations can be mixed. Inductive definitions must be such that they can be executed in Prolog style but requiring only matching rather than unification. This restriction is enforced by a mode analysis. Tail recursive partial functions can be defined and executed with the help of a while combinator. 1
Citations
| 368 | The inductive approach to verifying cryptographic protocols - Paulson - 1998 |
| 88 | The Coq Proof Assistant Reference Manual : Version 6.1 - Barras, Boutin, et al. - 1997 |
| 31 | Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving - Aagaard, Jones, et al. - 1999 |
| 3 | Executing formal specifications by translation to higher order logic programming - Andrews - 1997 |
| 1 | Executing formal speci by translation to higher order logic programming - Andrews |
| 1 | journ'ees francophones des langages applicatifs (JFLA99 - Goerigk - 1999 |
