|Title:||Two behavioural lambda models||Journal:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||Volume:||2646||First page:||127||Last page:||147||Conference:||International Workshop on Types for Proofs and Programs, TYPES 2002||Issue Date:||1-Dec-2003||ISBN:||978-3-540-14031-3||ISSN:||0302-9743||DOI:||10.1007/3-540-39185-1_8||Abstract:||
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 by using the finitary logical description of the models obtained by defining suitable intersection type assignment systems.
|Publisher:||Springer Link||Project:||FET - Global Computing initiative, project DART ST-2001-3347
“Representation of proofs with applications, clas-sification of structures and infinite combinatorics” (of the Ministry of Science, Tech-nology, and Development of Serbia), grant 1630
Show full item record
checked on Nov 26, 2022
checked on Nov 27, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.