On the expressive power of first-order boolean functions in PCF
Theoretical Computer Science
Relative definability of boolean functions via hypergraphs
Theoretical Computer Science
Universal homogeneous graph-like structures and domains
Mathematical Structures in Computer Science
Turing machines, transition systems, and interaction
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Information and Computation
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantically linear programming languages
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Turing machines, transition systems, and interaction
Information and Computation
Information and Computation
Non-uniform (hyper/multi)coherence spaces
Mathematical Structures in Computer Science
Bi-models: Relational Versus Domain-theoretic Approaches
Fundamenta Informaticae
| Hi-index | 0.00 |