Coinductive Field of Exact Real Numbers and General Corecursion (2006)

Cached

Download Links

by Milad Niqui
Citations:2 - 0 self

Documents Related by Co-Citation

2 Type-Based Termination. A Polymorphic Lambda-Calculus with Sized Higher-Order Types. PhD thesis, Fakültat für Mathematik, Informatik und Statistik der Ludwig-Maximilians-Universität – A Abel - 2006
24 On the productivity of recursive list definitions – Ben A Sijtsma - 1989
9 A Unifying Approach to Recursive and Co-recursive Definitions – Pietro Di Gianantonio, Marino Miculan - 2002
228 A Tutorial on (Co)Algebras and (Co)Induction – Bart Jacobs, Jan Rutten - 1997
22 Filters on coinductive streams, an application to eratosthenes’ sieve – Yves Bertot - 2005
13 Productivity of Stream Definitions – Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop - 2008
41 Mechanizing Coinduction and Corecursion in Higher-order Logic – Lawrence C. Paulson - 1997
17 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
84 Infinite Objects in Type Theory – Thierry Coquand
40 Type-Based Termination of Recursive Definitions – G. Barthe, M. J. Frade, E. Giménez, L. Pinto, T. Uustalu - 2002
38 Modelling General Recursion in Type Theory – Ana Bove, Venanzio Capretta - 2002
475 Interactive Theorem Proving and Program Development. Coq’Art: The Calculus of Inductive Constructions – Yves Bertot, Pierre Castéran - 2004
1 Experiments on using structural recursion for corecursion: Coq code – Y Bertot, E Komendantskaya - 2008
1 Posting to Coq club. Codata: problem with guardedness condition – S Bronson - 2008
1 Posting to Coq club. Codata: problem with guardedness condition?; An ad-hoc approach to productive definitions. 1,4 Aug 2008. http://pauillac.inria.fr/pipermail/coq-club/2008/003859.html and http://sneezy.cs.nott.ac.uk/fplunch/weblog/?p=109 – N A Danielsson
1 Hamming’s exercise in SASL – E W Dijkstra - 1981
22 Functional Differentiation of Computer Programs – Jerzy Karczmarczuk - 1998
22 Function definition in higher order logic – Konrad Slind - 1996
9 Efficient reasoning about executable specifications in Coq, in – G Barthe, P Courtieu - 2002