| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9655872 | Electronic Notes in Theoretical Computer Science | 2005 | 14 Pages |
Abstract
In this paper, we presents a comfortable fully typed lambda calculus based on the well-known intersection type system discipline where proof are not only feasible but easy; the present system is the counterpart à la Church of the type assignment system as invented by Coppo and Dezani.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Luigi Liquori, Simona Ronchi della Rocca,