A Kawamura, S Cook - ACM Transactions on Computation Theory (TOCT …, 2012 - dl.acm.org
We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions …
Type systems are effective tools for verifying the security of cryptographic programs. They provide automation, modularity and scalability, and have been applied to large security …
Logical relations are one among the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher …
J Mitchell, M Mitchell, A Scedrov - Proceedings 39th Annual …, 1998 - ieeexplore.ieee.org
We present a higher-order functional notation for polynomial-time computation with an arbitrary 0, 1-valued oracle. This formulation provides a linguistic characterization for …
We introduce a typed programming formalism, type-2 inflationary tiered loop programs or ITLP2, that characterizes the type-2 basic feasible functionals. ITLP2 is based on Bellantoni …
P Baillot, U Dal Lago, C Kop, D Vale - International Conference on …, 2024 - Springer
The class of basic feasible functionals (BFF) is the analog of FP (polynomial time functions) for type-2 functionals, that is, functionals that can take (first-order) functions as arguments …
A Modular Calculus for the Average Cost of Data Structuring introduces MOQA, a new domain-specific programming language which guarantees the average-case time analysis …
S Selivanova, F Steinberg, H Thies… - Computer Algebra in …, 2021 - Springer
We devise and analyze the bit-cost of solvers for linear evolutionary systems of Partial Differential Equations (PDEs) with given analytic initial conditions. Our algorithms are …
T Strahm - Information and Computation, 2003 - Elsevier
Applicative theories form the basis of Feferman's systems of explicit mathematics, which have been introduced in the 1970s. In an applicative universe, all individuals may be …