Sequential algorithms on concrete data structures
Authors:
- G. BerryGBG. Berry
- P.L. CurienPCP.L. Curien
- 1 July 1982
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 20 (3) , 265-321
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Petri nets, event structures and domains, part ITheoretical Computer Science, 1981
- Minimal and Optimal Computations of Recursive ProgramsJournal of the ACM, 1979
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-CalculusSIAM Journal on Computing, 1976
- An algebraic interpretation of the λβK-calculus; and an application of a labelled λ-calculusTheoretical Computer Science, 1976