Imagen de Portada

LFPL: Revisited and Mechanized

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Glover, Nathaniel, Hoffmann, Jan
Formato:	Preprint
Publicado:	2026
Materias:	Programming Languages Computational Complexity Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Kleene algebra with commutativity conditions is undecidable
por: de Amorim, Arthur Azevedo, et al.
Publicado: (2024)

Reasonable Space for the $λ$-Calculus, Logarithmically
por: Accattoli, Beniamino, et al.
Publicado: (2022)

Complete and tractable machine-independent characterizations of second-order polytime
por: Hainry, Emmanuel, et al.
Publicado: (2022)

Reversible Computation with Stacks and "Reversible Management of Failures"
por: Palazzo, Matteo, et al.
Publicado: (2025)

Program Synthesis is $Σ_3^0$-Complete
por: Kim, Jinwoo
Publicado: (2024)

From Time to Space: The Impact of Linearity in Higher-Order Datalog
por: Charalambidis, Angelos, et al.
Publicado: (2026)

The Power of Negation in Higher-Order Datalog
por: Charalambidis, Angelos, et al.
Publicado: (2025)

Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages
por: Colledan, Andrea, et al.
Publicado: (2024)

Cypher is Turing-Complete: A Formal Proof via 2-Counter Machine Simulation
por: Halftermeyer, Pierre
Publicado: (2026)

Counting and Sampling Traces in Regular Languages
por: de Colnet, Alexis, et al.
Publicado: (2025)

Towards a Characterization of Two-way Bijections in a Reversible Computational Model
por: Palazzo, Matteo, et al.
Publicado: (2025)

A faster FPRAS for #NFA
por: Meel, Kuldeep S., et al.
Publicado: (2023)

Temporal Team Semantics Revisited
por: Gutsfeld, Jens Oliver, et al.
Publicado: (2021)

Non-commutative linear logic fragments with sub-context-free complexity
por: Nishimiya, Yusaku, et al.
Publicado: (2025)

A SUBSET-SUM Characterisation of the A-Hierarchy
por: Gutleben, Jan, et al.
Publicado: (2024)

Uniformity within Parameterized Circuit Classes
por: Hegeman, Steef, et al.
Publicado: (2025)

Proof Complexity of Linear Logics
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2026)

Parallelism and Adaptivity in Student-Teacher Witnessing
por: Ježil, Ondřej, et al.
Publicado: (2026)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
por: Nechesov, Andrey
Publicado: (2024)

An order out of nowhere: a new algorithm for infinite-domain CSPs
por: Mottet, Antoine, et al.
Publicado: (2023)

The Proof Analysis Problem
por: Arteche, Noel, et al.
Publicado: (2025)

Proof complexity of positive branching programs
por: Das, Anupam, et al.
Publicado: (2021)

Effective Versions of Strong Measure Zero
por: Rayman, Matthew
Publicado: (2025)

The complete classification for quantified equality constraints
por: Zhuk, Dmitriy, et al.
Publicado: (2021)

Meta-Mathematics of Computational Complexity Theory
por: Oliveira, Igor C.
Publicado: (2025)

On the consistency of stronger lower bounds for NEXP
por: Thapen, Neil
Publicado: (2025)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
por: Atserias, Albert, et al.
Publicado: (2024)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
por: Zhuk, Dmitriy
Publicado: (2024)

2-ASP(Q) programs with weak constraints: Complexity and efficient implementation
por: Cuteri, Andrea, et al.
Publicado: (2026)

The Expressive Power of Transformers with Chain of Thought
por: Merrill, William, et al.
Publicado: (2023)

Complexity of Consistency Testing for the Release-Acquire Semantics
por: Govind, R., et al.
Publicado: (2026)

Worst-Case Input Generation for Concurrent Programs under Non-Monotone Resource Metrics
por: Pham, Long, et al.
Publicado: (2023)

The Complexity of Nested Reset Counter Systems
por: Balasubramanian, A. R., et al.
Publicado: (2026)

Nets-within-Nets through the Lens of Data Nets
por: Di Cosmo, Francesco, et al.
Publicado: (2025)

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
por: Göller, Stefan, et al.
Publicado: (2023)

On Higher Order Busy Beaver Function
por: Cao, Zining
Publicado: (2025)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
por: Shakiba, Yousef, et al.
Publicado: (2025)

Stochastic Process Turing Machines
por: Wolpert, David, et al.
Publicado: (2024)

Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification
por: Achilleos, Antonis, et al.
Publicado: (2024)

Reachability in Geometrically $d$-Dimensional VASS
por: Fu, Yuxi, et al.
Publicado: (2025)