Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/14342
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dezani-Ciancaglini M. | en_US |
dc.contributor.author | Gilezan, Silvia | en_US |
dc.date.accessioned | 2020-03-03T14:55:49Z | - |
dc.date.available | 2020-03-03T14:55:49Z | - |
dc.date.issued | 2003-12-01 | - |
dc.identifier.issn | 3029743 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/14342 | - |
dc.description.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. © Springer-Verlag Berlin Heidelberg 2003. | en_US |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_US |
dc.title | Two behavioural lambda models | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.scopus | 2-s2.0-21144459051 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/21144459051 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 147 | en_US |
dc.relation.firstpage | 127 | en_US |
dc.relation.volume | 2646 | en_US |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Departman za opšte discipline u tehnici | - |
crisitem.author.orcid | 0000-0003-2253-8285 | - |
crisitem.author.parentorg | Fakultet tehničkih nauka | - |
Appears in Collections: | FTN Publikacije/Publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.