Non-Determinism in a Functional Setting (Extended Abstract)

Non-Determinism in a Functional Setting (Extended Abstract) (1993)

Cached

Download Links

[ftp.comlab.ox.ac.uk]

by C.-H. Luke Ong

Venue:	In Proceedings 8th LICS
Citations:	2 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Non-Determinism in a Functional Setting (Extended Abstract)	user correction - Legacy Corrections
AUTHOR NAME	C.-H. Luke Ong	user correction - Legacy Corrections
AUTHOR AFFIL	; Computer Laboratory, University of Cambridge,; and; discs, National University of Singapore.	user correction - Legacy Corrections
AUTHOR ADDR	; Pembroke Street, CB2 3QG England.	user correction - Legacy Corrections
ABSTRACT	) C.-H. Luke Ong Computer Laboratory, University of Cambridge, Pembroke Street, CB2 3QG England. Email: Luke.Ong@cl.cam.ac.uk and discs, National University of Singapore. Abstract The pure untyped Lambda Calculus augmented with an (erratic) choice operator is considered as an idealised non-deterministic functional language. Both the "may" and the "must" modalities of convergence are of interest to us. Following Abramsky's work on domain theory in logical form, we identify the denotational type that captures our computational situation: ffi = P[[ffi ! ffi ] ? ] where P[\Gamma] is the Plotkin powerdomain functor. We then carry out a systematic programme which hinges on three distinct interpretations of ffi , namely, process-theoretic, denotational and logical. The main theme of our programme is the complementarity of the various interpretations of ffi . This work may be seen as a step towards a reapprochement between the algebraic theory of processes in Concurrency on the one hand, ...	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE	In Proceedings 8th LICS	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	275--286	INFERENCE
CITATIONS	14 found	ParsCit 1.0