Specification and verification of a formal system for structurally recursive functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1956, Issue , 2000, Pages

  Abel, Andreas ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); FUNCTIONAL PROGRAMMING;

CO-PRODUCTS; FORMAL SYSTEMS; INDUCTIVE-TYPE; LAMBDA CALCULUS; SPECIFICATION AND VERIFICATION;

RECURSIVE FUNCTIONS;

EID: 84977598112     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44557-9_1     Document Type: Conference Paper

References (13)

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. Frederic Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada. Inductive data type systems. To appear in Theoretical Computer Science, 2000. Ulrich Berger and Helmut Schwichtenberg. Program Development by Proof Transformation. Talk at Marktoberdorf, draft available under http://www.mathematik.uni-muenchen.de/~schwicht/, 1993.
5. Thierry Coquand. Pattern matching with dependent types. WWW, 1992. Catarina Coquand. Agda home page. http://www.cs.chalmers.se/~catarina/agda/, 1999.
6. Eduardo Gimenez. Codifying guarded definitions with recursive schemes. In Peter Dybjer, Bengt Nordstrom, and Jan Smith, editors, Types for Proofs and Programs, International Workshop TYPES’94, B0astad, Sweden, June 6-10, 1994, Selected Papers, volume 996 of LNCS, pages 39-59. Springer, 1995.
7. Robert Harper, Furio Honsell, and Gordon Plotkin. A Framework for Defining Logics. Journal of the Association of Computing Machinery, 40(1):143-184, January 1993.
8. J. P. Jouannaud and M. Okada. Abstract data type systems. Theoretical Computer Science, 173, 1997.
9. David McAllester and Kostas Arkoudas. Walther Recursion. In M. A. McRobbie and J. K. Slaney, editors, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30 - August 3, 1996, Proceedings, volume 1104 of Lecture Notes in Computer Science. SpringerVerlag, 1996.
10. Per Martin-Lof. Intuitionistic Type Theory. Bibliopolis, 1984.
11. Brigitte Pientka and Frank Pfenning. Termination and Reduction Checking in the Logical Framework. Workshop on Automation of Proofs by Mathematical Induction, CADE-17, Pittsburgh, PA, USA, June 2000.
12. Frank Pfenning and Carsten Schurmann. Twelf user’s guide. Technical report, Carnegie Mellon University, 1998.
13. A.J. Telford and D.A. Turner. Ensuring Termination in ESFP. Submitted to BCTCS 15 proceedings issue of Journal of Universal Computer Science, 1999.