scientific article; zbMATH DE number 7561616
From MaRDI portal
Publication:5092325
DOI10.4230/LIPIcs.ICALP.2019.123MaRDI QIDQ5092325
Pierre Pradic, Lê Thành Dũng Nguyên
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation by interaction for space-bounded functional programming
- Realizability models and implicit complexity
- Linear logic
- Space-bounded hierarchies and probabilistic computations
- The system \({\mathcal F}\) of variable types, fifteen years later
- A simple proof of a theorem of Statman
- The typed lambda-calculus is not elementary recursive
- Light linear logic
- Linear logic and elementary time
- Reversible, irreversible and optimal \(\lambda\)-machines
- Parallel and serial hypercoherences
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
- Database query languages embedded in the typed lambda calculus
- On the power of unambiguity in log-space
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy
- Sequential algorithms and strongly stable functions
- Higher Types, Finite Domains and Resource-bounded Turing Machines
- On dialogue games and coherent strategies
- Mathematics and Computer Science: Coping with Finiteness
- Parsimonious Types and Non-uniform Computation
- Languages that Capture Complexity Classes
- Nondeterministic Space is Closed under Complementation
- Making Nondeterminism Unambiguous
- Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus
- Simple Parsimonious Types and Logarithmic Space
- Automata, Languages and Programming
This page was built for publication:
