Type Theory Should Eat Itself

Authors:
James Chapman
Affiliations:
School of Computer Science, University of Nottingham, Jubilee Campus, Nottingham, NG8 1BB, England
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 8
Cited 7

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

Logical frameworks
Semantics of type theory: correctness, completeness, and independence results

Semantics of type theory: correctness, completeness, and independence results
Internal Type Theory

TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Indexed Induction-Recursion

PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Towards Formalizing Categorical Models of Type Theory in Type Theory

Electronic Notes in Theoretical Computer Science (ENTCS)
Big-step normalisation

Journal of Functional Programming
A formalisation of a dependently typed language as an inductive-recursive family

TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Tait in one big step

MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming

Outrageous but meaningful coincidences: dependent type-safe syntax and evaluation

Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Inductive-inductive definitions

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A categorical semantics for inductive-inductive definitions

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Strongly Typed Term Representations in Coq

Journal of Automated Reasoning
Embedding F

Proceedings of the 8th ACM SIGPLAN workshop on Generic programming
Typed syntactic meta-programming

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Fibred Data Types

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper I present a partial formalisation of a normaliser for type theory in Agda [Ulf Norell. Agda 2, 2007. http://www.cs.chalmers.se/~ulfn/]; extending previous work on big-step normalisation [Thorsten Altenkirch and James Chapman. Big-Step Normalisation. Journal of Functional Programming, 2008. Special Issue on Mathematically Structured Functional Programming. To appear, Thorsten Altenkirch and James Chapman. Tait in one big step. In Workshop on Mathematically Structured Functional Programming, MSFP 2006, Kuressaare, Estonia, July 2, 2006, electronic Workshop in Computing (eWiC), Kuressaare, Estonia, 2006. The British Computer Society (BCS)]. The normaliser in written as an environment machine. Only the computational behaviour of the normaliser is presented omitting details of termination.