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

Active Bibliography

4 Analysis of a Guard Condition in Type Theory – Roberto M. Amadio, Roberto M. Amadio, Solange Coupet-grimal, Solange Coupet-grimal, Projet Meije - 1997
5 The Unfolding of Non-Finitist Arithmetic – Solomon Feferman, Thomas Strahm - 2000
16 Un Calcul De Constructions Infinies Et Son Application A La Verification De Systemes Communicants – Carlos Eduardo Giménez, Suprieure De Lyon, Spcialit Informatique, Par Carlos Eduardo Gimnez, De Systemes Communicants, Roberto Amadio, Roberto Amadio, Luc Boug, Thierry Coquand, Thierry Coquand, Michel Cosnard (president, Gilles Kahn - 1996
2 Applications of the Kleene-Kreisel Density Theorem to Theoretical Computer Science – Dag Normann - 2006
4 On the ubiquity of certain total type structures – John Longley - 2007
2 Computing with functionals - computability theory or computer science – Dag Normann - 2006
6 On sequential functionals of type 3 – Dag Normann - 2006
41 Mechanizing Coinduction and Corecursion in Higher-order Logic – Lawrence C. Paulson - 1997
2 Minimisation Vs. Recursion on the Partial Continuous Functionals – Ulrich Berger
8 Density and Choice for Total Continuous Functionals – Helmut Schwichtenberg - 1996
23 Induction and co-induction in sequent calculus – Alwen Tiu, Alberto Momigliano - 2003
1 What Is an Algorithm? – Yiannis N. Moschovakis
23 What Is an Algorithm? – Yiannis N. Moschovakis - 2000
20 Computational Foundations of Basic Recursive Function Theory – Robert L. Constable, Scott Fraser Smith - 1988
32 Computability and recursion – Robert I. Soare - 1996
11 Notions of computability at higher types I – John Longley - 2005
Recursion Theory – Helmut Schwichtenberg - 2007
16 Gödel's program for new axioms: Why, where, how and what? – Solomon Feferman - 1996
36 The sequentially realizable functionals – John Longley