Concrete Domains

Concrete Domains (1993)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Gilles Kahn , Inria Sophia Antipolis , Gordon D. Plotkin , George Gratzer

Venue:	Theoretical Computer Science
Citations:	32 - 1 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Concrete Domains	user correction - Legacy Corrections
AUTHOR NAME	Gilles Kahn	SVM HeaderParse 0.1
AUTHOR AFFIL	University of Edinburgh	SVM HeaderParse 0.2
AUTHOR NAME	Inria Sophia Antipolis	SVM HeaderParse 0.1
AUTHOR AFFIL	University of Edinburgh	SVM HeaderParse 0.2
AUTHOR NAME	Gordon D. Plotkin	SVM HeaderParse 0.1
AUTHOR AFFIL	University of Edinburgh	SVM HeaderParse 0.2
AUTHOR NAME	George Gratzer	SVM HeaderParse 0.1
ABSTRACT	This paper introduces the theory of a particular kind of computation domains called concrete domains. The purpose of this theory is to find a satisfactory framework for the notions of coroutine computation and sequentiality of evaluation. Diagrams are emphasized because I believe that an important part of learning lattice theory is the acquisition of skill in drawing diagrams. George Gratzer 1 Domains of computation In general, we follow Scott's approach [Sco70]. To every syntactic object one associates a semantic object which is found in an appropriate semantic domain. For technical details, we follow [Mil73] and [Plo78] rather than Scott. Definition 1.1 A partial order is a pair ! D; ? where D is a non-empty set and is a binary relation satisfying: i) 8x 2 D x x (reflexivity) ii) 8x; y 2 D x y; y x ) x = y (antisymmetry) iii) 8x; y; z 2 D x y; y z ) x z (transitivity) One writes x ! y when x y and x 6= y. Two elements x and y are comparable when either x y or y x. W...	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE	Theoretical Computer Science	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	121--1	INFERENCE
VOLUME	121	INFERENCE
CITATIONS	11 found	ParsCit 1.0