Type Inference for a Polynomial Lambda Calculus
From MaRDI portal
Publication:3638250
DOI10.1007/978-3-642-02444-3_9zbMath1246.03029OpenAlexW1859659230MaRDI QIDQ3638250
Marco Gaboardi, Simonetta Ronchi della Rocca
Publication date: 2 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02444-3_9
Related Items (1)
Cites Work
- Unnamed Item
- Light types for polynomial time computation in lambda calculus
- A type inference algorithm for a stratified polymorphic type discipline
- Soft linear logic and polynomial time
- A Soft Type Assignment System for λ-Calculus
- A Machine-Oriented Logic Based on the Resolution Principle
- Typed Lambda Calculi and Applications
- Typed Lambda Calculi and Applications
This page was built for publication: Type Inference for a Polynomial Lambda Calculus