Polymorphic lambda calculus: the Church-Rosser property

Koletsos, G

dc.contributor.author	Koletsos, G	en
dc.date.accessioned	2014-03-01T01:08:29Z
dc.date.available	2014-03-01T01:08:29Z
dc.date.issued	1991	en
dc.identifier.issn	0304-3975	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10527
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0026106796&partnerID=40&md5=d0de83ef2ba549d79f5b2257325b0c72	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Computer Programming Languages - Theory	en
dc.subject.other	Church-Rossen Property	en
dc.subject.other	Lambda Calculus	en
dc.subject.other	Polymorphism	en
dc.subject.other	Computer Metatheory	en
dc.title	Polymorphic lambda calculus: the Church-Rosser property	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1991	en
heal.abstract	We give a proof of the Church-Rosser property for polymorphic lambda calculus using the notion of ""candidat de monovalence"". The proof is inspired from Girard's proof of the normalizability for the same calculus. © 1991.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Theoretical Computer Science	en
dc.identifier.isi	ISI:A1991FC64800007	en
dc.identifier.volume	79	en
dc.identifier.issue	2	en
dc.identifier.spage	365	en
dc.identifier.epage	371	en