A syntactical analysis of non-size-increasing polynomial time computation
ACM Transactions on Computational Logic (TOCL)
UPSILON: universal programming system with incomplete lazy object notation
Fundamenta Informaticae
Actual Arithmetic and Feasibility
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
The essence of computation
Complexity classes and fragments of C
Information Processing Letters
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Programming languages capturing complexity classes
Nordic Journal of Computing
Pure Iteration and Periodicity
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Recursion in Higher Types and Resource Bounded Turing Machines
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A flow calculus of mwp-bounds for complexity analysis
ACM Transactions on Computational Logic (TOCL)
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
From proof-nets to linear logic type systems for polynomial time computing
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
A characterisation of the relations definable in Presburger arithmetic
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Bounded minimalisation and bounded counting in argument-bounded idc's
Mathematical Structures in Computer Science
Quasi-interpretations a way to control resources
Theoretical Computer Science
Ramified Corecurrence and Logspace
Electronic Notes in Theoretical Computer Science (ENTCS)
Course of value distinguishes the intentionality of programming languages
Proceedings of the Second Symposium on Information and Communication Technology
Space-Efficient computation by interaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Quasi-interpretations and small space bounds
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Some programming languages for LOGSPACE and PTIME
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
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
A higher-order characterization of probabilistic polynomial time
FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
UPSILON: Universal Programming System with Incomplete Lazy Object Notation
Fundamenta Informaticae
Pure pointer programs and tree isomorphism
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Evolving graph-structures and their implicit computational complexity
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |