Specification and verification of a formal system for structurally recursive functions (2000) [6 citations — 6 self]

Download:
pdf | ps

by Andreas Abel

Types for Proof and Programs, International Workshop, TYPES ’99, volume 1956 of Lecture Notes in Computer Science

http://www.tcs.informatik.uni-muenchen.de/~abel/sound-simple.ps.gz

Add To MetaCart

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Abel00specificationand,
    author = {Andreas Abel},
    title = {Specification and verification of a formal system for structurally recursive functions},
    booktitle = {Types for Proof and Programs, International Workshop, TYPES ’99, volume 1956 of Lecture Notes in Computer Science},
    year = {2000},
    pages = {1--20},
    publisher = {Springer-Verlag}
}

Abstract:

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. 1

Citations

530	A framework for defining logics – Harper, Honsell, et al. - 1993
266	1984] Intuitionistic Type Theory – Martin-Löf
74	Pattern Matching with Dependent Types – Coquand - 1992
50	Codifying guarded definitions with recursion schemes – Giménez - 1994
47	Abstract Data Type Systems – Jouannaud, Okada - 1997
33	A predicative analysis of structural recursion – Abel, Altenkirch - 2000
9	foetus – Termination Checker for Simple Functional Programs. www.tcs.informatik. uni-muenchen.de/~abel/foetus – Abel - 1998
8	McAllester and Kostas Arkoudas. Walther Recursion – David - 1996
8	Ensuring Termination in ESFP – Telford, Turner - 2000
6	Twelf user's guide – Pfenning, Schurmann - 1998
5	Agda home page. http://www.cs.chalmers.se/ ~catarina/agda – Coquand - 1999
2	Termination and reduction checking – Pientka, Pfenning - 2000
1	and Helmut Schwichtenberg. Program Development by Proof Transformation. Talk at Marktoberdorf, draft available under http://www.mathematik.uni-muenchen.de/~schwicht – Berger - 1993
1	Ensuring Termination in ESFP. Submitted to BCTCS 15 proceedings issue of – Telford, Turner - 1999

View or Download | Add to My Collection | Correct Errors