Ana Bove  Home/Search
Context
Related
| md.chalmers.se/~bove...mutual_rec.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: md.chalmers.se/~bove/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show how the methodology presented by Bove for the formalisation of simple general recursive algorithms and extended by Bove and Capretta to treat nested recursion can also be used in the formalisation of mutual general recursive algorithms. The methodology consists of de ning special-purpose accessibility predicates that characterise the inputs on which the algorithms terminate. Each algorithm is then formalised in type theory by structural recursion on the proof that its input satis ... (Update)
Active bibliography (related documents): More All
1.1: Modelling General Recursion in Type Theory - Bove, Capretta (2002) (Correct)
0.4: Nested General Recursion and Partiality in Type Theory - Bove, Capretta (2000) (Correct)
0.4: Type-Theoretic Functional Semantics - Bertot, Capretta, Barman (Correct)
Similar documents based on text: More All
0.5: Generalised Simultaneous Inductive-Recursive Definitions and their .. - Bove (Correct)
0.4: Simple General Recursion in Type Theory - Bove (2000) (Correct)
0.4: Alpha Conversion in Simply Typed Lambda Calculus - Bove, SEVERI (Correct)
BibTeX entry: (Update)
@misc{ bove-mutual,
author = "Ana Bove",
title = "Mutual General Recursion in Type Theory",
url = "citeseer.ist.psu.edu/bove02mutual.html" }
Citations (may not include all citations):266 Information and Computation (context) - Coquand, Huet et al. - 1988
233 The formulae-as-types notion of construction (context) - Howard - 1980
85 The ALF proof editor and its proof engine (context) - Magnusson, Nordstr - 1994
43 Termination of nested and mutually recursive algorithms - Giesl - 1997
25 A general formulation of simultaneous inductive-recursive de.. - Dybjer - 2000
25 Type theory and programming - Coquand, Nordstr et al. - 1994
21 s Type Theory (context) - Nordstr, Petersson et al. - 1990
15 Nested general recursion and partiality in type theory - Bove, Capretta - 2001
15 Intuitionistic Type Theory (context) - Martin-L - 1984
7 An Introduction to Inductive De nitions (context) - Aczel - 1977
6 Terminating General Recursion (context) - Nordstr - 1988
4 Licentiate Thesis of the Department of Computer Science (context) - Bove, Martin-L et al. - 1999
3 Simple general recursion in type theory - Bove - 2001
1 Available WWW ftpftp (context) - Gaspes, om et al. - 1994
Documents on the same site (http://www.md.chalmers.se/~bove/): More
Alpha Conversion in Simply Typed Lambda Calculus - Bove, Severi (Correct)
A Machine-assisted Proof of the Subject Reduction Property.. - Bove, Tasistro (1995) (Correct)
A Machine-assisted Proof that Well Typed Expressions Cannot Go Wrong - Bove (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC