An Introduction to Dependent Type Theory

Authors:
Gilles Barthe;Thierry Coquand
Affiliations:
-;-
Venue:
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Year:
2000

Citing 86
Cited 3

Constructive mathematics and computer programming

Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Abstract types have existential type

ACM Transactions on Programming Languages and Systems (TOPLAS)
The calculus of constructions

Information and Computation - Semantics of Data Types
Pebble, a kernel language for modules and abstract data types

Information and Computation - Semantics of Data Types
Terminating general recursion

BIT
Proofs and types

Proofs and types
Structural subtyping and the notion of power type

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming in Martin-Lo¨f's type theory: an introduction

Programming in Martin-Lo¨f's type theory: an introduction
Higher-order modules and the phase distinction

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An algorithm for testing conversion in type theory

Logical frameworks
Inductive sets and families in Martin-Lo¨f's type theory and their set-theoretic semantics

Logical frameworks
A framework for defining logics

Journal of the ACM (JACM)
Subtyping recursive types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
On the type structure of standard ML

ACM Transactions on Programming Languages and Systems (TOPLAS)
Typing in pure type systems

Information and Computation
Computation and reasoning: a type theory for computer science

Computation and reasoning: a type theory for computer science
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
Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Haskell: the craft of functional programming

Haskell: the craft of functional programming
Abstract data type systems

Theoretical Computer Science - Special issue: algebraic development techniques
Representing inductively defined sets by wellorderings in Martin-Löf's type theory

Theoretical Computer Science
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PolyP—a polytypic programming language extension

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Eliminating array bound checking through dependent types

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Cayenne—a language with dependent types

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Coinductive axiomatization of recursive type equality and subtyping

Fundamenta Informaticae - Special issue: typed lambda-calculi and applications, selected papers
Type inference for pure type systems

Information and Computation
Dependent types in practical programming

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The functional approach to programming

The functional approach to programming
A new approach to generic functional programming

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource bound certification

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deciding type equivalence in a language with singleton kinds

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for expressive security policies

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The inductive approach to verifying cryptographic protocols

Journal of Computer Security
The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for certified binaries

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional logic overloading

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient and flexible matching of recursive types

Information and Computation
Inductive-data-type systems

Theoretical Computer Science - Special issue on theories of types and proofs
A dependently typed assembly language

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Cost recurrences for DML programs

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Using dependent types to express modular structure

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
ML For the Working Programmer

ML For the Working Programmer
The Definition of Standard ML

The Definition of Standard ML
The Definition of Standard ML

The Definition of Standard ML
A compiled implementation of strong reduction

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Introduction to Functional Programming

Introduction to Functional Programming
Type Classes with Functional Dependencies

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Inductively Defined Types in the Calculus of Constructions

Proceedings of the 5th International Conference on Mathematical Foundations of Programming Semantics
The Semi-Full Closure of Pure Type Systems

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Dead Code Elimination through Dependent Types

PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Sets in Types, Types in Sets

TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Inductive Definitions in the system Coq - Rules and Properties

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Simplification of Girard's Paradox

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Structural Recursive Definitions in Type Theory

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Polytypic Proof Construction

TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Dependently Typed Records for Representing Mathematical Structure

TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
On Relating Type Theories and Set Theories

TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
Analysis of a Guard Condition in Type Theory (Extended Abstract)

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Efficient Type Matching

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Inductive Definitions and Type Theory: an Introduction (Preliminary Version)

Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Generic Programming within Dependently Typed Programming

Proceedings of the IFIP TC2/WG2.1 Working Conference on Generic Programming
Sound and Complete Elimination of Singleton Kinds

TIC '00 Selected papers from the Third International Workshop on Types in Compilation
Towards a Mechanization of Cryptographic Protocal Verification

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Safe Proof Checking in Type Theory with Y

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Interactive Programs in Dependent Type Theory

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Elf: A Meta-Language for Deductive Systems (System Descrition)

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Inductively defined types

COLOG '88 Proceedings of the International Conference on Computer Logic
Subtyping with Singleton Types

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Logical frameworks

Handbook of automated reasoning
Proof-assistants using dependent type systems

Handbook of automated reasoning
Efficient Representation and Validation of Proofs

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Impredicative Strong Existential Equivalent to Type:Type

Impredicative Strong Existential Equivalent to Type:Type
TYPECHECKING IS UNDECIDABLE WHEN ''TYPE'' IS A TYPE

TYPECHECKING IS UNDECIDABLE WHEN ''TYPE'' IS A TYPE
Dependent types in practical programming

Dependent types in practical programming
Type-based termination of recursive definitions

Mathematical Structures in Computer Science
A modular module system

Journal of Functional Programming
Domain-free pure type systems

Journal of Functional Programming
Faking it Simulating dependent types in Haskell

Journal of Functional Programming
A predicative analysis of structural recursion

Journal of Functional Programming
Type-checking injective pure type systems

Journal of Functional Programming
Remarks on the equational theory of non-normalizing pure type systems

Journal of Functional Programming
Induction is not derivable in second order dependent type theory

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
The implicit calculus of constructions: extending pure type systems with an intersection type binder and subtyping

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications

Pure patterns type systems

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Descriptor-free representation of arrays with dependent types

IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
J-Calc: A Typed Lambda Calculus for Intuitionistic Justification Logic

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional programming languages often feature mechanisms that involve complex computations at the level of types. These mechanisms can be analyzed uniformly in the framework of dependent types, in which types may depend on values. The purpose of this chapter is to give some background for such an analysis.We present here precise theorems, that should hopefully help the reader to understand to which extent statements like "introducing dependent types in a programming language implies that type checking is undecidable", are justified.