Type Checking, Universe Polymorphism, and Typical Ambiguity in the Calculus of Constructions Draft

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-50940-2_39
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Core Calculus for Scala Type Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Induction Principles Formalized in the Calculus of Constructions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1987English

On Lists and Other Abstract Data Types in the Calculus of Constructions

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2000English

Proof-Irrelevance Out of Excluded-Middle and Choice in the Calculus of Constructions

Journal of Functional Programming
Software
1996English

A New Elimination Rule for the Calculus of Inductive Constructions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Underapproximation for Model-Checking Based on Random Cryptographic Constructions

English

Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1999English

PIC2LNT: Model Transformation for Model Checking an Applied Pi-Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy