Lambda Models Characterizing Computational Behaviours of Terms

A Lambda Model Characterizing Computational Behaviours of Terms

We build a lambda model which characterizes completely (persistently) normalizing, (persistently) head normalizing, and (persistently) weak head normalizing terms.

A type assignment for lambda-calculus complete both for FPTIME and strong normalization

One of the aims of Implicit Computational Complexity is the design of programming languages with bounded computational complexity; indeed, guaranteeing and certifying a limited resources usage is of central importance for various aspects of computer science. One of the more promising approaches to this aim is based on the use of lambda-calculus as paradigmatic programming language and the desig...

Two Behavioural Lambda Models

We build two inverse limit lambda models which characterize completely sets of terms having similar computational behaviour. More precisely for each one of these sets of terms there is a corresponding element in at least one of the two models such that a term belongs to the set if and only if its interpretation (in a suitable environment) is greater than or equal to that element. This is proved...

Principal Typing for Lambda Calculus in Elementary Affine Logic

Elementary Affine Logic (EAL) is a variant of Linear Logic characterizing the computational power of the elementary bounded Turing machines. The EAL Type Inference problem is the problem of automatically assigning to terms of λ-calculus EAL formulas as types. This problem, restricted to the propositional fragment of EAL, is proved to be decidable, and an algorithm is shown, building, for every ...

Characterizing the Multiplicative Group of a Real Closed Field in Terms of its Divisible Maximal Subgroup