Bounding skeletons, locally scoped terms and exact bounds for linear head reduction

DOI10.1007/978-3-642-38946-7_10MaRDI QIDQ5300897zbMATH OpenOpenAlexFDO

Authors Pierre Clairambault

Publication date 28 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38946-7_10

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Bounding linear head reduction and visible interaction through skeletons
• Exact bounds for lengths of reductions in typed -calculus
• Linear -reduction
• An upper bound for reduction sequences in the typed -calculus
• Estimation of the length of interactions in arena game semantics

Cited in

(3)

• Head linear reduction and pure proof net extraction
• Estimation of the length of interactions in arena game semantics
• A Fresh Look at the λ-Calculus

This page was built for publication: Bounding skeletons, locally scoped terms and exact bounds for linear head reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300897)