Semantics of linear/modal lambda calculus
Journal of Functional Programming
Recursion schemata for slowly growing depth circuit classes
Computational Complexity
Implicit complexity over an arbitrary structure: quantifier alternations
Information and Computation
A new function algebra of EXPTIME functions by safe nested recursion
ACM Transactions on Computational Logic (TOCL)
Implicit complexity over an arbitrary structure: Quantifier alternations
Information and Computation
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
Max-plus quasi-interpretations
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
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
A characterization of NCk by first order functional programs
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
A characterization of alternating log time by first order functional programs
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Hi-index | 0.00 |