A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations
From MaRDI portal
Cites work
- (Leftmost-outermost) beta reduction is invariant, indeed
- A new Characterization of Type-2 Feasibility
- A new recursion-theoretic characterization of the polytime functions
- A term rewriting characterization of the polytime functions and related complexity classes
- A tier-based typed programming language characterizing Feasible Functionals
- Adventures in time and space
- Algorithms with polynomial interpretation termination proof
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
- Characterizing polynomial time complexity of stream programs using interpretations
- Closing the gap between runtime complexity and polytime computability
- Combinatory reduction systems: Introduction and survey
- Complexity hierarchies and higher-order cons-free term rewriting
- Complexity theory for operators in analysis
- Computation by interaction for space-bounded functional programming
- Computational Complexity
- Cost-size semantics for call-by-value higher-order rewriting
- Foundations of software science and computation structures. 25th international conference, FOSSACS 2022, held as part of the European joint conferences on theory and practice of software, ETAPS 2022, Munich, Germany, April 2--7, 2022. Proceedings
- Game semantics approach to higher-order complexity
- Higher-order interpretations and program complexity
- Higher-order interpretations and program complexity
- Higher-order rewrite systems and their confluence
- scientific article; zbMATH DE number 1696756 (Why is no real title available?)
- scientific article; zbMATH DE number 996558 (Why is no real title available?)
- scientific article; zbMATH DE number 1342224 (Why is no real title available?)
- scientific article; zbMATH DE number 2006637 (Why is no real title available?)
- scientific article; zbMATH DE number 2079048 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- Light linear logic
- Linear types and non-size-increasing polynomial time computation.
- Logic for Programming, Artificial Intelligence, and Reasoning
- On basic feasible functionals and the interpretation method
- On characterizations of the basic feasible functionals. I
- On constructor rewrite systems and the lambda calculus
- On quasi-interpretations, blind abstractions and implicit complexity
- Orderings for term-rewriting systems
- Polynomial and abstract subrecursive classes
- Polynomial path orders
- Programming languages and systems. 9th Asian symposium, APLAS 2011, Kenting, Taiwan, December 5--7, 2011. Proceedings
- Quasi-interpretations. A way to control resources
- Realizability models and implicit complexity
- Soft linear logic and polynomial time
- Term Rewriting and Applications
- The expressive power of higher-order types or, life without CONS
- The relative complexity of NP search problems
- Theory of higher order interpretations and application to basic feasible functions
- Tuple Interpretations for Higher-Order Complexity.
- Type-two polynomial-time and restricted lookahead
This page was built for publication: A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858434)
