Mathematical Structures in Computer Science
Fast and loose reasoning is morally correct
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proof Methods for Corecursive Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
An Operational Domain-theoretic Treatment of Recursive Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof Methods for Corecursive Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Hi-index | 0.89 |