| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Ghilezan, Silvia | en_US |
| dc.date.accessioned | 2023-10-10T08:41:40Z | - |
| dc.date.available | 2023-10-10T08:41:40Z | - |
| dc.date.issued | 1996 | - |
| dc.identifier.issn | 1430-189X | - |
| dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/5161 | - |
| dc.description.abstract | The strong normalization property of the intersection type assignment system is used in order to prove the finiteness οί developments property of the untyped lambda calculus in [6]. Similarly, the strong normalization property of the simply typed lambda calculus can be used for the same reason. We extend both of these methods in order to prove the generalized finiteness of developments. | en_US |
| dc.publisher | Institut für Informatik, Justus-Liebig-Universität Giessen, Germany | en_US |
| dc.relation.ispartof | Journal of Automata, Languages and Combinatorics | en_US |
| dc.subject | reduction | lambda calculus | en_US |
| dc.title | Generalized finiteness of developments | en_US |
| dc.type | Article | en_US |
| dc.identifier.doi | 10.25596/jalc-1996-247 | - |
| dc.relation.firstpage | 247 | - |
| dc.relation.lastpage | 257 | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| item.openairetype | Article | - |
| item.cerifentitytype | Publications | - |
| item.fulltext | No Fulltext | - |
| item.grantfulltext | none | - |
| crisitem.author.orcid | 0000-0003-2253-8285 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.