P. Coppola and Simona Ronchi Della Rocca
Principal Typing in Elementary Affine
Logic
In Martin Hofmann, editor, Typed Lambda Calculi and
Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June
10-12, 2003, Proceedings, volume 2701 of Lecture Notes in Computer
Science, pages 90-104 Springer, 2003
Elementary Affine Logic (EAL) is a variant of the
Linear Logic
characterizing the computational power of the elementary bounded
Turing machines. The EAL Type Inference problem is the problem of
automatically assign to terms of lambda-calculus EAL formulas
as
types. This problem is proved to be decidable, and an algorithm
is
showed, building, for every lambda-term, either a negative
answer or
a finite set of type schemata, from which all and only
its typings
can be derived, through suitable operations
[ bib |
.pdf ]
Back
This file has been generated by
bibtex2html 1.43