Languages that capture complexity classes
SIAM Journal on Computing
Expressibility and parallel complexity
SIAM Journal on Computing
A theory of binding structures and applications to rewriting
Theoretical Computer Science
A calculus for overloaded functions with subtyping
Information and Computation
A recursive introduction to the theory of computation
A recursive introduction to the theory of computation
Enriching the lambda calculus with contexts: toward a theory of incremental program construction
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Object-oriented programming: a unified foundation
Object-oriented programming: a unified foundation
LOGSPACE and PTIME characterized by programming languages
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
A Theory of Objects
Smalltalk-80: The Language
A lambda calculus of objects and method specialization
Nordic Journal of Computing
A Lambda Calculus of Incomplete Objects
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
A Typed Lambda Calculus of Objects (Extended Abstract)
ASIAN '96 Proceedings of the Second Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security
A New Parallel Vector Model, with Exact Characterization of NC^k
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Subtyping Constraints for Incomplete Objects (Extended Abstract)
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A GRAPH MODEL FOR PARALLEL COMPUTATIONS
A GRAPH MODEL FOR PARALLEL COMPUTATIONS
VAL- ORIENTED ALGORITHMIC LANGUAGE, PRELIMINARY REFERENCE MANUAL
VAL- ORIENTED ALGORITHMIC LANGUAGE, PRELIMINARY REFERENCE MANUAL
Computation: finite and infinite machines
Computation: finite and infinite machines
Hi-index | 0.00 |
This paper presents a new model of computation that differs from prior models in that it emphasizes data over flow control, has no named variables and has an object-oriented flavor. We prove that this model is a complete and confluent acceptable programming system and has a usable type theory. A new data synchronization primitive is introduced in order to achieve the above properties. Subtle variations of the model are shown to fall short of having all these necessary properties.