article

The calculus of constructions

Authors:

Thierry Coquand,

Gerard HuetAuthors Info & Claims

Information and Computation, Volume 76, Issue 2-3

Pages 95 - 120

https://doi.org/10.1016/0890-5401(88)90005-3

Published: 01 February 1988 Publication History

Abstract

No abstract available.

Cited By

View all

Poiret JGilbert GMaillard KPédrot PSozeau MTabareau NTanter É(2025)All Your Base Are Belong to Us: Sort Polymorphism for Proof AssistantsProceedings of the ACM on Programming Languages10.1145/37049129:POPL(2253-2281)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704912
Leißa RUllrich MMeyer JHack S(2025)MimIR: An Extensible and Type-Safe Intermediate Representation for the DSL AgeProceedings of the ACM on Programming Languages10.1145/37048409:POPL(95-125)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704840
Liesnikov BCockx J(2024)Building a Correct-by-Construction Type Checker for a Dependently Typed Core LanguageProgramming Languages and Systems10.1007/978-981-97-8943-6_4(63-83)Online publication date: 23-Oct-2024
https://dl.acm.org/doi/10.1007/978-981-97-8943-6_4
Show More Cited By

Index Terms

The calculus of constructions
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Data types and structures
2. Theory of computation

Recommendations

Coercive subtyping for the calculus of constructions
POPL '03: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

We present a coercive subtyping system for the calculus of constructions. The proposed system λC^COover≤ is obtained essentially by adding coercions and η-conversion to λC_≤[10], which is a subtyping extension to the calculus of constructions without ...
Coercive subtyping for the calculus of constructions

We present a coercive subtyping system for the calculus of constructions. The proposed system λC^COover≤ is obtained essentially by adding coercions and η-conversion to λC_≤[10], which is a subtyping extension to the calculus of constructions without ...
Typed closure conversion for the calculus of constructions
PLDI '18

Dependently typed languages such as Coq are used to specify and verify the full functional correctness of source programs. Type-preserving compilation can be used to preserve these specifications and proofs of correctness through compilation into the ...

Comments

Information & Contributors

Information

Published In

Information and Computation Volume 76, Issue 2-3

Semantics of Data Types

February/March 1988

252 pages

ISSN:0890-5401

Editor:
Albert R. Meyer

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 February 1988

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

263
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Poiret JGilbert GMaillard KPédrot PSozeau MTabareau NTanter É(2025)All Your Base Are Belong to Us: Sort Polymorphism for Proof AssistantsProceedings of the ACM on Programming Languages10.1145/37049129:POPL(2253-2281)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704912
Leißa RUllrich MMeyer JHack S(2025)MimIR: An Extensible and Type-Safe Intermediate Representation for the DSL AgeProceedings of the ACM on Programming Languages10.1145/37048409:POPL(95-125)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704840
Liesnikov BCockx J(2024)Building a Correct-by-Construction Type Checker for a Dependently Typed Core LanguageProgramming Languages and Systems10.1007/978-981-97-8943-6_4(63-83)Online publication date: 23-Oct-2024
https://dl.acm.org/doi/10.1007/978-981-97-8943-6_4
Granberry GAhrendt WJohansson M(2024)Towards Integrating Copiloting and Formal MethodsLeveraging Applications of Formal Methods, Verification and Validation. Specification and Verification10.1007/978-3-031-75380-0_9(144-158)Online publication date: 27-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-75380-0_9
Cohen CCrance EMahboubi A(2024)Trocq: Proof Transfer for Free, With or Without UnivalenceProgramming Languages and Systems10.1007/978-3-031-57262-3_10(239-268)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57262-3_10
Huang YYallop J(2023)Defunctionalization with Dependent TypesProceedings of the ACM on Programming Languages10.1145/35912417:PLDI(516-538)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591241
Gollamudi AChong SRanise SCarbone RTakabi D(2023)Expressive Authorization Policies using Computation PrincipalsProceedings of the 28th ACM Symposium on Access Control Models and Technologies10.1145/3589608.3593834(107-119)Online publication date: 24-May-2023
https://dl.acm.org/doi/10.1145/3589608.3593834
Pujet LTabareau N(2023)Impredicative Observational EqualityProceedings of the ACM on Programming Languages10.1145/35717397:POPL(2171-2196)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571739
Abreu PDelaware BHubers AJenkins CMorris JStump A(2023)A Type-Based Approach to Divide-and-Conquer Recursion in CoqProceedings of the ACM on Programming Languages10.1145/35711967:POPL(61-90)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571196
Cristiá MDe Luca GLuna C(2023)An Automatically Verified Prototype of the Android Permissions SystemJournal of Automated Reasoning10.1007/s10817-023-09666-267:2Online publication date: 12-May-2023
https://dl.acm.org/doi/10.1007/s10817-023-09666-2
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Coercive subtyping for the calculus of constructions

Coercive subtyping for the calculus of constructions

Typed closure conversion for the calculus of constructions

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations