Towards the complexity analysis of programming language proof methods
From MaRDI portal
Publication:6605344
DOI10.1007/978-3-031-47963-2_8MaRDI QIDQ6605344FDOQ6605344
Authors: Matteo Cimini 
Publication date: 13 September 2024
Cites Work
- A theory of type polymorphism in programming
- Abella: a system for reasoning about relational specifications
- A new recursion-theoretic characterization of the polytime functions
- LOGSPACE and PTIME characterized by programming languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Practical foundations for programming languages
- Types and programing languages
- Information flow inference for ML
- A syntactic approach to type soundness
- Intensional interpretations of functionals of finite type I
- Title not available (Why is that?)
- A formulation of the simple theory of types.
This page was built for publication: Towards the complexity analysis of programming language proof methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6605344)
