DC FieldValueLanguage
dc.contributor.authorGhilezan, Silviaen_US
dc.date.accessioned2023-10-10T07:58:21Z-
dc.date.available2023-10-10T07:58:21Z-
dc.date.issued1999-
dc.identifier.issn2406-2014-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/5157-
dc.description.abstractTwo different formulations of the simply typed lambda calculus: the natural deduction and the sequent system, are considered. An analogue of cut elimination is proved for the sequent lambda calculus.en_US
dc.relation.ispartofNovi Sad Journal of Mathematicsen_US
dc.titleNatural deduction and sequent typed lambda calculusen_US
dc.typeArticleen_US
dc.identifier.urlhttps://www.emis.de/journals/NSJOM/Papers/29_2/NSJOM_29_2_209_220.pdf-
dc.relation.firstpage209-
dc.relation.lastpage220-
dc.relation.issue2-
dc.relation.volume29-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-2253-8285-
Show simple item record

Page view(s)

16
checked on Apr 24, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.