City Research Online - From exponential to polynomial-time security typing via principal types

From exponential to polynomial-time security typing via principal types

Hunt, S. & Sands, D. (2011). From exponential to polynomial-time security typing via principal types. In: Lecture Notes in Computer Science. European Symposium on Programming, 26 March 2011 - 3 Apr 2011, Saarbrücken, Germany.

Publication Type:	Conference or Workshop Item (Paper)
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments:	School of Science & Technology > Computer Science > Software Reliability School of Science & Technology > Computer Science

Preview

PDF
Download (252kB) | Preview

Export

Downloads

Downloads per month over past year

View more statistics

Metadata

Altmetric

CORE (COnnecting REpositories)

Actions (login required)

Admin Login

Creators:	Hunt, S. Sands, D.
Event Title:	European Symposium on Programming
Event Type:	Conference
Event Location:	Saarbrücken, Germany
Event Dates:	26 March 2011 - 3 Apr 2011
Status:	Published
Refereed:	Yes
Journal or Publication Title:	Lecture Notes in Computer Science
Publisher:	Springer
ISSN:	0302-9743
URI:	https://openaccess.city.ac.uk/id/eprint/199
Date available in CRO:	14 Sep 2011 13:12
Dates:	Date Event 2011 Submitted