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.
|Name||Lecture Notes in Computer Science|
|Conference||conference; Cancun, Mexico; 2002-04-03; 2002-04-06|
|Period||3/04/02 → 6/04/02|