The Functions Provable by First Order Abstraction
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Termination Proofs and Complexity Certification
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Applicative Control and Computational Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Actual Arithmetic and Feasibility
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Programming languages capturing complexity classes
Nordic Journal of Computing
An arithmetic for polynomial-time computation
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
A flow calculus of mwp-bounds for complexity analysis
ACM Transactions on Computational Logic (TOCL)
Computability over an arbitrary structure: sequential and parallel polynomial time
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Feasible functions over co-inductive data
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Introduction to clarithmetic I
Information and Computation
The small grzegorczyk classes and the typed λ-calculus
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The flow of data and the complexity of algorithms
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Complexity in predicative arithmetic
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Hi-index | 0.00 |