论文信息 - Data Types as Lattices: Retractions, Closures and Projections

Data Types as Lattices: Retractions, Closures and Projections

Abstract : This paper presents the mathematical principles of lattice theory oriented toward the theory of computation. Notions like representations, retraction, projection, and closure have been previously developed, but the connections between them have not been shown elsewhere. Attempted is a systematic treatment of this lattice theory that involves the definition of data structures. (Author)

Luis E. Sanchis

[1] C. J. Everett. Closure operators and Galois theory in lattices , 1944 .

[2] John C. Reynolds,et al. Towards a theory of type structure , 1974, Symposium on Programming.

[3] Peter Crawley. The isomorphism theorem in compactly generated lattices , 1959 .

[4] Dana S. Scott,et al. Data Types as Lattices , 1976, SIAM J. Comput..

[5] John C. Reynolds,et al. On the Relation between Direct and Continuation Semantics , 1974, ICALP.