Type Theory with First-Order Data Types and Size-Change Termination
Licentiate thesis, 2004

We prove normalization for a dependently typed lambda-calculus extended with first-order data types and computation schemata for first-order size-change terminating recursive functions. Size-change termination, introduced by C.S. Lee, N.D. Jones and A.M. Ben-Amram, can be seen as a generalized form of structural induction, which allows inductive computations and proofs to be defined in a straight-forward manner. The language can be used as a proof system---an extension of Martin-Löf's Logical Framework.

Pattern-matching

Reducibility

Size-Change Termination

Logical Framework

Lambda-calculus

Term rewriting.

Type Theory

Dependent types

Normalization

Type system


Author

David Wahlstedt

Chalmers, Department of Computing Science, Programming Logic

Other publications Research

Subject Categories (SSIF 2011)

Computer Science

Technical report L - School of Computer Science and Engineering, Chalmers University of Technology: 36

More information

Created

10/8/2017

Feedback and support

If you have questions, need help, find a bug or just want to give us feedback you may use this form, or contact us per e-mail research.lib@chalmers.se.

About

Research.chalmers.se contains research information from Chalmers University of Technology, Sweden. It includes information on projects, publications, research funders and collaborations.

More about coverage period and what is publicly available

Privacy and cookies

Accessibility

Citation Style Language
citeproc-js (Frank Bennett)

Links

Chalmers Library
Chalmers Research
Chalmers Student Theses

Chalmers University of Technology

SE-412 96 GOTHENBURG, SWEDEN
PHONE: +46 (0)31-772 10 00
WWW.CHALMERS.SE