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
The Theory of Strictness Analysis for Higher Order Functions
The Theory of Strictness Analysis for Higher Order Functions
G. Burn‚ C. Hankin and S. Abramsky
Book Title
Programs as Data Objects
Editor
H. Ganzinger and N. Jones
Pages
42−62
Publisher
Springer−Verlag
Year
1986
Links
BibTeX
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