Fix-Point Equations for Well-Founded Recursion in Type Theory-Reference-Cited by-同舟云学术

Fix-Point Equations for Well-Founded Recursion in Type Theory

Published:2000 Issue: Volume: Page:1-16
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Balaa Antonia,Bertot Yves

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44659-1_1

Reference16 articles.

1. Peter Aczel. An introduction to inductive definitions. In J. Barwise, editor, Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics, 1977.

2. Robert Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harber, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, J. T. Sasaki, and S. F. Smith. Implementing mathematics with the Nuprl proof development system. Prentice-Hall, 1986.

3. Lect Notes Comput Sci;R. L. Constable,1985

4. Lect Notes Comput Sci;T. Coquand,1990

5. Lect Notes Comput Sci;T. Coquand,1998

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Certified Reference Validation Mechanism for the Permission Model of Android;Logic-Based Program Synthesis and Transformation;2018

2. Partiality and recursion in interactive theorem provers – an overview;Mathematical Structures in Computer Science;2014-11-10

3. The Optimal Fixed Point Combinator;Interactive Theorem Proving;2010

4. Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant;Functional and Logic Programming;2006

5. General recursion via coinductive types;Logical Methods in Computer Science;2005-07-13