Thierry Coquand, Peter Dybjer  Home/Search
Context
Related
| cs.chalmers.se/~coquand/./ind.ps 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: cs.chalmers.se/~coquand/giens (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper also the quite elegant case notation for the definition of functions over data types. He also discussed the general method of structural induction for proving properties of programs which manipulate such data types. This was further analyzed in Hoare's paper on recursive data structures [13]. Earlier, McCarthy and Painter [27] had used structural induction for proving the correctness of a compiler for arithmetic expressions. (Update)
Similar documents (at the sentence level):
35.2%: Inductive Definitions and Type Theory: An Introduction - Coquand, Dybjer (Correct)
Active bibliography (related documents): More All
0.5: On the computational content of the Axiom of Choice - Berardi, Bezem, Coquand (1995) (Correct)
0.4: Proof Theory in Type Theory - Coquand (1996) (Correct)
0.4: Constructive Topology and Combinatorics - Coquand (1991) (Correct)
Similar documents based on text: More All
0.1: Un Calcul De Constructions Infinies Et Son Application a La. . . - Gimenez (1996) (Correct)
0.1: Un Calcul De Constructions Infinies Et Son Application A La.. - Giménez (1996) (Correct)
0.1: A user's guide to ALF - Altenkirch, Gaspes, Nordström, von.. (1994) (Correct)
BibTeX entry: (Update)
@inproceedings{ coquand94inductive,
author = "Thierry Coquand and Peter Dybjer",
title = "Inductive Definitions and Type Theory: an Introduction (Preliminary Version)",
booktitle = "Foundations of Software Technology and Theoretical Computer Science",
pages = "60-76",
year = "1994",
url = "citeseer.ist.psu.edu/259869.html" }
Citations (may not include all citations):906 A structural approach to operational semantics - Plotkin - 1981
652 A Discipline of Programming (context) - Dijkstra - 1976
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
173 An Initial Algebra Approach to the Specification (context) - Goguen, Thatcher et al. - 1978
143 Foundations of Constructive Mathematics (context) - Beeson - 1985
112 Constructivism in Mathematics (context) - Troelstra, van Dalen - 1988
97 An introduction to inductive definitions (context) - Aczel - 1977
71 An intuitionistic theory of types: Predicative part (context) - Martin-Lof - 1975
62 Programming in Martin-Lof's Type Theory: an Introduction (context) - Nordstrom, Petersson et al. - 1990
50 Proving properties of programs by structural induction (context) - Burstall - 1985
49 Inductive definitions in the system Coq - rules and properti.. - Paulin-Mohring - 1993 ACM DBLP
49 Correctness of a compiler for arithmetic expressions - McCarthy, Painter - 1967
44 the interpretation of intuitionistic number theory (context) - Kleene - 1945
41 Notes on Constructive Mathematics (context) - Martin-Lof - 1968
40 Iterated Inductive Definitions and Subsystems of Analysis (context) - Buchholz, Feferman - 1981
38 Proof of translation in natural semantics (context) - Despeyroux - 1986 DBLP
35 Formal Aspects of Computing (context) - Dybjer - 1994
34 Equality in hyperdoctrines and comprehension schema as an ad.. (context) - Lawvere - 1970
31 Interpretation of analysis by mean of constructive functiona.. (context) - Kreisel - 1959
26 Recursive data structures (context) - Hoare - 1975
23 Constructive validity (context) - Scott - 1970
21 Hauptsatz for the intuitionistic theory of iterated inductiv.. (context) - Martin-Lof - 1971
21 Normal Derivability in Classical Logic (context) - Tait - 1968
19 Proof theory of impredicative subsystems of analysis (context) - Buchholz, Schutte - 1988
15 Technical Report (context) - Kahn - 1987
12 programs from proofs in the calculus of constructions (context) - Paulin-Mohring - 1989
7 The domain interpretation of type theory (context) - Martin-Lof - 1983
7 Functional interpretation of bar induction by bar recursion (context) - Howard
4 Absolutely unsolvable problems and relatively undecidable pr.. (context) - Post - 1965
3 Volumes I and II (context) - Godel - 1986
3 Logical reflection and formalism (context) - Lorenzen - 1958 DBLP
3 Infinite terms and a system of natural deduction (context) - Martin-Lof - 1972
3 Edition Gauthier-Villars (context) - Lorenzen - 1962
3 Springer Texts and Monographs in Computer Science (context) - Gries, of - 1981
2 the consistency of arithmetic (context) - Herbrand
Documents on the same site (http://www.cs.chalmers.se/~coquand/giens.html):
Course Notes in Typed Lambda Calculus - Coquand (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