Pages that link to "Item:Q2740986"
From MaRDI portal
The following pages link to The expressive power of higher-order types or, life without CONS (Q2740986):
Displaying 27 items.
- Computation by interaction for space-bounded functional programming (Q276265) (← links)
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Two algorithms in search of a type-system (Q733753) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) (Q1015376) (← links)
- Complexity classes and fragments of C (Q1029017) (← links)
- On the expressive power of finitely typed and universally polymorphic recursive procedures (Q1185006) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- The Power of Non-determinism in Higher-Order Implicit Complexity (Q2988663) (← links)
- Bounded minimalisation and bounded counting in argument-bounded idc's (Q3060189) (← links)
- A Characterisation of the Relations Definable in Presburger Arithmetic (Q3502652) (← links)
- Pure Iteration and Periodicity (Q3507417) (← links)
- Recursion in Higher Types and Resource Bounded Turing Machines (Q3507448) (← links)
- (Q4585074) (← links)
- Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232) (← links)
- The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic (Q4989164) (← links)
- Term rewriting characterisation of LOGSPACE for finite and infinite data (Q4993339) (← links)
- (Q5020650) (← links)
- The Expressive Power of Higher-Order Datalog (Q5108510) (← links)
- Complexity Hierarchies and Higher-Order Cons-Free Rewriting. (Q5369488) (← links)
- (Q6079241) (← links)
- Subclasses of \textsc{Ptime} interpreted by programming languages (Q6109064) (← links)
- Read/write factorizable programs (Q6113488) (← links)
- Asymptotic speedup via effect handlers (Q6561531) (← links)
