scientific article
From MaRDI portal
Publication:3142166
zbMath0781.68059MaRDI QIDQ3142166
Daniel Leivant, Jean-Yves Marion
Publication date: 5 December 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatory logic and lambda calculus (03B40)
Related Items
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus ⋮ A type-based complexity analysis of object oriented programs ⋮ Computation models and function algebras ⋮ Complete and tractable machine-independent characterizations of second-order polytime ⋮ An analysis of the Core-ML language: Expressive power and type reconstruction ⋮ Light linear logic ⋮ Quasi-interpretations. A way to control resources ⋮ Type inference for light affine logic via constraints on words ⋮ Implicit complexity over an arbitrary structure: Quantifier alternations ⋮ Unnamed Item ⋮ Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets ⋮ Light linear logic ⋮ Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations ⋮ Realizability models for BLL-like languages ⋮ On the computational complexity of imperative programming languages ⋮ Safe recursion with higher types and BCK-algebra ⋮ Implicit characterizations of FPTIME and NC revisited ⋮ Linear logic by levels and bounded time complexity ⋮ Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity ⋮ Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs ⋮ An abstract approach to stratification in linear logic ⋮ A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations ⋮ Characterizing polynomial time complexity of stream programs using interpretations ⋮ Causal computational complexity of distributed processes
