A Distributed Connectionist Representation for Concept Structures. (1998)
Touretzky, David S., Geva, Shai
We describe a representation for frame-like concept structures in a neural network called DUCS. Slot names and slot fillers are diffuse patterns of activation spread over a collection of units. Our...
Sequential Functions on Indexed Domains and Full Abstraction for a Sub-Language of PCF, (1998)
We present a general semantic framework of sequential functions on domains equipped with a parameterized notion of incremental sequential computation. Under the simplifying assumption that...
Sequential Functions on Indexed Domains and Full Abstraction for a Sub-language of PCF (1993)
ion for a Sub-language of PCF Stephen Brookes Shai Geva April 1993 CMU-CS-93-163 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 To appear in Proceedings of Mathematical...
Stable and Sequential Functions on Scott domains (1992)
The search for a general semantic characterization of sequential functions is motivated by the full abstraction problem for sequential programming languages such as PCF. We present here some new...
Towards a Theory of Parallel Algorithms on Concrete Data Structures (1992)
Building on Kahn and Plotkin's theory of concrete data structures and sequential functions, Berry and Curien defined an intensional model of sequential algorithms between concrete data structures. In...
Continuous Functions and Parallel Algorithms on Concrete Data Structures (1992)
We report progress in two closely related lines of research: the semantic study of sequentiality and parallelism, and the development of a theory of intensional semantics. We generalize Kahn and...
Computational Comonads and Intensional Semantics (1992)
We explore some foundational issues in the development of a theory of intensional semantics. A programming language may be given a variety of semantics, differing in the level of abstraction; one...
A Cartesian Closed Category of Parallel Algorithms between Scott Domains (1992)
We present a category-theoretic framework for providing intensional semantics of programming languages and establishing connections between semantics given at different levels of intensional detail....