Read/write factorizable programs

DOI10.1017/s0956796823000023OpenAlexW4380050793MaRDI QIDQ6113488

Jakob Grue Simonsen, Siddharth Bhaskar

Publication date: 9 August 2023

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796823000023

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combination framework for complexity
• Quasi-interpretations. A way to control resources
• A new recursion-theoretic characterization of the polytime functions
• Theory of program structures: Schemes, semantics, verification
• Light linear logic
• LOGSPACE and PTIME characterized by programming languages
• Soft linear logic and polynomial time
• Implicit recursion-theoretic characterizations of counting classes
• Types for complexity of parallel computation in pi-calculus
• Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs
• A higher-order characterization of probabilistic polynomial time
• A new order-theoretic characterisation of the polytime computable functions
• The expressive power of higher-order types or, life without CONS
• The Power of Non-determinism in Higher-Order Implicit Complexity
• Some Programming Languages for Logspace and Ptime
• An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
• The strength of non-size increasing computation
• A Path Order for Rewrite Systems that Compute Exponential Time Functions
• Indexing of subrecursive classes
• Subrecursive Programming Languages, Part I
• Implicit computation complexity in higher-order programming languages
• Subclasses of \textsc{Ptime} interpreted by programming languages

This page was built for publication: Read/write factorizable programs