Christine Paulin-Mohring  Home/Search
Context Related
| enslyon.fr/pub/LIP/Rapp...RR9249.ps.Z 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: fermivista.math...ftp.enslyon.fr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the pure Calculus of Constructions, it is possible to represent data structures and predicates using higher-order quantification. However, this representation is not satisfactory, from the point of view of both the efficiency of the underlying programs and the power of the logical system. For these reasons, the calculus was extended with a primitive notion of inductive definitions [8]. This paper describes the rules for inductive definitions in the system Coq. They are general enough to ... (Update)
Context of citations to this paper: More
.... in a single logic; for the former, higher order logic encoded in LF [11] and for the latter, the calculus of inductive constructions [22]. Our approach. Our system takes a di#erent logical perspective, one based on metalogic: 1. For our safety policy, we define a logic that...
Cited by: More
Tagless Staged Interpreters for Typed Languages - Pasalic, Taha, Sheard (2002) (Correct)
Constraint-Based Type Inference for Guarded Algebraic Data Types - Simonet, Pottier (2003) (Correct)
Reasoning About Logic Programs Using Definitions And Induction - Wajs (2002) (Correct)
Active bibliography (related documents): More All
0.5: Typechecking in Pure Type Systems - Pollack, Poll (1992) (Correct)
0.5: Procédures De Décisions Dans Les Systèmes.. - Boutin (Correct)
0.4: The Coq Proof Assistant - Reference Manual Version 6.1 - Barras, Boutin, Cornes.. (1997) (Correct)
Similar documents based on text: More All
0.3: Developing certified programs in the system Coq - The Program.. - Parent (1993) (Correct)
0.3: Definitions by Rewriting in the Calculus of Constructions - Blanqui (2001) (Correct)
0.3: Un Calcul De Constructions Infinies Et Son Application A La.. - Giménez (1996) (Correct)
Related documents from co-citation: More All
15: Information and Computation (context) - Coquand, Huet - 1988
14: Lambda Calculi with Types - Barendregt - 1992
12: Inductively defined types (context) - Coquand, Paulin-Mohring - 1989
BibTeX entry: (Update)
Christine Paulin-Mohring. Inductive definitions in the system Coq: Rules and properties. In Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 328--345, 1993. http://citeseer.ist.psu.edu/paulin-mohring92inductive.html More
@incollection{ paulinmohring93inductive,
author = "Christine Paulin-Mohring",
title = "Inductive Definitions in the System {Coq}: Rules and Properties",
booktitle = "Proceedings 1st Int.\ Conf.\ on Typed Lambda Calculi and Applications, {TLCA}'93, Utrecht, The Netherlands, 16--18 March 1993",
volume = "664",
publisher = "Springer-Verlag",
address = "Berlin",
editor = "M. Bezem and J. F. Groote",
pages = "328--345",
year = "1993",
url = "citeseer.ist.psu.edu/paulin-mohring92inductive.html" }
Citations (may not include all citations):505 Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable - 1986
382 Lambda calculi with types - Barendregt - 1991
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
79 Pattern matching with dependent types (context) - Coquand
73 Inductively defined types (context) - Coquand, Paulin-Mohring - 1990
64 Metamathematical investigations of a Calculus of Constructio.. (context) - Coquand - 1990
53 Automatic synthesis of typed -programs on term algebras (context) - Bohm, Berarducci - 1985
39 A modular proof of strong normalization for the Calculus of .. (context) - Geuvers, Nederhof - 1989
37 The Coq Proof Assistant User's Guide Version (context) - Dowek - 1991
31 s programs from proofs in the Calculus of Constructions (context) - Paulin-Mohring - 1989
26 Extraction de programmes dans le Calcul des Constructions (context) - Paulin-Mohring - 1989
25 Inductively defined types in the Calculus of Constructions (context) - Pfenning, Paulin-Mohring - 1990
23 The new implementation of ALF (context) - Magnusson
23 Recursive types and type constraints in second order lambda-.. (context) - Mendler - 1987
18 Partial objects in the calculus of constructions - Audebaud - 1991
10 Comparing integrated and external logics of functional progr.. (context) - Dybjer - 1990
6 the representation of data in lambda-calculus (context) - Parigot - 1989
5 Extension du Calcul des Constructions par Points fixes (context) - Audebaud - 1992
4 A normalization proof for an impredicative type system with .. (context) - Werner
2 Type systems for Higher Order Logic (context) - Geuvers - 1990
2 Rapport technique INRIA (context) - ed, of et al. - 1989
1 Lego proof development syste : User's manual (context) - Luo, Pollack - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.ens-lyon.fr.html): More
Un Calcul De Constructions Infinies Et Son Application A La.. - Giménez (1996) (Correct)
Parallel Approximation of Optimization Problems.. - Bovet, Clementi.. (Correct)
MasPar Programming Language (ANSI C compatible MPL) User Guide - Software Version (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