We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and ...
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and ...
A feasible algorithm for typing in elementary affine logic. (long version). Technical Report cs.LO/0412028, arXiv, 2004. Available from http://arxiv.org/abs ...
Oct 13, 2016 · Elementary Affine Logic is a type system which captures the class of λ-terms that can be reduced in elementary time. Moreover, EAL-typeable ...
Missing: feasible | Show results with:feasible
We propose a type inference algorithm for lambda terms in elementary affine logic (EAL). The algorithm decorates the syntax tree of a simple typed lambda ...
Missing: feasible | Show results with:feasible
Linear logic (LL) has proved a fruitful logical setting in which computational complexity can be brought into the picture of the proofs-as-programs ...
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and.
A Feasible Algorithm for Typing in Elementary Affine Logic · Optimizing optimal reduction: A type inference algorithm for elementary affine logic · Type inference ...
Kazushige Terui - A feasible algorithm for typing in Elementary ...
researchmap.jp › published_papers
A feasible algorithm for typing in Elementary Affine Logic. Lecture Notes in Computer Science. P. Baillot; ,; K. Terui. Volume: 3461; Number: First page: 55 ...
≡ denotes the syntactical identity between both types and type schemes. In order to define the principal typing, we need a unification algorithm for type ...
Missing: feasible | Show results with:feasible