Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
Decidable Properties of Monadic Functional Schemas
Journal of the ACM (JACM)
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Communications of the ACM
The denotational semantics of programming languages
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Inductive methods for proving properties of programs
Communications of the ACM
Simple Program Schemes and Formal Languages
Simple Program Schemes and Formal Languages
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
A Theory of Programming Language Semantics
A Theory of Programming Language Semantics
Partially-Additive Monoids, Graph-Growing, and the Algebraic Semantics of Recursive Calls
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Formal models for some features of programming languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Precise typing of abstract data type specifications
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Combinatory foundation of functional programming
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
The programming language MINO and its formal definition
ACM SIGPLAN Notices
Labelled Markov Processes as Generalised Stochastic Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a geometry of recursion
Theoretical Computer Science
| Hi-index | 0.01 |