Computation on abstract data types. The extensional approach, with an application to streams

Cached

Download Links

by Solomon Feferman
Venue:ANNALS OF PURE AND APPLIED LOGIC
Citations:7 - 2 self

Documents Related by Co-Citation

44 Introduction to HOL: a theorem-proving environment for higher-order logic – M J C Gordon, T F Melham - 1993
6 A new approach to abstract data types II. Computations on ADTs as ordinary computation – S Feferman - 1991
21 The formal language of recursion – Yiannis N Moschovakis - 1989
471 An introduction to input/output automata – Nancy A. Lynch, Mark R. Tuttle - 1989
29 Universal algebra in higher types – K Meinke - 1992
14 Traces of I/O-Automata in Isabelle/HOLCF – Olaf Müller, Tobias Nipkow - 1997
17 Proof Principles for Datatypes with Iterated Recursion – Ulrich Hensel, Bart Jacobs - 1997
34 Reflecting on Incompleteness – S Feferman - 1991
24 HOLCF: Higher Order Logic of Computable Functions – Franz Regensburger - 1995
422 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
41 Mechanizing Coinduction and Corecursion in Higher-order Logic – Lawrence C. Paulson - 1997
40 Logic and Computation – L Paulson - 1982
265 Foundations of Constructive Mathematics – M J Beeson - 1985
2 A Formalization of Finite and Infinite Sequences in PVS – M. C. A. Devillers, W.O.D. Griffioen - 1997
23 A HOL basis for reasoning about functional programs – Sten Agerholm - 1994
14 Programming with streams in Coq — a case study: the sieve of Eratosthenes – François Leclerc, Christine Paulin-Mohring - 1993
818 The Temporal Logic of Actions – Leslie Lamport - 1993
854 A formulation of the simple theory of types – Alonzo Church - 1940
1 The non-constructive operator, fixed point theories with ordinals, and the bar rule. Submitted for publication. Addresses Solomon Feferman – T Strahm - 1997