The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The algebraic theory of recursive program schemes
Proceedings of the Proceedings of the First International Symposium on Category Theory Applied to Computation and Control
Comparison of polynomial-time reducibilities
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
An algebraic description of programs with assertions, verification and simulation
Proceedings of ACM conference on Proving assertions about programs
Efficient compilation of linear recursive programs.
Efficient compilation of linear recursive programs.
Rational algebraic theories and fixed-point solutions
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Classes of functions for computing on binary trees (Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Straight-line program length as a parameter for complexity measures
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Much of the research on semantic theories has concentrated on qualitative properties such as definability (of such programming concepts as recursive procedures), equivalence (of different language constructs), and verifiability (of the correctness, or consistency, of one expression relative to another). Current qualitative theories are in a tentative state and much remains to be done. However, there is also a quantitative side to semantics. Indeed, many of the questions which any semantic theory must answer are at once qualitative and quantitative. We would like to draw upon complexity-theoretic techniques to answer such questions. We are currently working on the development of new algebraic constructs to provide a mathematical framework for both qualitative and quantitative analysis of semantic problems.