The Completeness of Typing for Context-Semantics

Authors:
Thierry Coquand
Affiliations:
Department of Computer Science, Chalmers University of Technology, Göteborg, Sweden. E-mail: coquand@cs.chalmers.se
Venue:
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Year:
2007

Citing 3
Cited 1

Basic simple type theory

Basic simple type theory
Towards a theory of type structure

Programming Symposium, Proceedings Colloque sur la Programmation
A finitary subsystem of the polymorphic λ-calculus

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

Preface

Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a variation of Hindley's completeness theorem for simply typed λ-calculus. It is based on a Kripke semantics where the worlds are contexts, called context-semantics. This variation was obtained indirectly by simplifying an analysis of a fragment of polymorphic λ-calculus [2]. We relate in this way works done in proof theory [4,14] with a fundamental result in λ-calculus.