An Implementation of Type: Type

Authors:
Thierry Coquand;Makoto Takeyama
Affiliations:
-;-
Venue:
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Year:
2000

Citing 4
Cited 2

Semantics for classical AUTOMATH and related systems

Information and Control
Checking algorithms for pure type systems

TYPES '93 Proceedings of the international workshop on Types for proofs and programs
An algorithm for type-checking dependent types

Science of Computer Programming - Special issue on mathematics of program construction
Cayenne—a language with dependent types

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming

A Tutorial Implementation of a Dependently Typed Lambda Calculus

Fundamenta Informaticae - Dependently Typed Programming
A Partial Type Checking Algorithm for Type: Type

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a denotational semantics of a type system with dependent types, where types are interpreted as finitary projections. We prove then the correctness of a type-checking algorithm w.r.t. this semantics. In this way, we can justify some simple optimisation in this algorithm. We then sketch how to extend this semantics to allow a simple record mechanism with manifest fields.