Skip to main content
University of Oxford Department of Computer Science
Search for
Search
Toggle
Main Menu
Home
Study with us
Research
(current)
News
Events
About Us
Student Space
Partner with us
Home
Research
Publications
Fully Complete Minimal PER Models for the Simply Typed λ−calculus
Fully Complete Minimal PER Models for the Simply Typed λ−calculus
S. Abramsky and M. Lenisa
Book Title
CSL 2001 Conference Proceedings
Pages
442−457
Series
Springer LNCS
Volume
2142
Year
2001
Links
BibTeX
Download (ps)
See Also
Samson Abramsky
Algorithms and Complexity Theory
Artificial Intelligence and Machine Learning
Automated Verification
Computational Biology and Health Informatics
Data, Knowledge and Action
Human Centred Computing
Programming Languages
Quantum
Security
Systems
Back to Top