WANT A PROFILE LIKE THIS?
Create my FREE Plan Or learn about other options
Lee Naish
PeerJ Author
240 Points

Contributions by role

Author 135
Preprint Author 105

Contributions by subject area

Programming Languages
Data Mining and Machine Learning
Theory and Formal Methods

Lee Naish

PeerJ Author

Summary

Lee Naish completed his PhD at The University of Melbourne in 1985 and continued there as an academic. His main research has been attempting to clarify the relationships between what we want a computer to do, the programs we write, and what they make a computer do: debugging, verification, programming languages and semantics. Other interests include set similarity and its use in spectral debugging. In December 2014 he was diagnosed with terminal prostate cancer.

Programming Languages Software Engineering Theory & Formal Methods

Work details

Senior Fellow

The University of Melbourne
Computing and Information Systems

Websites

  • Home page

PeerJ Contributions

  • Articles 1
  • Preprints 2
  • Questions 3
  • Answers 2
September 2, 2015
Sharing analysis in the Pawns compiler
Lee Naish
https://doi.org/10.7717/peerj-cs.22
February 5, 2016 - Version: 1
Similarity to a single set
Lee Naish
https://doi.org/10.7287/peerj.preprints.1713v1
June 25, 2015 - Version: 2
Sharing analysis in the Pawns compiler
Lee Naish
https://doi.org/10.7287/peerj.preprints.907v2

3 Questions

0
See Q&A on previous paragraph.
about Sharing analysis in the Pawns compiler
0
The empty path was used in earlier versions, is that still the case?
about Sharing analysis in the Pawns compiler
0
Are the different "abstract" variables only distinguished by their type?
about Sharing analysis in the Pawns compiler

2 Answers

0
accepted The empty path was used in earlier versions, is that still the case?
0
accepted Are the different "abstract" variables only distinguished by their type?