Possibly infinite sequences in theorem provers: A comparative study
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 89-104
- https://doi.org/10.1007/bfb0028388
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Proof principles for datatypes with iterated recursionPublished by Springer Nature ,1997
- Traces of I/O-automata in Isabelle/HOLCFPublished by Springer Nature ,1997
- Computation on abstract data types. The extensional approach, with an application to streamsAnnals of Pure and Applied Logic, 1996
- Formal verification of a partial-order reduction technique for model checkingPublished by Springer Nature ,1996
- Formal verification for fault-tolerant architectures: prolegomena to the design of PVSIEEE Transactions on Software Engineering, 1995
- The temporal logic of actionsACM Transactions on Programming Languages and Systems, 1994
- Programming with streams in Coq a case study: The Sieve of EratosthenesPublished by Springer Nature ,1994
- IsabellePublished by Springer Nature ,1994
- Logic and ComputationPublished by Cambridge University Press (CUP) ,1987
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940