Specification and Verification of a Formal System for Structurally Recursive Functions-Reference-Cited by-同舟云学术

Specification and Verification of a Formal System for Structurally Recursive Functions

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

Author:

Abel Andreas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44557-9_1

Reference15 articles.

1. Andreas Abel and Thorsten_Altenkirch. A predicative analysis of structural recursion. Submitted to the Journal of Functional Programming, December 1999.

2. Andreas Abel. foetus-termination checker for simple functional programs. http://www.informatik.uni-muenchen.de/~abel/foetus/ , 1998.

3. Andreas Abel. A semantic analysis of structural recursion. Master’s thesis, Ludwig-Maximilians-University Munich, 1999. http://www.informatik.uni-muenchen.de/~abel/publications/ .

4. Frédéric Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada. Inductive data type systems. To appear in Theoretical Computer Science, 2000.

5. Ulrich Berger and Helmut Schwichtenberg. Program Development by Proof Transformation. Talk at Marktoberdorf, draft available under http://www.mathematik.uni-muenchen.de/~schwicht/ , 1993.

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

1. A Sound Strategy to Compile General Recursion into Finite Depth Pattern Matching;Lecture Notes in Computer Science;2022

2. Compositional Coinduction with Sized Types;Coalgebraic Methods in Computer Science;2016

3. Containers: Constructing strictly positive types;Theoretical Computer Science;2005-09

4. Termination checking with types;RAIRO - Theoretical Informatics and Applications;2004-10

5. Embedding of Systems of Affine Recurrence Equations in Coq;Lecture Notes in Computer Science;2003