Towards a practical programming language based on dependent type theory
Doktorsavhandling, 2007

Dependent type theories have a long history of being used for theorem proving. One aspect of type theory which makes it very powerful as a proof language is that it mixes deduction with computation. This also makes type theory a good candidate for programming---the strength of the type system allows properties of programs to be stated and established, and the computational properties provide semantics for the programs. This thesis is concerned with bridging the gap between the theoretical presentations of type theory and the requirements on a practical programming language. Although there are many challenging research problems left to solve before we have an industrial scale programming language based on type theory, this thesis takes us a good step along the way.

dependent types

type theory

metavariables

programming

pattern matching

type checking

EC
Opponent: Conor McBride

Författare

Ulf Norell

Chalmers, Data- och informationsteknik, Datavetenskap

Connecting a Logical Framework to a First-Order Logic Prover.

FroCos 2005,; (2005)p. 285-301

Paper i proceeding

Ämneskategorier

Datavetenskap (datalogi)

ISBN

978-91-7291-996-9

Technical report D - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University: 33

Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie: 2677

EC

Opponent: Conor McBride