A tier-based typed programming language characterizing Feasible Functionals
From MaRDI portal
Publication:5145661
DOI10.1145/3373718.3394768OpenAlexW3028608028MaRDI QIDQ5145661FDOQ5145661
Jean-Yves Marion, Romain Péchoux, Emmanuel Hainry, Bruce M. Kapron
Publication date: 21 January 2021
Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.11605
Cited In (7)
- High-level modelling for typed functional programming
- An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
- Complete and tractable machine-independent characterizations of second-order polytime
- On basic feasible functionals and the interpretation method
- Title not available (Why is that?)
- Title not available (Why is that?)
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
This page was built for publication: A tier-based typed programming language characterizing Feasible Functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145661)
