A polytime functional language from light linear logic
From MaRDI portal
Recommendations
Cited in
(18)- Linear types and non-size-increasing polynomial time computation.
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time
- Realizability models for BLL-like languages
- Combining linear logic and size types for implicit complexity
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy
- Linear dependent types in a call-by-value scenario
- Higher-order interpretations and program complexity
- A type assignment for -calculus complete both for FPTIME and strong normalization
- An elementary affine -calculus with multithreading and side effects
- scientific article; zbMATH DE number 445159 (Why is no real title available?)
- Typing a core binary-field arithmetic in a light logic
- Linear logic and polynomial time
- Polynomial time calculi.
- scientific article; zbMATH DE number 1302629 (Why is no real title available?)
- Lilac: a functional programming language based on linear logic
- Combining linear logic and size types for implicit complexity
- Light affine logic as a programming language: a first contribution
- Computer Science Logic
This page was built for publication: A polytime functional language from light linear logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558218)