Parameters in Pure Type Systems

Authors:
Roel Bloo;Fairouz Kamareddine;Twan Laan;Rob Nederpelt
Affiliations:
-;-;-;-
Venue:
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Year:
2002

Citing 5
Cited 2

Lambda calculi with types

Handbook of logic in computer science (vol. 2)
The Barendregt cube with definitions and generalised reduction

Information and Computation
Modal Pure Type Systems

Journal of Logic, Language and Information
Pure Type Systems with Definitions

LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Refining the Barendregt Cube Using Parameters

FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming

One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations

WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Holes with binding power

TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the addition of parameters to typed ?-calculus with definitions. We show that the resulting systems have nice properties and illustrate that parameters allow for a better fine-tuning of the strength of type systems as well as staying closer to type systems used in practice in theorem provers and programming languages.