Bounding linear head reduction and visible interaction through skeletons

DOI10.2168/LMCS-11(2:6)2015zbMath1391.68018arXiv1503.04034MaRDI QIDQ2941754

Pierre Clairambault

Publication date: 25 August 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.04034

zbMATH Keywords

complexitygame semanticslinear head reduction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ GAME SEMANTICS AND THE GEOMETRY OF BACKTRACKING: A NEW COMPLEXITY ANALYSIS OF INTERACTION ⋮ Exact bounds for acyclic higher-order recursion schemes

This page was built for publication: Bounding linear head reduction and visible interaction through skeletons