Higher-Order, Linear, Concurrent Constraint Programming

Higher-Order, Linear, Concurrent Constraint Programming (1992)

Cached

Download Links

[www.parc.xerox.com]

by Vijay Saraswat , Patrick Lincoln

Citations:

28 - 5 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Higher-Order, Linear, Concurrent Constraint Programming	user correction - Legacy Corrections
AUTHOR NAME	Vijay Saraswat	user correction - Legacy Corrections
AUTHOR NAME	Patrick Lincoln	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; Stanford University	user correction - Legacy Corrections
AUTHOR ADDR	Stanford Ca 94305	user correction - Legacy Corrections
ABSTRACT	We present a very simple and powerful framework for indeterminate, asynchronous, higher-order computation based on the formula-as-agent and proof-ascomputation interpretation of (higher-order) linear logic [Gir87]. The framework significantly refines and extends the scope of the concurrent constraint programming paradigm [Sar89] in two fundamental ways: (1) by allowing for the consumption of information by agents it permits a direct modelling of (indeterminate) state change in a logical framework, and (2) by admitting simply-typed -terms as dataobjects, it permits the construction, transmission and application of (abstractions of) programs at run-time. Much more dramatically, however, the framework can be seen as presenting higher-order (and if desired, constraint-enriched) versions of a variety of other asynchronous concurrent systems, including the asynchronous ("input guarded") fragment of the (first-order) ß-calculus, Hewitt's actors formalism, (abstract forms of) Gelernter's Lin...	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Technical report, Xerox PARC	INFERENCE
CITATIONS	42 found	ParsCit 1.0