Observable algorithms on concrete data structures
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Sequentiality and strong stabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Observable sequentiality and full abstractionPublished by Association for Computing Machinery (ACM) ,1992
- The theory and practice of first-class promptsPublished by Association for Computing Machinery (ACM) ,1988
- Sequential algorithms on concrete data structuresTheoretical Computer Science, 1982
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977