Specification and Verification of a Formal System for Structurally Recursive Functions

Authors:
Andreas Abel
Affiliations:
-
Venue:
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
Year:
1999

Citing 6
Cited 0

A framework for defining logics

Journal of the ACM (JACM)
Abstract data type systems

Theoretical Computer Science - Special issue: algebraic development techniques
Inductive-data-type systems

Theoretical Computer Science - Special issue on theories of types and proofs
Codifying Guarded Definitions with Recursive Schemes

TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
Walther Recursion

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A predicative analysis of structural recursion

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A type theoretic programming language is introduced that is based on lambda calculus with coproducts, products and inductive types, and additionally allows the definition of recursive functions in the way that is common in most functional programming languages. A formal system is presented that checks whether such a definition is structurally recursive and a soundness theorem is shown for this system. Thus all functions passing this check are ensured to terminate on all inputs. For the moment only non-mutual recursive functions are considered.